Abstract
Routing problems are studied for the Parallel Alternating-Direction Access Machine. The goal is to investigate what level of optimality can be achieved depending on loads of packets per memory unit. In the case of typical moderate loads, our algorithms are optimal to within a small multiplicative constant; a deterministic and a randomized algorithm are developed, both faster than the best previously known routing algorithm. Moreover, for sufficiently large loads, an algorithm which misses optimality by only an additive lower-order term is designed. We consider also off-line routing problems, and multidimensional extension of the model.
This work was supported by the following contracts: DFG-Graduiertenkolleg “Parallele Rechnernetzwerke in der Produktionstechnik” Me 872/4-1, DFG-SFB 376 “Massive Parallelität: Algorithmen, Entwurfsmethoden, Anwendungen”, DFG Leibniz Grant Me872/6-1, and EU ESPRIT Long Term Research Project 20244 (ALCOM-IT). This research was partly done while the first and third authors were visiting Heinz Nixdorf Institut, Universität-GH Paderborn.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
F. Annexstein, M. Baumschlag, ‘A Unified Approach to Off-line Permutation Routing on Parallel Networks,’ Proc. 2nd ACM Symposium Parallel Algorithms and Architectures, ACM, 1990, pp. 398–406.
B.S. Chlebus, A. Czumaj, L. Gąsieniec, M. Kowaluk, and W. Plandowski, ‘Parallel Alternating-Direction Access Machine,’ Proc. 21st International Symposium on Mathematical Foundations of Computer Science, Springer-Verlag, 1996, LNCS 1113, pp. 267–278
R. Cole and R. J. Hopcroft, ‘On Edge Coloring Bipartite Graphs,’ SIAM Journal on Computing 11 (1982) 540–546.
K. Hwang and C-M. Cheng, ‘Performance of a RISC-based Multiprocessor Using Orthogonal-Access Memory,’ Journal of Parallel and Distributed Computing 13 (1991) 43–57.
K. Hwang, P.-S. Tseng, and D. Kim, ‘On Orthogonal Multiprocessor for Parallel Scientific Computations,’ IEEE Transactions on Computers 38 (1989) 47–61.
J. JáJá, Introduction to Parallel Algorithms”, Addison Wesley, Reading, MA, 1992.
H. Kadota, K. Kaneko, 1. Okabayashi, T. Okamoto, T. Mimura, Y. Nakakura, A. Wakatani, M. Nakajima, J. Nishikawa, K. Zaiki, and T. Nogi, Computer ADENART-its Architecture and Application,’ Proc. of the 5th ACM International Conference on Supercomputing, 1991, pp. 1–8.
H. Kadota, K. Kaneko, Y. Tanikawa, and T. Nogi, ‘VLSI Parallel Computer with Data Transfer Network: ADENA,’ Proc. of the International Conference on Parallel Processing, Vol. I, 1989, pp. 319–322.
G. F. Lev, N. Pippenger, and L.G. Valiant, ‘A Fast Parallel Algorithm for Routing in Permutation Networks,’ IEEE Transactions on Computers 30 (1981) 93–100.
T. Suel, ‘Permutation Routing and Sorting on Meshes with Row and Column Buses,’ Parallel Processing Letters 5 (1995) 63–80.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chlebus, B.S., Czumaj, A., Sibeyn, J.F. (1997). Routing on the PADAM: Degrees of optimality. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002744
Download citation
DOI: https://doi.org/10.1007/BFb0002744
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive