Summary
A fundamental issue affecting the performance of a parallel program is the assignment of tasks to processors in order to achieve the minimum completion time. Most of state-of-the-art approaches consider homogeneous MIMD multiprocessor systems, in which all communication channels have the same bandwidth and all processors are equally powerful. These algorithms do not run efficiently on heterogeneous systems. In this paper, we present a new approach for the mapping problem on arbitrary systems. The main idea is based on the "global load balancing, local cut-size optimization" principle. This approach has achieved encouraged results that are verified by experiments for various random graphs and processor numbers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bui, T.N., Moon, B.R.: Genetic Algorithm and Graph Partitioning. IEEE Transaction on Computer, 45, 841–855 (1996)
Fiduccia, C., Mattheyses, R.: A linear-time heuristic for improving network partitions. Technical Report 82CRD130, General Electric Co., Corporate Research and Development Center, Schenectady, NY (1982)
Hui, C.C., Chanson, S.T.: Allocating Task Interaction Graph to processors in heterogeneous networks. IEEE Transactions on Parallel and Distributed Systems, 8, 908–925 (1997)
Hendrickson, B., Leland, R.: A multilevel graph partitioning. Technical Report SAND93-1301, Sandia National Laboratories (1993)
Hendrickson, B., Leland, R.: The Chaco user's guide, version 1.0. Technical Report SAND93-2339, Sandia National Laboratories (1993)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science, Vol. 220, No. 4598, 671–680 (1983)
Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, Tech. Rep. TR 95-035, Department of Computer Science, University of Minnesota, Minneapolis, MN (1995)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report TR 95-035, Department of Computer Science, University of Minnesota (1995)
Karypis, G., Kumar, V.: Parallel Multilevel K-way Partitioning Scheme for Irregular Graphs, Report 96036, University of Minnesota (1996)
Karypis, G., Kumar, V.: METIS 4.0: Unstructured graph partitioning and sparse matrix ordering system. Technical report, Dept. of Computer Science and Engineering, Univ. of Minnesota (1998)
Kernighan, B., Lin, S.: An effective heuristic procedure for partitioning graphs. The Bell System Technical Journal, 291–308 (1970)
Lee, C.H., Shin, K.G: Optimal task assignment in homogeneous networks. IEEE Transactions on Parallel and Distributed System, 8, 119–129 (1997)
Van Laarhoven, P.J.M., Aarts, E. H. L.: Simulated Annealing: Theory and Applications, D. Reidel Publishing Company, Dordrecht, Holland (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Son, N.T., Hoang Huy, T.N., Kiet, N.A. (2005). Balance Algorithm — a New Approach to Solving the Mapping Problem on Heterogeneous Systems. In: Bock, H.G., Phu, H.X., Kostina, E., Rannacher, R. (eds) Modeling, Simulation and Optimization of Complex Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27170-8_35
Download citation
DOI: https://doi.org/10.1007/3-540-27170-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23027-4
Online ISBN: 978-3-540-27170-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)