Author of the publication

Polynomial-Time Construction of Optimal MPI Derived Datatype Trees.

, , , and . IPDPS, page 638-647. IEEE Computer Society, (2016)

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.

 

Other publications of authors with the same name

An Improved Algorithm for (Non-commutative) Reduce-Scatter with an Application.. PVM/MPI, volume 3666 of Lecture Notes in Computer Science, page 129-137. Springer, (2005)Improved MPI All-to-all Communication on a Giganet SMP Cluster.. PVM/MPI, volume 2474 of Lecture Notes in Computer Science, page 392-400. Springer, (2002)User-Land Work Stealing Schedulers: Towards a Standard., , and . CISIS, page 811-816. IEEE Computer Society, (2008)Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions., , , and . CoRR, (2015)Allgather., and . Encyclopedia of Parallel Computing, Springer, (2011)A Pipelined Algorithm for Large, Irregular All-Gather Problems., , , , , and . Int. J. High Perform. Comput. Appl., 24 (1): 58-68 (2010)Top Picks from Hot Interconnects 2011: Petascale Network Architectures., , , and . IEEE Micro, 32 (1): 4-7 (2012)On Optimal Trees for Irregular Gather and Scatter Collectives.. IEEE Trans. Parallel Distributed Syst., 30 (9): 2060-2074 (2019)Reproducible MPI Micro-Benchmarking Isn't As Easy As You Think, , and . Proceedings of the 21st European MPI Users' Group Meeting, page 69--76. (September 2014)High-Quality Hierarchical Process Mapping., , , , and . SEA, volume 160 of LIPIcs, page 4:1-4:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)