Movatterモバイル変換

[0]ホーム
URL:

Skip to main content
Springer Nature Link
Log in

Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In this paper, we present deterministic and probabilistic methods for simulating PRAM computations on linear arrays with reconfigurable pipelined bus systems (LARPBS). The following results are established in this paper. (1) Each step of a p-processor PRAM with m=O(p) shared memory cells can be simulated by a p-processors LARPBS in O(log p) time, where the constant in the big-O notation is small. (2) Each step of a p-processor PRAM with m=Ω(p) shared memory cells can be simulated by a p-processors LARPBS in O(log m) time. (3) Each step of a p-processor PRAM can be simulated by a p-processor LARPBS in O(log p) time with probability larger than 1−1/pc for all c>0. (4) As an interesting byproduct, we show that a p-processor LARPBS can sort p items in O(log p) time, with a small constant hidden in the big-O notation. Our results indicate that an LARPBS can simulate a PRAM very efficiently.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. Abolhassan, J. Keller, and W. Paul. On the cost-effectiveness and realization of the theoretical PRAM model. Technical Report 09/1991, FB Informatik, Universität des Saarlandes, 1991.

  2. S. G. Akl.Parallel Computation: Models and Methods, Prentice-Hall, Upper Saddle River, NJ, 1997.

    Google Scholar 

  3. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting inc log n parallel steps.Combinatorica, 3: 1-19, 1993.

    Google Scholar 

  4. H. Alt, T. Hagerup, K. Mehlhorn, and F. P. Preparata. Deterministic simulation of idealized parallel computers on more realistic ones.SIAM Journal on Computing, 16: 808-835, 1987.

    Google Scholar 

  5. Y. Aumann and A. Schuster. Deterministic PRAM simulation with constant memory blow-up and no time-stamps. InProceedings of 3rd Symposium on Frontiers of Massively Parallel Computation, pp. 22-29, 1990.

  6. P. Beame and J. Hastad. Optimal bounds for decision problems on the CRCW PRAM.Journal of the ACM, 36: 643-670, 1989.

    Google Scholar 

  7. A. F. Benner, H. F. Jordan, and V. P. Heuring. Digital optical computing with optically switched directional couplers.Optical Engineering, 30: 1936-1941, 1991.

    Google Scholar 

  8. A. Borodin and J. E. Hopcroft. Routing, merging, and sorting on parallel models of computation.Journal of Computer and System Science, 30: 130-145, 1985.

    Google Scholar 

  9. D. Chiarulli, R. Melhem, and S. Levitan. Using coincident optical pulses for parallel memory addressing.IEEE Computer, 30: 48-57, 1987.

    Google Scholar 

  10. R. Cole. Parallel merge sort.SIAM Journal on Computing, 17: 770-785, 1988.

    Google Scholar 

  11. B. Cong. Mapping of ANNs on linear array with a reconfigurable pipelined bus system. InProceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. I, pp. 522-529, June 1997.

    Google Scholar 

  12. P. W. Dowd. Wavelength division multiple access channel hypercube processor interconnection.IEEE Transactions on Computers, 41: 1223-1241, 1992.

    Google Scholar 

  13. S. Fortune and J. Wyllie. Parallelism in random access machines. InProceedings of 10th Annual ACM Symposium on Theory of Computing, pp. 114-118, May 1978.

  14. Z. Guo. Sorting on array processors with pipelined buses. InProceedings of International Conference on Parallel Processing, pp. 289-292, August 1992.

  15. Z. Guo, R. Melhem, R. Hall, D. Chiarulli, and S. Levitan. Pipelined communications in optically interconnected arrays.Journal of Parallel and Distributed Computing, 12: 269-282, 1991.

    Google Scholar 

  16. M. Hamdi and Y. Pan. Efficient parallel algorithms on optically interconnected arrays of processors.IEE Proceedings--Computers and Digital Techniques, 142: 87-92, March 1995.

    Google Scholar 

  17. T. J. Harris. A survey of PRAM simulation techniques.ACM Computing Surveys, 26: 187-206, June 1994.

    Google Scholar 

  18. K.T. Herley. Efficient simulations of small shared memories on bounded degree networks. InProceedings of 30th IEEE Annual Symposium on Foundations of Computer Science, pp. 390-395, November 1989.

  19. K. T. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded degree networks.SIAM Journal on Computing, 23: 276-292, 1994.

    Google Scholar 

  20. S. Hornick and F. P. Preparata. Deterministic PRAM simulation with constant redundancy. InProceedings of ACM Symposium on Parallel Algorithms and Architectures, pp. 103-109, June 1989.

  21. J. JáJá.An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.

    Google Scholar 

  22. A. R. Karlin and E. Upfal. Parallel hashing--an efficient implementation of shared memory.Journal of the ACM, 35: 876-892, 1988.

    Google Scholar 

  23. H. Kimm. Inversion number algorithm on a linear array with a reconfigurable pipelined bus system. InProceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. III, pp. 1398-1408, August 1996.

    Google Scholar 

  24. T. Leighton.Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.

    Google Scholar 

  25. S. Levitan, D. Chiarulli, and R. Melhem. Coincident pulse techniques for multiprocessor interconnection structures.Applied Optics, 29: 2024-2039, 1990.

    Google Scholar 

  26. K. Li. Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system.Journal of Supercomputing, 11(4): 391-403, 1997.

    Google Scholar 

  27. K. Li, Y. Pan, and S.-Q. Zheng. Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system. InIEEE Transactions on Parallel and Distributed Systems, 9(8): 705-720, 1998.

    Google Scholar 

  28. K. Li, Y. Pan, and S. Q. Zheng. Fast and efficient parallel matrix computations on a linear array with a reconfigurable pipelined optical bus system. InHigh Performance Computing Systems and Applications, J. Schaeffer and R. Unrau, eds., Kluwer Academic Press, Boston, 1998.

    Google Scholar 

  29. K. Li, Y. Pan, and S. Q. Zheng, eds.Parallel Computing Using Optical Interconnections, Kluwer Academic Publishers, Boston, 1998.

    Google Scholar 

  30. Y. Li, Y. Pan, and S. Q. Zheng. Pipelined TDM optical bus with conditional delays.Optical Engineering, 36(9): 2417-2424, 1997.

    Google Scholar 

  31. Y. Li and S. Q. Zheng. Parallel selection on a pipelined TDM optical buses. InProceedings of International Conference on Parallel and Distributed Computing Systems, pp. 69-73, Dijon, France, September 1996.

    Google Scholar 

  32. F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI.Algorithmica, 5: 529-544, 1990.

    Google Scholar 

  33. F. Luccio, A. Pietracaprina, and G. Pucci. A probabilistic simulation of PRAMs on a bounded degree network.Information Processing Letters, 28: 141-147, 1988.

    Google Scholar 

  34. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories.Acta Informatica, 21: 339-374, 1984.

    Google Scholar 

  35. Y. Pan. Hough transform on arrays with an optical bus. InProceedings of Fifth International conference on Parallel and Distributed Computing and Systems, pp. 161-166, October 1992.

  36. Y. Pan. Order statistics on optically interconnected multiprocessor systems. InProceedings of the First International Workshop on Massively Parallel Processing Using Optical Interconnections, pp. 162-169, April 1994.

  37. Y. Pan and M. Hamdi. Efficient computation of singular value decomposition on arrays with pipelined optical buses.Journal of Network and Computer Applications, 19: 235-248, July 1996.

    Google Scholar 

  38. Y. Pan, M. Hamdi, and K. Li. Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system.Future Generation Computer Systems, 13(6): 501-513, 1998.

    Google Scholar 

  39. Y. Pan and K. Li. Linear array with a reconfigurable pipelined bus system--concepts and applications.Information Sciences--An International Journal, 106(3-4): 237-258, 1998.

    Google Scholar 

  40. Y. Pan, K. Li, and S. Q. Zheng. Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system.Parallel Algorithms and Applications, 13: 1-25, 1998.

    Google Scholar 

  41. S. Pavel. Computation and communication aspects of arrays with optical pipelined buses. Ph.D. thesis, Department of Computing and Information Science, Queen's University, Ontario, Canada, 1996.

    Google Scholar 

  42. S. Pavel and S. G. Akl. Matrix operations using arrays with reconfigurable optical buses.Journal of Parallel Algorithms and Applications, 8: 223-242, 1996.

    Google Scholar 

  43. S. Pavel and S. G. Akl. On the power of arrays with reconfigurable optical buses. InProceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, vol. III, pp. 1443-1454, August 1996.

    Google Scholar 

  44. C. Qiao and R. Melhem. Time-division optical communications in multiprocessor arrays.IEEE Transactions on Computers, 42: 577-590, 1993.

    Google Scholar 

  45. S. Rajasekaran and S. Sahni. Sorting, selection and routing on the array with reconfigurable optical buses.IEEE Transactions on Parallel and Distributed Systems, 8(11): 1123-1131, 1997.

    Google Scholar 

  46. A. Ranade. How to emulate shared memory.Journal of Computer and System Sciences, 42: 307-326, 1991.

    Google Scholar 

  47. E. Upfal and A. Wigderson. How to share memory in a distributed system.Journal of the ACM, 34: 116-127, 1987.

    Google Scholar 

  48. L. G. Valiant. General purpose parallel architectures. J. van Leeuwen, ed., InHandbook of Theoretical Computer Science, pp. 944-971. Elsevier Science Publishers, New York, 1990.

    Google Scholar 

  49. L. G. Valiant. Bulk-synchronous parallel computers. Technical Report TR-08-89, Center for Research in Computing Technology, Harvard University, April 1989.

  50. S. Q. Zheng and Y. Li. Pipelined asynchronous time-division multiplexing optical bus.Optical Engineering, 36(12): 3392-3400, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, State University of New York, New Paltz, NY, 12561

    Keqin Li

  2. Department of Computer Science, University of Dayton, Dayton, OH, 45469

    Yi Pan

  3. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083

    Si Qing Zheng

Authors
  1. Keqin Li

    You can also search for this author inPubMed Google Scholar

  2. Yi Pan

    You can also search for this author inPubMed Google Scholar

  3. Si Qing Zheng

    You can also search for this author inPubMed Google Scholar

Rights and permissions

About this article

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Advertisement

[8]ページ先頭
©2009-2025 Movatter.jp