This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations
October 1999 (vol. 10 no. 10)
pp. 1082-1101

Abstract—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 shrinking or spreading an existing mapping when the available pool of processors changes during execution of the problem. The concept of problem edge class 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 emulation 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.

[1] S.-Y. Lee and J.K. Aggarwal, “A Mapping Strategy for Parallel Processing,” IEEE Trans. Computers vol. 36, no. 4, pp. 433–442, Apr. 1987.
[2] V. Chaudhary and J.K. Aggarwal, “Generalized Mapping of Parallel Algorithms onto Parallel Architectures,” Proc. Int'l Conf. Parallel Processing, vol. II,pp. 137–141, 1990.
[3] V.M. Lo, "Heuristic Algorithms for Task Assignment in Distributed Systems," IEEE Trans. Computers, vol. 37, no. 11, pp. 1,384-1,397, Nov. 1988.
[4] S.W. Bollinger and S.F. Midkiff,“Heuristic technique for processor and Ling assignment in multicomputers,” IEEE Trans. on Computers, vol. 40, no.3, pp. 325-331, Mar., 1991.
[5] J. Yang, L. Bic, and A. Nicolau, “A Mapping Strategy for Mimd Computers.” Proc. Int'l Conf. Parallel Processing, vol. I,pp. 102–109, 1991.
[6] B.-R. Tsai and K.G. Shin, "Communication-Oriented Assignment of Task Modules in Hypercube Multicomputers," Proc. 12th Int'l Conf. Distributed Computing Systems, pp. 38-45, 1992.
[7] L. Schwiebert and D.N. Jayasimha, “Mapping Parallel Computations to Multiprocessor Architectures Considering the Effects of Communication,” Technical Report, Ohio State Univ., Computer and Information Science Research Center, May 1992.
[8] G. Cybenko, "Dynamic Load Balancing for Distributed Memory Multiprocessors," J. Parallel and Distributed Computing, vol. 7, pp. 279-301, 1989.
[9] T. Yang and A. Gerasoulis, "A Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors," Proc. Supercomputing, pp. 633-642,Albuquerque, N.M., Nov. 1991.
[10] A. Gerasoulis, S. Venugopal, and T. Yang, “Clustering Task Graphs for Message Passing Architectures,” Proc. ACM Int'l Conf. Supercomputing, pp. 447–456, June 1990.
[11] A. Gerasoulis and T. Yang, “Static Scheduling of Parallel Programs for Message Passing Architectures,” Parallel Processing: CONPAR‘92–VAPP V, Proc. Joint Int'l Conf. Vector and Parallel Processing, L. Bouge, M. Cosnard, Y. Robert, and D. Trystram, eds., pp. 601–612, Sept. 1992.
[12] A. Gerasoulis and T. Yang,"On the granularity and clustering of directed acyclic task graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 686-701, June 1993.
[13] A. Baratloo, P. Dasgupta, and Z.M. Kedem, “Calypso: A Novel Software System for Fault-Tolerant Parallel Processing on Distributed Platforms,” Proc. Fourth IEEE Int'l Symp. High Performance Distributed Computing, pp. 122–129, Aug. 1995.
[14] J. Casas, R. Konuru, S.W. Otto, R. Prouty, and J. Walpole, “Adaptive Load Migration Systems for PVM,” Proc. Supercomputing‘94, pp. 390–399, Nov. 1994.
[15] J.C Jacob and S.-Y. Lee, “Task Spreading and Shrinking on a Network of Workstations with Various Edge Classes.” Proc. 1996 Int'l Conf. Parallel Processing, vol. 3,pp. 174–181, Aug. 1996.
[16] J.C. Jacob and S.-Y. Lee, “A New Task Mapping Model Supporting Partitioning and Merging of Tasks,” Proc. ISCA Int'l Conf. Parallel and Distributed Computing and Systems, pp. 216–221, Oct. 1993.
[17] J.C Jacob and S.-Y. Lee, “A Spanning Tree Based Recursive Refinement Algorithm for Fast Task Mapping,” Proc. Fourth IEEE Int'l Symp. High Performance Distributed Computing, pp. 58–65, Aug. 1995.
[18] J.C Jacob and S.-Y. Lee, “Recursive Task Mapping Using Adaptive System Partitioning Based on Feature Vectors,” Proc. Seventh IASTED/ISMM Int'l Conf. Parallel and Distributed Computing and Systems, pp. 206–209, Oct. 1995.
[19] J.P. Singh, W.D. Weber, and A. Gupta, "SPLASH: Stanford Parallel Applications for Shared Memory," Proc. 19th Annual Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., May 1992, pp. 5-14.
[20] S.C. Woo et al., "The SPLASH-2 Programs: Characterization and Methodological Considerations," Proc. 22nd Annual Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., June 1995, pp. 24-36.
[21] H. El-Rewini, T.G. Lewis, and H.H. Ali, Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994.

Index Terms:
Processor allocation, dynamic mapping, network of workstations, load balancing, task modeling.
Citation:
Joseph C. Jacob, Soo-Young Lee, "Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 10, pp. 1082-1101, Oct. 1999, doi:10.1109/71.808157
Usage of this product signifies your acceptance of the Terms of Use.