The Case for Disjoint Job Mapping on High-Radix Networked Parallel Computers

• Published in: Algorithms and Architectures for Parallel Processing Vol. 13156; pp. 123 - 143
• Main Authors: Hu, Yao, Koibuchi, Michihiro
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2022; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: High-radix switch; Interconnection network; Job mapping; Parallel computer
• ISBN: 9783030953874; 3030953874
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-95388-1_9

Onboard optics and co-packaged optics (CPO) will enable to build an ultra high-radix switching ASIC. Ultra high-radix interconnection networks, which take a low diameter, lead to a marginal impact of intra-job network topology on the performance of job mapping, i.e., placement of message passing interface (MPI) ranks onto compute nodes. In this context, we investigate the impact of job mapping algorithms on job scheduling performance, which have different trade-offs between the resource utilization and the constraint of intra-job network topology. Our simulation results show that a simple disjoint job mapping policy (e.g., a topology-oblivious job mapping algorithm) surprisingly outperforms a complicated joint one (e.g., a topology-aware job mapping algorithm) for its substantially better job scheduling performance at the cost of a larger network diameter, especially when dealing with an exceedingly large workload on high-radix networked parallel computers.