Abstract
A technique is described that performs the mapping of tasks to processors in parallel. The technique first partitions a task graph into subgraphs and then applies mapping algorithms on the individual subgraphs in parallel. The assignment of all subgraphs are combined in the final phase to form the assignment for the entire task graph. This technique has a number of important advantages including (1) enabling the use of more expensive algorithms on the subgraphs, (2) allowing different mapping techniques to be applied to different parts of the task graph, (3) reducing the space requirements during mapping and (4) accommodating modifications to a program without remapping of the entire task graph. Simulation results demonstrate that parallelism can be found in the mapping process and the scheduling performance of our technique using scheduling heuristics is either close or better than when the same mapping algorithm is applied to the entire graph.
Partially supported by the National Science Foundation under Grant CCR-9109089 to the University of Pittsburgh
References
B. W. Kernighan and S. Lin, “An Efficient heuristic Procedure for Partitioning Graphs,” Bell System Technical Journal, Vol. 49, no. 2, PP. 291–306, Feb., 1970.
C. Shen and W. Tsai, “A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion,” IEEE Trans. Computers, Vol. C-34, no. 3, PP. 197–203, March, 1985.
M. Girkar and C. Polychronopoulos, “Partitioning Programs for Parallel Execution,” Proceedings of ACM Supercomputing Conference, PP. 216–229, 1988.
K. Efe, “Heuristic Models of Task Assignment Scheduling in Distributed System,” Computer, Vol. 15, no. 6, PP. 50–56, June, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, S.F., Soffa, M.L. (1992). Parallel task assignment by graph partitioning. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_144
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_144
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive