Internally deterministic parallel algorithms can be fast

Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Julian Shun. Internally deterministic parallel algorithms can be fast. In J. Ramanujam, P. Sadayappan, editors, Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2012, New Orleans, LA, USA, February 25-29, 2012. pages 181-192, ACM, 2012. [doi]

Abstract

Abstract is missing.