Parallel job scheduling for power constrained HPC systems

详细信息    查看全文

• 作者：M. Etinski ; ^{maja.etinski@bsc.es} ; J. Corbalan ^{julita.corbalan@bsc.es} ; J. Labarta ^{jesus.labarta@bsc.es} ; M. Valero ^{mateo.valero@bsc.es}
• 关键词：Power budget ; CPU power consumption ; Parallel job scheduling
• 刊名：Parallel Computing
• 出版年：2012
• 出版时间：December, 2012
• 年：2012
• 卷：38
• 期：12
• 页码：615-630
• 全文大小：881 K

文摘

Power has become the primary constraint in high performance computing. Traditionally, parallel job scheduling policies have been designed to improve certain job performance metrics when scheduling parallel workloads on a system with a given number of processors. The available number of processors is not anymore the only limitation in parallel job scheduling. The recent increase in processor power consumption has resulted in a new limitation: the available power. Given constraints naturally lead to an optimization problem. We proposed MaxJobPerf, a new parallel job scheduling policy based on integer linear programming. Dynamic Voltage Frequency Scaling (DVFS) is a widely used technique that running applications at reduced CPU frequency/voltage trades increased execution time for power reduction. The optimization problem determines which jobs should run and at which frequency. In this paper, we compare the MaxJobPerf policy against other power budgeting policies for different power budgets. It clearly outperforms the other power-budgeting approaches at the parallel job scheduling level. Furthermore, we give a detailed analysis of the policy parameters including a discussion on how to manage job reservations to avoid job starvation.