A scheduling system for exploiting data and task parallelism on PC laboratory clusters
Abstract
Presents a framework for deciding on a good execution strategy for a given program based on the available data and task parallelism in the program on PC laboratory clusters. Proposes a virtual cluster scheduling scheme to take account of the relationships between tasks for task parallelism, and also processor speed, processor load and network environment to balance load for data parallelism in a PC cluster environment. The approach is very effective in terms of the overall execution time, and demonstrates the feasibility of automatic cluster assignment, processor set selection and data partition functions for data and task parallel programs.
Keywords
Citation
Chen, Y., Tseng, L. and Chen, Y. (2003), "A scheduling system for exploiting data and task parallelism on PC laboratory clusters", Campus-Wide Information Systems, Vol. 20 No. 1, pp. 4-16. https://doi.org/10.1108/10650740310455559
Publisher
:MCB UP Ltd
Copyright © 2003, MCB UP Limited