Effective workload distribution techniques can significantly reduce the total completion time of a program on and computing environments. In this paper, we propose a dynamic performance-based workload partition approa...
详细信息
ISBN:
(纸本)3540338098
Effective workload distribution techniques can significantly reduce the total completion time of a program on and computing environments. In this paper, we propose a dynamic performance-based workload partition approach for master-slave types of applications on grids. Furthermore, we implement two types of applications and conduct the experimentations on our grid testbed. Experimental results showed that our method could execute more efficiently than traditional schemes.
The Feedback-Guided Dynamic loopscheduling (FGDLS) algorithm [1] is a recent dynamic approach to the scheduling of a parallelloop within a sequential outer loop. Earlier papers have analysed convergence under the as...
详细信息
The Feedback-Guided Dynamic loopscheduling (FGDLS) algorithm [1] is a recent dynamic approach to the scheduling of a parallelloop within a sequential outer loop. Earlier papers have analysed convergence under the assumption that the workload is a positive, continuous, function of a continuous argument (the iteration number). However, this assumption is unrealistic since it is known that the iteration number is a discrete variable. In this paper we extend the proof of convergence of the algorithm to the case where the iteration number is treated as a discrete variable. We are able to establish convergence of the FGDLS algorithm for the case when the workload is monotonically decreasing.
To take advantage of the capability of parallel machines, application programs must contain sufficient parallelism, and this parallelism must be effectively scheduled on multiple processors. loops without dependences ...
详细信息
To take advantage of the capability of parallel machines, application programs must contain sufficient parallelism, and this parallelism must be effectively scheduled on multiple processors. loops without dependences among their iterations are a rich source of parallelism in scientific code. Restructuring compilers for sequential programs have been particularly successful in determining when loop iterations are independent and can be executed in parallel. Because of the prevalence of parallelloops, optimal parallel-loopscheduling has received considerable attention in both academic and industrial communities. INSETS: Derivation of X1.;First-Batch Finishing Time.. [ABSTRACT FROM AUTHOR]
暂无评论