Oct. 13, 2021 — The annual SC Test of Time Award (ToTA) recognizes an outstanding paper that has deeply influenced the HPC discipline. It is a mark of historical impact and recognition that the paper has changed HPC trends. The ToTA also acts as an incentive for researchers and students to send their best work to the SC Conference, and as a tool for understanding what makes lasting results in the HPC discipline. Papers appearing in the SC Program 10 to 25 years prior to the current conference year are eligible for this award.
This year’s award goes to George Karypis and Vipin Kumar for their paper “Multilevel Algorithms for Multi-Constraint Graph Partitioning”, published in the Proceedings of SC98. It introduced multi-constraint graph partitioning algorithms that address the need to load balance multi-phase scientific simulations across high-performance computing system nodes to enable efficient parallel execution of computations when each mesh element requires different computation resources (e.g., CPU cycles, memory and network bandwidth). These algorithms have been incorporated into the METIS and ParMETIS graph partitioning software packages, which are used extensively to enable the efficient parallel execution of complex scientific computations. These tools, in turn, have been used in a variety of HPC applications, ranging from semiconductor design and designing electoral districts to partitioning the computational graphs of large deep-learning models. Overall, the paper has had a major impact on the field, and is destined to have a continuing impact in the years to come.
Link to presentation: https://sc21.supercomputing.org/presentation/?id=awd102&sess=sess245
Source: David H. Bailey, SC21 blog