Author:
Bilardi Gianfranco,Herley Kieran T.,Pietracaprina Andrea,Pucci Geppino
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. G. Bilardi, K.T. Herley, A. Pietracaprina, G. Pucci and P. Spirakis. BSP vs. LogP. Algorithmica, 24:405–422, 1999.
2. D.E. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T.V. Eicken. LogP: A practical model of parallel computation. Communications of the ACM, 39(11):78–85, November 1996.
3. M.T. Goodrich. Communication-Efficient Parallel Sorting. In Proc. of the 28th ACM Symp on Theory of Computing, pages 247–256, Philadelphia PA, 1996.
4. P.D. MacKenzie. Lower bounds for randomized exclusive write PRAMs. Theorey of Computing Systems, 30(6):599–626, 1997.
5. V. Ramachandran, B. Grayson, and M. Dahlin. Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design. TR98-22, Dept. of CS, Univ. of Texas at Austin, November 1998. (Summary in Proc. of ACM-SIAM SODA, 1999.)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献