Dimension-exchange algorithms for token distribution on tree-connected architectures

Journal of Parallel and Distributed Computing

Volumn 64, Issue 5, 2004, Pages 591-605

  Houle, Michael E ^a   Symvonis, Antonios ^b   Wood, David R ^c  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Dimension exchange; Load balancing; Token distribution; Tree

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

DIMENSION-EXCHANGE; LOAD BALANCING; TOKEN DISTRIBUTION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 4544367328     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.03.011     Document Type: Article

References (32)

1. Ahmad I., Ghafoor A. Semi-distributed load balancing for massively parallel multicomputer systems. IEEE Trans. Software Eng. 17:(10):1991;987-1004.
2. Ahmad I., Ghafoor A., Fox G. Hierarchical scheduling of dynamic parallel computations on hypercube multicomputers. J. Parallel Distrib. Comput. 20:(3):1994;317-329.
3. Ahmad I., Ghafoor A., Mehrotra K., Mohan C., Ranka S. Performance modelling of load balancing algorithms using neural networks. Concurrency: Practice Experience. 6:(5):1994;393-409.
4. Broder A.Z., Frieze A.M., Shamir E., Upfal E. Near-perfect token distribution. Random Structures Algorithms. 5:(4):1994;559-572.
5. Chlebus B.S., Diks K., Pelc A. Transition-optimal token distribution. Fund. Inform. 32:(3-4):1997;313-328.
6. Cybenko G. Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7:1989;279-301.
7. Diderich C.G., Gengler M. An extended dimension order token distribution algorithm on k -ary d -cubes and its complexity. Internat. J. Found. Comput. Sci. 9:(2):1998;213-234.
8. Diderich C.G., Gengler M., Ubéda S. An efficient algorithm for solving the token distribution problem on k -ary d -cube networks. Horiguchi S., Hsu D.F., Kimura M. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '94). 1994;75-182 IEEE, New York.
9. Diekmann R., Frommer A., Monien B. Efficient schemes for nearest neighbor load balancing. Parallel Comput. 25:(7):1999;789-812.
10. Ghosh B., Leighton F.T., Maggs B.M., Muthukrishnan S., Plaxton C.G., Rajaraman R., Richa A.W., Tarjan R.E., Zuckerman D. Tight analyses of two local load balancing algorithms. SIAM J. Comput. 29:(1):1999;29-64.
11. Ghosh B., Muthukrishnan S. Dynamic load balancing by random matchings. J. Comput. System Sci. 53:(3):1996;357-370.
12. Han C.-C, Shin K.G., Yun S.K. On load balancing in multicomputer/ distributed systems equipped with circuit or cut-through switching capability. IEEE Trans. Comput. 49:(9):2000;947-957.
13. Horton G. A multi-level diffusion method for dynamic load balancing. Parallel Comput. 19:1993;209-218.
14. Hosseini S.H., Litow B., Malkawi M., McPherson J., Vairavan K. Analysis of graph coloring based distributed load balancing algorithm. J. Parallel Distrib. Comput. 10:1990;160-166.
15. Houle M.E., Tempero E., Turner G. Optimal dimension-exchange token distribution on complete binary trees. Theoret. Comput. Sci. 220:(2):1999;363-376.
16. Houle M.E., Turner G. Dimension-exchange token distribution on the mesh and the torus. Parallel Comput. 24:(2):1998;247-265.
17. Hu Y.F., Blake R.J. An improved diffusion algorithm for dynamic load balancing. Parallel Comput. 25:(4):1999;417-444.
18. Kang A.N.C., Ault D.A. Some properties of a centroid of a free tree. Inform. Process. Lett. 4:(1):1975;18-20.
19. Litow B. The influence of graph structure on generalized dimension exchange. Inform. Process. Lett. 54:(6):1995;347-353.
20. Meyer auf der Heide F., Oesterdiekhoff B., Wanka R. Strongly adaptive token distribution. Algorithmica. 15:(5):1996;413-427.
21. Mitzenmacher M. How useful is old information? IEEE Trans. Parallel Distrib. Systems. 11:(1):2000;6-20.
22. Muthukrishnan S., Ghosh B., Schultz M.H. First- and second-order diffusive methods for rapid, coarse, distributed load balancing. Theory Comput. Systems. 31:(4):1998;331-354.
23. Peleg D., Upfal E. The generalized packet routing problem. Theoret. Comput. Sci. 53:1987;218-293.
24. Peleg D., Upfal E. The token distribution problem. SIAM J. Comput. 18:(2):1989;229-243.
25. C.G. Plaxton, Load balancing on the hypercube and shuffle-exchange, Technical Report CS-TR-89-1281, Department of Computer Science, Stanford University, August 1989.
26. Radulescu A., Van Gemund A.J.C. Low-cost task scheduling for distributed memory machines. IEEE Trans. Parallel Distrib. Systems. 13:(6):2002;648-658.
27. S. Ranka, Y. Won, S. Sahni, Programming a hypercube multicomputer, IEEE Software (1988) 69-77.
28. G. Turner, H. Schröder, Token distribution on reconfigurable d -dimensional meshes, In: Proceedings of the First IEEE International Conference on Algorithms and Architectures for Parallel Processing, Vol. 1, 1995, pp. 335-344.
29. Vizing V.G. On an estimate of the chromatic class of a p -graph. Diskret. Analiz. 3:1964;25-30.
30. Xu C., Monien B., Lüling R., Lau F.C.M. Nearest-neighbor algorithms for load-balancing in parallel computers. Concurrency: Practice and Experience. 7:(7):1995;707-736.
31. Xu C.Z., Lau F.C.M. Analysis of the generalized dimension exchange method for dynamic load balancing. J. Parallel Distrib. Comput. 16:1992;385-393.
32. Xu C.Z., Lau F.C.M. The generalized dimension exchange method for load balancing in k -ary n -cubes and variants. J. Parallel Distrib. Comput. 24:1995;72-85.