Author:
Sanders Peter,Träff Jesper Larsson
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. J. Bruck, C.-T. Ho, S. Kipnis, E. Upfal, and D. Weathersby. Efficient algorithms for all-to-all communications in multiport message-passing systems. IEEE Transactions on Parallel and Distributed Systems, 8(11):1143–1156, 1997.
2. S. E. Hambrusch, F. Hameed, and A. A. Khokar. Communication operations on coarse-grained mesh architectures. Parallel Computing, 21:731–751, 1995.
3. F. Harary. Graph Theory. Addison-Wesley, 1967.
4. Lect Notes Comput Sci;L. P. Huse,2000
5. N. T. Karonis, B. R. de Supinski, I. Foster, W. Gropp, E. Lusk, and J. Bresnahan. Exploiting hierarchy in parallel computer networks to optimize collective operation performance. In Proceedings of International Parallel and Distributed Processing Symposium (IPDPS’2000), pages 377–384, 2000.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Prophet: Fine-grained Load Balancing for Parallel Training of Large-scale MoE Models;2023 IEEE International Conference on Cluster Computing (CLUSTER);2023-10-31
2. MSCCLang: Microsoft Collective Communication Language;Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2;2023-01-27
3. Towards leveraging collective performance with the support of MPI 4.0 features in MPC;Parallel Computing;2022-03
4. Synthesizing optimal collective algorithms;Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2021-02-17
5. Optimal Schedule for All-to-All Personalized Communication in Multiprocessor Systems;ACM Transactions on Parallel Computing;2019-06-24