Paper Info
Title
Randomizing task placement does not randomize traffic (enough)
Abstract
Dragonflies are one of the most promising topologies for the Exascale effort for their scalability and cost. Dragonflies achieve very high throughput under uniform traffic, but have a pathological behavior under other regular traffic patterns, some of them very common in HPC applications. A recent study showed that randomization of task placement can make pathological, regular (multi-dimensional stencil) traffic patterns behave similar to uniform traffic. In this work we provide a theoretical model that is able to predict the expected performance of a generic dragonfly network under uniform traffic and characterize performance-optimal dragonflies. We then analyze whether this model can be extended to other patterns by means of benchmarking the performance of multiple such patterns under both contiguous and randomized task placement. We conclude that, although in comparison with contiguous task placement, randomization does lead to a significant improvement in performance for pathological communication patterns, this performance is not on par with that of uniform traffic, but rather half of it.
Year
DOI
Venue
2013
10.1145/2482759.2482762
Proceedings of the 2013 Interconnection Network Architecture: On-Chip, Multi-Chip
Keywords
Field
DocType
randomizing task placement,randomized task placement,traffic pattern,contiguous task placement,pathological behavior,task placement,regular traffic pattern,uniform traffic,pathological communication pattern,randomize traffic,expected performance,theoretical model,network throughput,high performance computing
Supercomputer,Computer science,Stencil,Real-time computing,Network topology,Throughput,Benchmarking,Scalability,Distributed computing
Conference
Citations 
PageRank 
References 
6
0.57
3
Authors
4
Name
Order
Citations
PageRank
Ana Jokanovic1454.95
Bogdan Prisacari2847.76
German Rodriguez3979.35
Cyriel Minkenberg439939.21