An energy-efficient scheduling algorithm for shared facility supercomputer centers
E.A. Kiselev, P.N. Telegin, B.M. Shabanov

TL;DR
This paper presents a new energy-efficient scheduling algorithm for supercomputer centers that reduces energy consumption with minimal impact on runtime, addressing the growing energy demands of high-performance computing.
Contribution
The paper introduces a novel scheduling algorithm tailored for shared supercomputer facilities, optimizing energy use while maintaining performance.
Findings
Significant energy reduction achieved in experiments
Minor increase in execution time observed
Algorithm outperforms existing scheduling methods
Abstract
The evolution of high-performance computing is associated with the growth of energy consumption. Performance of cluster computes (is increased via rising in performance and the number of used processors, GPUs, and coprocessors. An increment in the number of computing elements results in significant growth of energy consumption. Power grids limits for supercomputer centers (SCC) are driving the transition to more energy-efficient solutions. Often upgrade of computing resources is done step-by-step, i.e. parts of older supercomputers are removed from service and replaced with newer ones. A single SCC at any time can operate several computing systems with different performance and power consumption. That is why the problem of scheduling parallel programs execution on SCC resources to optimize energy consumption and minimize the increase in execution time (energy-efficient scheduling) is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Distributed and Parallel Computing Systems · Graph Theory and Algorithms
