Issue No. 10 - October (1999 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.808157
<p><b>Abstract</b>—In this paper, we describe how our computational model can be used for the problems of processor allocation and task mapping. The intended applications for this model include the dynamic mapping problems of <it>shrinking</it> or <it>spreading</it> an existing mapping when the available pool of processors changes during execution of the problem. The concept of <it>problem edge class</it> and other features of our model are developed to realistically and efficiently support task partitioning and merging for static and dynamic mapping. The model dictates realistic changes in the computation and communication characteristics of a problem when the problem partitioning is modified dynamically. This model forms the basis of our algorithms for shrinking and spreading, and yields realistic results for a variety of problems mapped onto real systems. An <it>emulation</it> program running on a network of workstations under PVM is used to measure execution times for the mapping solutions found by the algorithms. The results indicate that the problem edge class is a crucial consideration for processor allocation and task mapping.</p>
Processor allocation, dynamic mapping, network of workstations, load balancing, task modeling.
J. C. Jacob and S. Lee, "Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations," in IEEE Transactions on Parallel & Distributed Systems, vol. 10, no. , pp. 1082-1101, 1999.