Abstract
This paper shows that an n=2k processor Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can simulate either a mono-directional move of an n processor hypercube or a bi-directional move of an n/2 processor hypercube using one slot when d=1 and ⌈d/g ⌉ slots when d>1. Moreover, as a direct application of the simulation, it is shown how a POPS(d, g) network, n=dg and d ≤ q, can compute the prefix sums of n data values in log2 n + O(1) slots, faster than the best previously known ad-hoc algorithm for this problem.
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
Berthomé, P., Ferreira, A.: Improved embeddings in pops networks through stack-graph models. In: Proceedings of the Third International Workshop on Massively Parallel Processing Using Optical Interconnections (1996)
Chiarulli, D., Levitan, S., Melhem, R.G., Teza, J., Gravenstreter, G.: Multiprocessor interconnection networks using partitioned optical passive star (pops) topologies and distributed control. In: Proceedings First International Workshop on Massively Parallel Processing Using Optical Interconnections (1994)
Datta, A., Soundaralakshmi, S.: Basic operations on a partitioned optical passive stars network with large group size. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002. LNCS, vol. 2329, p. 306. Springer, Heidelberg (2002)
Gravenstreter, G., Melhem, R.G.: Realizing common communication patterns in partitioned optical passive stars networks. IEEE Transactions on Computers 47(9) (September 1998)
Gravenstreter, G., Melhem, R.G., Chiarulli, D., Levitan, S., Teza, J.: The partitioned optical passive star (pops) topology. In: Proceedings Ninth International Parallel Processing Symposium (1995)
Leighton, F.T.: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, San Mateo (1992)
Mei, A., Rizzi, R.: Routing permutations in partitioned optical passive stars networks. In: Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS 2002) (April 2002)
Melhem, R.G., Gravenstreter, G., Chiarulli, D., Levitan, S.: The Communication Capabilities of Partitioned Optical Passive Star Networks, pp. 77–98. Kluwer Academics Publishers, Dordrecht (1998)
Ranka, S., Sahni, S.: Hypercube Algorithms with Applications to Image Processing and Pattern Recognition. Springer, New York (1990)
Sahni, S.: Matrix multiplication and data routing using a partitioned optical passive stars network. IEEE Transactions on Parallel and Distributed Systems 11(7) (July 2000)
Sahni, S.: The partitioned optical passive stars network: Simulations and fundamental operations. IEEE Transactions on Parallel and Distributed Systems 11(7) (July 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mei, A., Rizzi, R. (2003). Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks. In: Pinkston, T.M., Prasanna, V.K. (eds) High Performance Computing - HiPC 2003. HiPC 2003. Lecture Notes in Computer Science, vol 2913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24596-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-24596-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20626-2
Online ISBN: 978-3-540-24596-4
eBook Packages: Springer Book Archive