Trade-offs between depth and width in parallel computation
暂无分享,去创建一个
[1] Uzi Vishkin,et al. An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.
[2] Richard J. Lipton,et al. Lower bounds for VLSI , 1981, STOC '81.
[3] Uzi Vishkin,et al. Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..
[4] Christos H. Papadimitriou,et al. Communication complexity , 1982, STOC '82.
[5] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[6] Ralph Grishman,et al. The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer , 1983, IEEE Transactions on Computers.
[7] Uzi Vishkin,et al. A complexity theory for unbounded fan-in parallelism , 1982, FOCS 1982.
[8] N. S. Barnett,et al. Private communication , 1969 .
[9] Stephen A. Cook,et al. Bounds on the time for parallel RAM's to compute simple functions , 1982, STOC '82.
[10] David J. Kuck,et al. A Survey of Parallel Machine Organization and Programming , 1977, CSUR.
[11] Steven Fortune,et al. Parallelism in random access machines , 1978, STOC.
[12] Uzi Vishkin,et al. A complexity theory for unbounded fan-in parallelism , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[13] Leslie M. Goldschlager,et al. A unified approach to models of synchronous parallel machines , 1978, STOC.
[14] Uzi Vishkin,et al. Finding the maximum, merging and sorting in a parallel computation model , 1981, CONPAR.