Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems

Journal of Supercomputing

Volumn 15, Issue 2, 2000, Pages 163-181

  Li, Keqin ^a   Pan, Yi ^b   Zheng, Si Qing ^c  

^a STATE UNIVERSITY OF NEW YORK   (United States)

^b University of Dayton   (United States)

^c The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PIPELINE PROCESSING SYSTEMS; PROBABILITY; RANDOM ACCESS STORAGE;

PARALLEL RANDOM ACCESS MACHINE (PRAM);

PARALLEL PROCESSING SYSTEMS;

EID: 0033903632     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008103903338     Document Type: Article

References (50)

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.
3. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in clog n parallel steps. Combinatorica, 3:1-19, 1993.
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.
5. Y. Aumann and A. Schuster. Deterministic PRAM simulation with constant memory blow-up and no time-stamps. In Proceedings 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.
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.
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.
9. D. Chiarulli, R. Melhem, and S. Levitan. Using coincident optical pulses for parallel memory addressing. IEEE Computer, 30:48-57, 1987.
10. R. Cole. Parallel merge sort. SIAM Journal on Computing, 17:770-785, 1988.
11. B. Cong. Mapping of ANNs on linear array with a reconfigurable pipelined bus system. In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. I, pp. 522-529, June 1997.
12. P. W. Dowd. Wavelength division multiple access channel hypercube processor interconnection. IEEE Transactions on Computers, 41:1223-1241, 1992.
13. S. Fortune and J. Wyllie. Parallelism in random access machines. In Proceedings of 10th Annual ACM Symposium on Theory of Computing, pp. 114-118, May 1978.
14. Z. Guo. Sorting on array processors with pipelined buses. In Proceedings 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.
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.
17. T. J. Harris. A survey of PRAM simulation techniques. ACM Computing Surveys, 26:187-206, June 1994.
18. K.T. Herley. Efficient simulations of small shared memories on bounded degree networks. In Proceedings 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.
20. S. Hornick and F. P. Preparata. Deterministic PRAM simulation with constant redundancy. In Proceedings 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.
22. A. R. Karlin and E. Upfal. Parallel hashing - an efficient implementation of shared memory. Journal of the ACM, 35:876-892, 1988.
23. H. Kimm. Inversion number algorithm on a linear array with a reconfigurable pipelined bus system. In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. III, pp. 1398-1408, August 1996.
24. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
25. S. Levitan, D. Chiarulli, and R. Melhem. Coincident pulse techniques for multiprocessor interconnection structures. Applied Optics, 29:2024-2039, 1990.
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.
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. In IEEE Transactions on Parallel and Distributed Systems, 9(8): 705-720, 1998.
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. In High Performance Computing Systems and Applications, J. Schaeffer and R. Unrau, eds., Kluwer Academic Press, Boston, 1998.
29. K. Li, Y. Pan, and S. Q. Zheng, eds. Parallel Computing Using Optical Interconnections, Kluwer Academic Publishers, Boston, 1998.
30. Y. Li, Y. Pan, and S. Q. Zheng. Pipelined TDM optical bus with conditional delays. Optical Engineering, 36(9):2417-2424, 1997.
31. Y. Li and S. Q. Zheng. Parallel selection on a pipelined TDM optical buses. In Proceedings of International Conference on Parallel and Distributed Computing Systems, pp. 69-73, Dijon, France, September 1996.
32. F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmica, 5:529-544, 1990.
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.
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.
35. Y. Pan. Hough transform on arrays with an optical bus. In Proceedings 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. In Proceedings 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.
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.
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.
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.
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.
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.
43. S. Pavel and S. G. Akl. On the power of arrays with reconfigurable optical buses. In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, vol. III, pp. 1443-1454, August 1996.
44. C. Qiao and R. Melhem. Time-division optical communications in multiprocessor arrays. IEEE Transactions on Computers, 42:577-590, 1993.
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.
46. A. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42:307-326, 1991.
47. E. Upfal and A. Wigderson. How to share memory in a distributed system. Journal of the ACM, 34:116-127, 1987.
48. L. G. Valiant. General purpose parallel architectures. J. van Leeuwen, ed., In Handbook of Theoretical Computer Science, pp. 944-971. Elsevier Science Publishers, New York, 1990.
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.