Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in...Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problem P2|decr|lp (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of the lp norm of every machine’s load. It is shown that LS algorithm is optimal for any lp norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problems P2|online|lp and P2|decr|lp are presented.展开更多
The Tilted tilted transversely isotropic(TTI)media,a kind of anisotropic medium,widely exists within the earth.For faster calculation of travel times in the TTI anisotropic media,we modifi ed a minimum traveltime tree...The Tilted tilted transversely isotropic(TTI)media,a kind of anisotropic medium,widely exists within the earth.For faster calculation of travel times in the TTI anisotropic media,we modifi ed a minimum traveltime tree algorithm with high effi ciency by dynamical modifi cation of the secondary wave propagation region during the spread of seismic waves.To manage the wavefront points in the modified version,we used a novel minimum heap sorting technique to reduce the time spent on selecting secondary waves points.In this study,seismic group velocities were obtained from analytical solutions in terms of phase angle,and the corresponding phase angles were determined by binary search rather than approximate equations for weakly anisotropic media.For the most time-consuming part of the secondary wave traveltime calculation,the parallel computation was initially performed using multiple cores and threads.Numerical examples showed that the improved method can calculate seismic travel times and ray paths faster and accurately in a 3D TTI medium.For four cores and eight threads,the computing speed increased by six times when compared to the conventional method.展开更多
The computational grid provides a promising platform for the deployment of various high-performance computing applications. A grid system consists of heterogeneous resource domains, while the computational tasks of fi...The computational grid provides a promising platform for the deployment of various high-performance computing applications. A grid system consists of heterogeneous resource domains, while the computational tasks of finite element analysis may differ in demand of computing power. The cost-effective utilization of resources in the grid can be obtained through scheduling tasks to optimal resource domains. Firstly, a cost-effective scheduling strategy is presented for finite element applications. Secondly, aiming at the conjugate gradient solver stemming from finite element analysis, a performance evaluation formula is presented for determining optimal resouree domains, which is derived from phase parallel model and takes the heterogeneous characteristic of resource domains into account. Finally, experimental results show that the presented formula delivers a good estimation of the actual execution time, and indicate that the presented formula can be used to determine optimal resource domains in the grid environment.展开更多
基金Project supported by the National Natural Science Foundation of China (Nos. 10271110 10301028) and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE+2 种基金 China Project supported by the National Natural Science Foundation of China (Nos. 10271110 10301028) and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE China
文摘Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problem P2|decr|lp (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of the lp norm of every machine’s load. It is shown that LS algorithm is optimal for any lp norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problems P2|online|lp and P2|decr|lp are presented.
基金funded by the National Key R&D Program of China (No. 2020YFA0710600)National Science Foundation of China (No. 41374098)the Special Fund of the Institute of Geophysics,China Earthquake Administration (No. DQJB19B40)
文摘The Tilted tilted transversely isotropic(TTI)media,a kind of anisotropic medium,widely exists within the earth.For faster calculation of travel times in the TTI anisotropic media,we modifi ed a minimum traveltime tree algorithm with high effi ciency by dynamical modifi cation of the secondary wave propagation region during the spread of seismic waves.To manage the wavefront points in the modified version,we used a novel minimum heap sorting technique to reduce the time spent on selecting secondary waves points.In this study,seismic group velocities were obtained from analytical solutions in terms of phase angle,and the corresponding phase angles were determined by binary search rather than approximate equations for weakly anisotropic media.For the most time-consuming part of the secondary wave traveltime calculation,the parallel computation was initially performed using multiple cores and threads.Numerical examples showed that the improved method can calculate seismic travel times and ray paths faster and accurately in a 3D TTI medium.For four cores and eight threads,the computing speed increased by six times when compared to the conventional method.
文摘The computational grid provides a promising platform for the deployment of various high-performance computing applications. A grid system consists of heterogeneous resource domains, while the computational tasks of finite element analysis may differ in demand of computing power. The cost-effective utilization of resources in the grid can be obtained through scheduling tasks to optimal resource domains. Firstly, a cost-effective scheduling strategy is presented for finite element applications. Secondly, aiming at the conjugate gradient solver stemming from finite element analysis, a performance evaluation formula is presented for determining optimal resouree domains, which is derived from phase parallel model and takes the heterogeneous characteristic of resource domains into account. Finally, experimental results show that the presented formula delivers a good estimation of the actual execution time, and indicate that the presented formula can be used to determine optimal resource domains in the grid environment.
