Optical simulation of shared memory

SIAM Journal on Computing

Volumn 28, Issue 5, 1999, Pages 1829-1847

  Goldberg, Leslie Ann ^a   Matias, Yossi ^b   Rao, Satish ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b LUCENT TECHNOLOGIES   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FIBER OPTIC NETWORKS; OPTICAL COMMUNICATION; RANDOM ACCESS STORAGE;

OPTICAL COMMUNICATION PARALLEL COMPUTER; PROGRAMMABLE RANDOM ACCESS MEMORY; SHARED MEMORY MACHINE;

PARALLEL PROCESSING SYSTEMS;

EID: 0032620565     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795290507     Document Type: Article

References (39)

1. H. ALT, T. HAGERUP, K. MEHLHORN, AND F.P. PREPARATA, Deterministic simulation of idealized parallel computers on more realistic ones. SIAM J. Comput., 16 (1987), pp. 808-835.
2. R.J. ANDERSON AND G.L. MILLER, Optical Communication for Pointer Based Algorithms, Technical report CRI 88-14, Computer Science Department, University of Southern California, Los Angeles, CA, 1988.
3. B. BOLLOBÁS, Martingales, isoperimetric inequalities and random, graphs, in Combinatorics, Colloq. Math. Soc. János Bolyai 52, A. Hajnal, L. Lovász, and V. T. Sós, eds., North Holland, Amsterdam, 1988, pp. 113-139.
4. J.L. CARTER AND M.N. WEGMAN, Universal classes of hash functions, J. Comput. Systems Sci., 18 (1979), pp. 143-154.
5. B.S. CHLEBUS, K. DIKS, T. HAGERUP, AND T. RADZIK, New simulations between CRCW PRAMs, in Proc. 7th Foundations of Computation Theory, Lecture Notes in Comput. Sci. 380, Springer-Verlag, New York, 1989, pp. 95-104.
6. M. DIETZFELBINGER AND F. MEYER AUF DER HEIDE, How to distribute a dictionary in a complete network, in Proc. 22nd ACM Symposium on Theory of Computing, 1990, pp. 117-127.
7. M. DIETZFELBINGER AND F. MEYER AUF DER HEIDE, Simple, efficient shared memory simulations, in Proc. 5th ACM Symposium on Parallel Algorithms and Architectures. 1993, pp. 110-119.
8. M.M. ESHAGHIAN, Parallel Computing with Optical Interconnects, Ph.D. thesis, University of Southern California, Los Angeles, CA, 1988.
9. M.M. ESHAGHIAN, Parallel algorithms for image processing on OME, IEEE Trans. Comput., 40 (1991), pp. 827-833.
10. M.M. ESHAGHIAN AND V.K.P. KUMAR, Optical arrays for parallel processing, in Proc. 2nd Annual Parallel Processing Symposium, 1988, pp. 58-71.
11. A.V. GERBESSIOTIS AND L.G. VALIANT, Direct bulk-synchronous parallel, algorithms, in Proc. 3rd Scandinavian Workshop on Algorithm Theory, 1992.
12. M. GERÉB-GRAUS AND T. TSANTILAS, Efficient optical communication in parallel computers, in Proc. 4th ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 41-48.
13. P.B. GIBBONS, Y. MATIAS, AND V.L. RAMACHANDRAN, The QRQW PRAM: Accounting for contention in parallel algorithms, in Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 638-648.
14. P.B. GIBBONS, Y. MATIAS, AND V.L. RAMACHANDRAN, Efficient low-contention parallel algorithms, in Proc. 6th ACM Symposium on Parallel Algorithms and Architectures, 1994, pp. 236-247.
15. J. GIL AND Y. MATIAS, Fast hashing on a PRAM Designing by expectation, in Proc. 2nd ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 271-280.
16. J. GIL, Y. MATIAS, AND U. VISHKIN, Towards a theory of nearly constant time parallel algorithms, in Proc. 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 698-710.
17. L.A. GOLDBERG, M. JERRUM, T. LEIGHTON, AND S. RAO, Doubly logarithmic communication algorithms for optical communication parallel computers, SIAM J. Comput., 26 (1997), pp. 1100-1119.
18. L. A. GOLDBERG, M. JERRUM, AND P.D. MACKENZIE, AnΩ(√log log n) lower bound for routing in optical networks, SIAM J. Comput., 27 (1998), pp. 1083-1098.
19. J. JÁJÁ, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
20. R.M. KARP, M. LUBY, AND F. MEYER AUF DER HEIDE, Efficient PRAM simulation on a distributed memory machine, preprint, 1994. (A preliminary version of this paper appeared in Proc. 24th ACM Symposium on Theory of Computing, 1992, pp. 318-326.)
21. A.R. KARLIN AND E. UPFAL, Parallel hashing - An efficient implementation of shared memory, in Proc. 18th ACM Symposium on Theory of Computing, 1986, pp. 160-168.
22. R.M. KARP AND V. RAMACHANDRAN, Parallel algorithms for shared-memory machines, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., Elsevier, Amsterdam. 1990, pp. 869-941.
23. C.P. KRUSKAL, L. RUDOLPH, AND M. SNIR, A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci., 71 (1990), pp. 95-132.
24. F.T. LEIGHTON, Methods for message routing in parallel machines, in Proc. 24th ACM Symposium on Theory of Computing, 1992, pp. 77-96.
25. Y. MATIAS, Highly Parallel Randomized Algorithmics, Ph.D. thesis, Tel Aviv University, Tel Aviv, Israel, 1992.
26. Y. MATIAS AND U. VISHKIN, Converting high probability into nearly-constant time With applications to parallel hashing, in Proc. 23rd ACM Symposium on Theory of Computing, 1991, pp. 307-316.
27. F. MEYER AUF DER HEIDE, C. SCHEIDELER, AND V. STEMANN, Exploiting storage redundancy to speed up randomized shared memory simulations, in Proc. 12th Symposium on Theoretical Aspects of Computer Science (STAGS), 1995, pp. 267-278.
28. P.D. MACKENZIE, C.G. PLAXTON, AND R. RAJARAMAN, On contention resolution protocols and associated probabilistic phenomena, in Proc. 26th ACM Symposium on Theory of Computing, 1994, pp. 153-162.
29. C. MCDIARMID, On the method of bounded differences, in Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 141, Cambridge University Press, Cambridge, UK, 1989, pp. 148-188.
30. W.F. MCCOLL, General purpose parallel computing, in Lectures on Parallel Computation, Proc. 1991 ALCOM Spring School on Parallel Computation, A.M. Gibbons and P. Spirakis, eds., Cambridge University Press, Cambridge, UK, 1993, pp. 337-391
31. K. MEHLHORN AND U. VISHKIN, Randomized and deterministic, simulations of PRAMs by parallel machines with restricted granularity of parallel memories, Acta Inform., 21 (1984), pp. 339-374.
32. A.G. RANADE, How to emulate shared memory, J. Comput. Systems Sci., 42 (1991), pp. 307-326.
33. S.B. RAO, Properties of an Interconnection Architecture Based on Wavelength Division Multiplexing, Technical report TR-92-009-3-0054-2, NEC Research Institute, Princeton, NJ, 1992.
34. J.H. REIF, ED., A Synthesis of Parallel Algorithms, Morgan-Kaufmann, San Francisco, CA, 1993.
35. A. SIEGEL, On universal classes of fast high performance hash functions, their time-space trade-off, and their applications, in Proc. 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 20-25.
36. E. UPFAL, Efficient schemes for parallel communications, J. Assoc. Comput. Mach., 31 (1984), pp. 507-517.
37. E. UPFAL, A probabilistic relation between desirable and feasible models of parallel computation, in Proc. 16th ACM Symposium on Theory of Computing, 1984, pp. 258-265.
38. E. UPFAL AND A. WIGDERSON, How to share memory in a distributed system, J. Assoc. Comput. Mach., 34 (1987), pp. 116-127.
39. L.G. VALIANT, General purpose parallel architectures, Handbook of Theoretical Computer Science, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, Chapter 18.