Deterministic PRAM simulation with constant memory blow-up and no time-stamps
暂无分享,去创建一个
[1] John J. Metzner,et al. An Improved Broadcast Retransmission Protocol , 1984, IEEE Trans. Commun..
[2] Abhiram G. Ranade,et al. How to emulate shared memory (Preliminary Version) , 1987, FOCS.
[3] Eli Upfal,et al. Parallel hashing: an efficient implementation of shared memory , 1988, JACM.
[4] Michael O. Rabin,et al. The information dispersal algorithm and its applications , 1990 .
[5] Michael O. Rabin,et al. Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.
[6] Eli Upfal,et al. How to share memory in a distributed system , 1984, JACM.
[7] Kurt Mehlhorn,et al. Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1987, SIAM J. Comput..
[8] Allan Borodin,et al. Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..
[9] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.
[10] Franco P. Preparata,et al. Deterministic P-RAM simulation with constant redundancy , 1989, SPAA '89.
[11] Eli Upfal,et al. An O(log N) deterministic packet-routing scheme , 1992, JACM.
[12] A Probabilistic Simulation of PRAMs on a Bounded Degree Network , 1988, Inf. Process. Lett..