A hybrid parallel loop scheduling scheme on grid environments

10Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Effective loop-scheduling can significantly reduce the total execution time of a program on grid environments, especially for loop-intensive applications. This paper describes a two-phased method, named HPLS (Hybrid Parallel Loop Scheduling), to dynamically schedule loop iterations of a program on grid environments. In the first phase, most of the workload is dispatched to each node for execution according to its performance. Then, some well-known self-scheduling scheme is utilized to schedule the remaining workload. Experimental results showed that in most cases our approach could produce more efficient scheduling than previous schemes on our testbed grid. In addition, the results suggest that our approach is suitable for loop scheduling on grid environments. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Shih, W. C., Yang, C. T., & Tseng, S. S. (2005). A hybrid parallel loop scheduling scheme on grid environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3795 LNCS, pp. 370–381). https://doi.org/10.1007/11590354_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free