ACM High-Performance Parallel and Distributed Computing, HPDC 2014


Article Details
Title: Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks
Article URLs:
Alternative Article URLs:
Authors: Bogdan Prisacari
  • IBM Research – Zurich Säumerstrasse 4 8803 Rüschlikon, Switzerland
Germán Rodríguez
  • IBM Research – Zurich Säumerstrasse 4 8803 Rüschlikon, Switzerland
Philip Heidelberger
  • IBM Research – Watson 1101 Kitchawan Rd Rte 134 Yorktown Heights, NY 10598
Dong Chen
  • IBM Research – Watson 1101 Kitchawan Rd Rte 134 Yorktown Heights, NY 10598
Cyriel Minkenberg
  • IBM Research – Zurich Säumerstrasse 4 8803 Rüschlikon, Switzerland
Torsten Hoefler
  • ETH Zurich Universitätstrasse 6 8092 Zürich, Switzerland
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/hpdc/PrisacariRHCMH14
Author Comments:

Discuss this paper and its artifacts below