| 主权项 |
1. A method comprising:
receiving, by job predicting machine logic, a plurality of input calendar entries from calendar(s) of a set of user(s) of a supercomputer, with the plurality of input calendar entries including expected run times for jobs included in a calendar(s) of a set of user(s); computing, by the job predicting machine logic, a first cost approximation associated with running a first job from a plurality of jobs on a supercomputer, with the computation of the first cost approximation being performed under an assumption that no defragmentation is performed prior to running the first job, wherein the computation of the first cost approximation is based, at least in part, upon the plurality of input calendar entries and power costs associated with running the first job without the defragmentation, and wherein the first cost approximation includes a computed expected delay cost; computing, by the job predicting machine logic, a second cost approximation associated with running the first job on the supercomputer, with the computation of the second cost approximation being performed under an assumption that defragmentation of a first partition of the supercomputer is performed prior to running the first job, wherein the computation of the second cost approximation is based, at least in part, upon the plurality of input calendar entries and power costs associated with the defragmentation and with running the first job subsequent to the defragmentation of the first partition; and on condition that the first cost approximation is greater than the second cost approximation, performing defragmentation of the first partition; wherein the first partition is a partition large enough to run the first job. |
