Simulations Between Different Models of Parallel Computers

We discuss simulations of parallel computers with shared memory (PRAMs) on distributed memory machines (DMMs). Such simulations are an important step in realizing algorithms written for the theoretical PRAM model. In all simulations considered here, the shared memory is distributed over the memory modules of the DMM by means of a hash function chosen at random from a suitable universal class. We discuss universal classes of hash functions, internal organization of memory modules, and a series of classical and novel simulation results.

[1]  Torben Hagerup,et al.  Fast and Optimal Simulations between CRCW PRAMs , 1992, STACS.

[2]  Uzi Vishkin,et al.  Converting high probability into nearly-constant time—with applications to parallel hashing , 1991, STOC '91.

[3]  Friedhelm Meyer auf der Heide,et al.  Efficient PRAM simulation on a distributed memory machine , 1992, STOC '92.

[4]  Yossi Matias,et al.  Polynomial Hash Functions Are Reliable (Extended Abstract) , 1992, ICALP.

[5]  Yijie Han,et al.  An Optimal Linked List Prefix Algorithm on a Local Memory Computer , 1991, IEEE Trans. Computers.

[6]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[7]  Gaston H. Gonnet,et al.  Expected Length of the Longest Probe Sequence in Hash Code Searching , 1981, JACM.

[8]  Wolfgang J. Paul,et al.  On the cost–effectiveness of PRAMs , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[9]  Leslie G. Valiant,et al.  A Combining Mechanism for Parallel Computers , 1992, Heinz Nixdorf Symposium.

[10]  Frank Thomson Leighton,et al.  Methods for message routing in parallel machines , 1992, STOC '92.

[11]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[12]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[13]  Eli Upfal,et al.  Efficient schemes for parallel communication , 1982, PODC '82.

[14]  Friedhelm Meyer auf der Heide,et al.  How to distribute a dictionary in a complete network , 1990, STOC '90.

[15]  Friedhelm Meyer auf der Heide,et al.  Simple, efficient shared memory simulations , 1993, SPAA '93.

[16]  Eli Upfal,et al.  How to share memory in a distributed system , 1984, JACM.

[17]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[18]  Friedhelm Meyer auf der Heide,et al.  Dynamic Hashing in Real Time , 1992, Informatik.

[19]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[20]  Friedhelm Meyer auf der Heide,et al.  A New Universal Class of Hash Functions and Dynamic Hashing in Real Time , 1990, ICALP.

[21]  Wolfgang J. Paul,et al.  On the Physical Design of PRAMs , 1992, Comput. J..

[22]  Sandeep N. Bhatt,et al.  The fluent abstract machine , 1988 .

[23]  Torben Hagerup,et al.  The Log-Star Revolution , 1992, STACS.

[24]  Torben Hagerup,et al.  Fast and reliable parallel hashing , 1991, SPAA '91.

[25]  Krzysztof Diks,et al.  Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models , 1988, MFCS.

[26]  Larry Rudolph,et al.  Parallel Prefix on Fully Connected Direct Connection Machines , 1986, ICPP.

[27]  Uzi Vishkin,et al.  Towards a theory of nearly constant time parallel algorithms , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[28]  Jörg Keller,et al.  Simulation-based Comparison of Hash Functions for Emulated Shared Memory , 1993, PARLE.

[29]  Friedhelm Meyer auf der Heide,et al.  Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[30]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[31]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[32]  Thanasis Tsantilas,et al.  Efficient optical communication in parallel computers , 1992, SPAA '92.

[33]  Krzysztof Diks,et al.  New Simulations between CRCW PRAMs , 1989, FCT.

[34]  Alan Siegel,et al.  On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications , 1989, 30th Annual Symposium on Foundations of Computer Science.

[35]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[36]  Friedhelm Meyer auf der Heide,et al.  Dynamic Perfect Hashing: Upper and Lower Bounds , 1994, SIAM J. Comput..

[37]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..

[38]  Friedhelm Meyer auf der Heide,et al.  Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines , 1992, Heinz Nixdorf Symposium.

[39]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).