Efficient loop scheduling on parallel and distributed systems depends mostly on load balancing, especially on heterogeneous PC-based cluster and grid computing environments, In this paper, a general approach, named Performance-Based Parallel Loop Self-Scheduling (PPLSS), was given to partition workload according to performance of grid nodes. This approach was applied to three types of application programs, which were executed on a testbed grid. Experimental results showed that our approach could execute efficiently for most scheduling parameters when estimation of node performance was accurate. © IFIP International Federation for Information Processing 2005.
CITATION STYLE
Shih, W. C., Yang, C. T., & Tseng, S. S. (2005). A performance-based parallel loop self-scheduling on grid computing environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3779 LNCS, pp. 48–55). https://doi.org/10.1007/11577188_7
Mendeley helps you to discover research relevant for your work.