Dimension-exchange token distribution on the mesh and the torus

Parallel Computing

Volumn 24, Issue 2, 1998, Pages 247-265

  Houle, Michael E ^a   Turner, Gavin ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Dimension exchange; Load balancing; Mesh; Parallel algorithms; Token distribution; Torus

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL ALGORITHMS;

DIMENSION EXCHANGE TOKEN DISTRIBUTION PROBLEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0032002004     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00006-4     Document Type: Article

References (16)

1. D. Diderich, H. Gengler, S. Ubéda, An efficient algorithm for solving the token distribution problem on k-ary d-cube networks, in: Proc. ISPAN '94, Kanazawa, Japan, Dec. 1994, pp. 175-182.
2. F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Strongly adaptive token distribution, in: Proceedings of the 20th ICALP, Vol. 20, 1993, pp. 398-409.
3. G. Turner, H. Schröder, Token distribution on reconfigurable d-dimensional meshes, in: Proc. 1st IEEE International Conference on Algorithms and Architectures for Parallel Processing, Vol. 1, Apr. 1995, pp. 335-344.
4. W. Aiello, B. Awerbuch, B. Maggs, S. Rao, Approximate load balancing on dynamic and asynchronous networks, in: Proc. 25th ACM Symposium on the Theory of Computing, Vol. 25, May 1993, pp. 632-641.
5. B. Ghosh, F.T. Leighton, B.M. Maggs, S. Muthukrishnan, C.G. Plaxton, R. Rajaraman, A.W. Richa, R.E. Tarjan, D. Zuckerman, Tight analyses of two local load balancing algorithms, in: Proc. 27th ACM Symposium on the Theory of Computing, Vol. 27, May 1995, pp. 548-558.
6. S.H. Hosseini, B. Litow, M. Malkawi, J. McPherson, K. Vairavan, Analysis of graph coloring based distributed load balancing algorith, J. Parallel Distributed Comput. 10 (1990) 160-166.
7. K. Batcher, Sorting networks and their applications, in: Proc. AFIPS Spring Joint Conference, Vol. 32, 1968, pp. 307-314.
8. R.T. Plunkett, A. Symvonis, On the hot-potato permutation routing algorithm of Borodin, Rabani and Schieber, in: Proc. Computing: The Australasian Theory Symposium (CATS '96), Jan. 1996, pp. 118-125.
9. A. Roberts, A. Symvonis, On deflection worm routing on meshes, in: Proc. 1st IEEE International Conference on Algorithms and Architecture for Parallel Processing, Vol. 1, Apr. 1995, pp. 375-378.
10. A. Roberts, A. Symvonis, L. Zhang, Routing on trees via matchings. Lecture Notes in Computer Science, Vol. 955, Aug. 1995, pp. 251-262.
11. G. Cybenko, Dynamic load balancing for distributed memory multiprocessors, J. Parallel Distributed Comput. 7 (1989) 279-301.
12. S. Ranka, Y. Won, S. Sahni, Programming a hypercube multicomputer, IEEE Software 5 (1988) 69-77.
13. C.G. Plaxton, Load balancing, selection and sorting on the hypercube, in: Proceedings of the ACM-SPAA, 1989, pp. 64-73.
14. C.Z. Xu, F.C.M. Lau, Analysis of the generalized dimension exchange method for dynamic load balancing, J. Parallel Distributed Comput. 16 (1992) 385-393.
15. C.Z. Xu, F.C.M. Lau, The generalized dimension exchange method on some specific structure, Technical Report TR-92-02, University of Hong Kong, 1992.
16. D. Peleg, E. Upfal, The token distribution problem, in: Proc. 27th IEEE Symposium on Foundations of Computer Science, Vol. 27, 1986, pp. 418-427.