论文信息 - Optimally universal parallel computers

Optimally universal parallel computers

It is shown that any program written for the idealized shared-memory model of parallel computation can be simulated on a hypercube architecture with only constant factor inefficiency, provided that the original program has a certain amount of parallel slackness.

L. Valiant

[1] Leslie G. Valiant,et al. A logarithmic time sort for linear size networks , 1982, STOC.

[2] Allan Borodin,et al. Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[3] E. Upfal. Efficient Schemes for Parallel Communication , 1984, JACM.

[4] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .

[5] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..