Author of the publication

Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.

, , , , , , and . Algorithmica, 50 (2): 279-298 (2008)

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

Scheduling with Conflicts on Bipartite and Interval Graphs., and . J. Scheduling, 6 (3): 287-307 (2003)Strengthening integrality gaps for capacitated network design and covering problems., , , and . SODA, page 106-115. ACM/SIAM, (2000)Probabilistic Analysis for Scheduling with Conflicts., and . SODA, page 286-295. ACM/SIAM, (1997)Graph Tool - A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms., , and . Computational Support for Discrete Mathematics, volume 15 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 269-278. DIMACS/AMS, (1992)A Tie-Breaking Strategy for Processor Allocation in Meshes., , and . ICPP Workshops, page 331-338. IEEE Computer Society, (2010)PaCMap: Topology Mapping of Unstructured Communication Patterns onto Non-contiguous Allocations., , and . ICS, page 37-46. ACM, (2015)HPAS: An HPC Performance Anomaly Suite for Reproducing Performance Variations., , , , , , and . ICPP, page 40:1-40:10. ACM, (2019)Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance., , , , , , and . Algorithmica, 50 (2): 279-298 (2008)Local search to improve coordinate-based task mapping., , , , and . Parallel Computing, (2016)Backfilling with guarantees made as jobs arrive., , , , and . Concurrency and Computation: Practice and Experience, 25 (4): 513-523 (2013)