PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Mellor-Crummey, John M."

Author of the publication

copydeleteadd this publication to your clipboard
Barrier elision for production parallel programs.

, , , , , and . PPOPP, page 109-119. ACM, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

John Nixon University of Stuttgart

Isaac Henderson Johnson Jeyakumar University of Stuttgart

David John Cross University of Stuttgart

M. Nudischer

M. Kratzer

 

Other publications of authors with the same name

Optimizing Sparse Matrix - Vector Product Computations Using Unroll and Jam., and . IJHPCA, 18 (2): 225-236 (2004)COTS Clusters vs. the Earth Simulator: An Application Study Using IMPACT-3D., , and . IPDPS, IEEE Computer Society, (2005)On-the-fly detection of data races for programs with nested fork-join parallelism.. SC, page 24-33. ACM, (1991)Synchronization without Contention., and . ASPLOS, page 269-278. ACM Press, (1991)SIGARCH Computer Architecture News 19(2), SIGOPS Operating System Review 25(Special Issue April 1991), and SIGPLAN Notices 26(4).Portable, MPI-interoperable coarray fortran., , , and . PPOPP, page 81-92. ACM, (2014)Using Sampling to Understand Parallel Program Performance., and . Parallel Tools Workshop, page 13-25. Springer, (2011)Low-overhead call path profiling of unmodified, optimized code., , and . ICS, page 81-90. ACM, (2005)Simplifying Control Flow in Compiler-Generated Parallel Code., and . International Journal of Parallel Programming, 26 (5): 613-638 (1998)Space-filling Curve Generation: A Table-based Approach., and . AMCS, page 40-46. CSREA Press, (2005)SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion., and . ACM Trans. Math. Softw., 31 (1): 120-148 (2005)