Affiliation:
1. University of Augsburg, Germany
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Engineering (miscellaneous),Computer Science (miscellaneous)
Reference21 articles.
1. Virtual execution platforms for mixed-time-criticality systems
2. The aethereal network on chip after ten years
3. T. Hoefler T. Mehlan etal A survey of barrier algorithms for coarse grained supercomputers. 2004. T. Hoefler T. Mehlan et al. A survey of barrier algorithms for coarse grained supercomputers. 2004.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Analysing Real-Time Behaviour of Collective Communication Patterns in MPI;Proceedings of the 26th International Conference on Real-Time Networks and Systems;2018-10-10
2. Reduced Complexity Many-Core: Timing Predictability Due to Message-Passing;Architecture of Computing Systems - ARCS 2017;2017