LogP
作者： David E. Culler , Richard M. Karp , David Patterson , Abhijit Sahay , Eunice E. Santos
关键词:
摘要:
acm.org
sci-hub.se 参考文章(21)
Bowen Alpern, Larry Carter, Ephraim Feig, Ted Selker, The Uniform Memory Hierarchy Model of Computation Algorithmica. ,vol. 12, pp. 72- 109 ,(1993) , 10.1007/BF01185206
Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide, Efficient PRAM simulation on a distributed memory machine symposium on the theory of computing. pp. 318- 326 ,(1992) , 10.1145/129712.129743
Christos H. Papadimitriou, Mihalis Yannakakis, Towards an architecture-independent analysis of parallel algorithms SIAM Journal on Computing. ,vol. 19, pp. 322- 328 ,(1990) , 10.1137/0219021
Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha, A comparison of sorting algorithms for the connection machine CM-2 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91. pp. 3- 16 ,(1991) , 10.1145/113379.113380
Steven Fortune, James Wyllie, Parallelism in random access machines symposium on the theory of computing. pp. 114- 118 ,(1978) , 10.1145/800133.804339
Kurt Mehlhorn, Uzi Vishkin, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories Acta Informatica. ,vol. 21, pp. 339- 374 ,(1984) , 10.1007/BF00264615
Todd Heywood, Sanjay Ranka, A practical hierarchical model of parallel computation I. The model Journal of Parallel and Distributed Computing. ,vol. 16, pp. 212- 232 ,(1992) , 10.1016/0743-7315(92)90034-K
P. B. Gibbons, A more practical PRAM model Proceedings of the first annual ACM symposium on Parallel algorithms and architectures - SPAA '89. pp. 158- 168 ,(1989) , 10.1145/72935.72953
Albert Alexandrov, Mihai F. Ionescu, Klaus E. Schauser, Chris Scheiman, LogGP Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95. pp. 95- 105 ,(1995) , 10.1145/215399.215427
Leslie G. Valiant, A bridging model for parallel computation Communications of the ACM. ,vol. 33, pp. 103- 111 ,(1990) , 10.1145/79173.79181