Advertisement

Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks

  • Alessandro Mei
  • Romeo Rizzi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2913)

Abstract

This paper shows that an n=2 k 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.

Keywords

Binary Representation Single Direction Optical Interconnection Large Group Size Custom Algorithm 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Gravenstreter, G., Melhem, R.G.: Realizing common communication patterns in partitioned optical passive stars networks. IEEE Transactions on Computers 47(9) (September 1998)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Leighton, F.T.: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, San Mateo (1992)zbMATHGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Ranka, S., Sahni, S.: Hypercube Algorithms with Applications to Image Processing and Pattern Recognition. Springer, New York (1990)zbMATHGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Sahni, S.: The partitioned optical passive stars network: Simulations and fundamental operations. IEEE Transactions on Parallel and Distributed Systems 11(7) (July 2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alessandro Mei
    • 1
  • Romeo Rizzi
    • 2
  1. 1.Department of Computer ScienceUniversity of Rome “La Sapienza” 
  2. 2.Department of Information and Communication TechnologyUniversity of Trento 

Personalised recommendations