Skip to main content
SpringerLink
Log in

Randomized routing and PRAM emulation on parallel machines

  • Workshop on Randomized Parallel Computing Panos Pardalos, University of Florida, Gainesville Sanguthevar Rajasekaran, University of Florida, Gainesville
  • Conference paper
  • First Online:
Book cover Parallel and Distributed Processing (IPPS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1388))

Included in the following conference series:

  • 109 Accesses

Abstract

This paper shows the power of randomization in designing efficient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques optimal routing can be obtained for a large class of processor interconnection networks called leveled networks. This class includes well-known networks (e.g., mesh, hypercube and de Bruijn) as well as new ones (e.g., star graph, for which the network diameter is sub-logarithmic in the network size). Using the obtained routing algorithms, optimal emulations of the CROW PRAM on the leveled network and mesh are also given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akers, S., Harel, D. and Krishnamurthy, B.: The Star Graph: An Attractive Alternative to the n-Cube. Proc. International Conference of Parallel Processing, 1987, pp. 393–400.

    Google Scholar 

  2. Aleliunas, R.: Randomized parallel communication. Proc. Symposium on Principles of Distributed Computing, 1982, pp. 60–72.

    Google Scholar 

  3. Borodin, A. and J. E. Hopcroft: Routing, merging and sorting on parallel models of computation. Proc. Symposium on Theory of Computing, 1982, pp. 338–344.

    Google Scholar 

  4. Hoare C.A.R.: Quicksort. Computer Journal, vol. 5, no. 1, 1962, pp. 10–15.

    Article  Google Scholar 

  5. Karp, R. and Ramachandran, V.: Parallel Algorithms for Shared-Memory Machines. in Handbook of Theoretical Computer Science, North-Holland, 1990.

    Google Scholar 

  6. Karlin, A. and Upfal, E.: Parallel Hashing-An Efficient Implementation of Shared Memory. Proc. Symposium on Theory of Computing, 1986, pp. 160–168.

    Google Scholar 

  7. Krizanc, D., Rajasekaran, S., and Tsantilas, T.: Optimal Routing Algorithms for Mesh-Connected Processor Arrays. Proc. Aegean Workshop on Computing, 1988. Springer-Verlag Lecture Notes in Computer Science # 319, pp. 411–422.

    Google Scholar 

  8. Kunde, M., ‘Routing and Sorting on Mesh-Connected Arrays,’ Proc. Aegean Workshop on Computing, 1988. Springer-Verlag Lecture Notes in Computer Science # 319, pp. 423–433.

    Google Scholar 

  9. Leighton, T., Maggs, B., and Rao, S.: Universal packet routing algorithms. Proc. Symposium on Foundations of Computer Science, 1988, pp. 256–269.

    Google Scholar 

  10. Leighton, T., Makedon, F., and Tollis, I.G.: A 2n−2 Step Algorithm for Routing in an n × n Array With Constant Size Queues. Proc. Symposium on Parallel Algorithms and Architectures, 1989, pp. 328–335.

    Google Scholar 

  11. Palis, M., Rajasekaran, S., and Wei, D.S.L.: Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks. Journal of Parallel and Distributed Computing, vol. 20, no. 2, Feb. 1994, pp. 145–157.

    Article  Google Scholar 

  12. Palis, M., Rajasekaran, S., and Wei, D.S.L.: Emulation of PRAMS on Leveled Networks. 20th International Conference on Parallel Processing, Chicago, August, 1991, pp.I-418-421.

    Google Scholar 

  13. Pippenger, N.: Parallel communication with limited buffers. Proc. Symposium on Foundations of Computer Science, 1984, pp.127–136.

    Google Scholar 

  14. Rabin, M.O.: Probabilistic Algorithms. in:Traub, J.F., ed., Algorithms and Complexity, Academic Press, New York, 1976, pp. 21–36.

    Google Scholar 

  15. Ranade, A.G.: How to Emulate Shared Memory. Proc. Symposium on Foundations of Computer Science, 1987, pp. 185–194.

    Google Scholar 

  16. Solovay, R. and Strassen, V.: A Fast Monte-Carlo Test for Primality. SIAM Journal on Computing, vol. 6, 1977, pp. 84–85.

    Article  Google Scholar 

  17. Upfal, E.: Efficient schemes for parallel communication. Journal of the ACM, vol.31, no.3, 1984, pp. 507–517.

    Article  Google Scholar 

  18. Valiant, L.G.: A Scheme for Fast Parallel Communication. SIAM Journal on Computing, 11(2), 1982, pp. 350–361.

    Article  Google Scholar 

  19. Valiant, L.G., Brebner, G.J.: Universal Schemes for Parallel Communication. Proc. Symposium on Theory of Computing, 1981, pp. 263–277.

    Google Scholar 

  20. Wei, D.S.L.: Fast Parallel Routing and Computation on Interconnection Networks. Ph.D. Thesis, Univ. of Pennsylvania, Jan. 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Fordham University, 10458-5198, Bronx, NY

    David S. L. Wei

Authors
  1. David S. L. Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, D.S.L. (1998). Randomized routing and PRAM emulation on parallel machines. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_710

Download citation

  • DOI: https://doi.org/10.1007/3-540-64359-1_710

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64359-3

  • Online ISBN: 978-3-540-69756-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation