The Community for Technology Leaders
Green Image
Issue No. 03 - July-September (2011 vol. 4)
ISSN: 1939-1374
pp: 207-215
Blaise Omer Yenke , Ngaoundere Institute of Technology, Ngaoundere and INRIA Mescal team, CNRS LIG lab., Grenoble
Jean-François Mehaut , INRIA Mescal team, CNRS LIG lab., Grenoble
Maurice Tchuente , IRD UMI 209 UMMISCO, Bondy and University of Yaounde I, Cameroon
Nowadays, enterprises can provide computing services through their intranet networks by letting their available resources be used as virtual clusters for scientific computation during idle periods such as nights, weekends, and holidays. Generally, these idle periods do not permit to carry out the computations completely. It is therefore necessary to save the context of uncompleted applications for possible restart. This checkpointing mechanism is subject to resource constraints: the network bandwidth, the disk bandwidth, and the delay T imposed for releasing the workstations. We first introduce a function bw that gives the bandwidth bw(m,V) of a system during the checkpointing of m applications with aggregated memory requirement V. Assuming that this bandwidth is shared equitably among the applications, the scheduling problem becomes a sequence of knapsack problems with nonlinear constraints for which we propose approximate solutions. Experiments carried out on Grid5000 show that the running time of this algorithm is negligible compared to the delay T which is of the order of few minutes. This means that the proposed scheduling algorithm does not induce a significant overhead on the checkpointing process. As a consequence, our mechanism can be incorporated in a batch scheduler.
Computing services, intranet networks, checkpoint scheduling, virtual clusters.

B. O. Yenke, J. Mehaut and M. Tchuente, "Scheduling of Computing Services on Intranet Networks," in IEEE Transactions on Services Computing, vol. 4, no. , pp. 207-215, 2011.
90 ms
(Ver 3.3 (11022016))