1. WCTT bounds for MPI primitives in the PaterNoster NoC
- Author
-
Jörg Mische, Theo Ungerer, Martin Frieb, and Alexander Stegmeier
- Subjects
020203 distributed computing ,Schedule ,Computer science ,02 engineering and technology ,Parallel computing ,Multiplexing ,020202 computer hardware & architecture ,Tree traversal ,0202 electrical engineering, electronic engineering, information engineering ,Computer Science (miscellaneous) ,Feature (machine learning) ,Communication source ,Message size ,Engineering (miscellaneous) ,Scope (computer science) - Abstract
This paper applies several variants of application independent time-division multiplexing to MPI primitives and investigates their applicability for different scopes of communication. Thereby, the scopes are characterized by the size of the network-on-chip, the number of participating nodes and the message size sent to each receiver or received from each sender, respectively. The evaluation shows that none of the observed variants feature the lowest worst-case traversal time in all situations. Instead there are multiple schedule variants which each perform best in a different scope of communication parameters.
- Published
- 2016
- Full Text
- View/download PDF