Scheduling of Computing Services on Intranet Networks - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Services Computing Year : 2011

Scheduling of Computing Services on Intranet Networks

(1, 2) , (1) , (3)
1
2
3

Abstract

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.
Not file

Dates and versions

hal-00788768 , version 1 (15-02-2013)

Identifiers

Cite

Blaise Yenke, Jean-François Mehaut, Maurice Tchuenté. Scheduling of Computing Services on Intranet Networks. IEEE Transactions on Services Computing, 2011, 4, pp.207-215. ⟨10.1109/TSC.2011.28⟩. ⟨hal-00788768⟩
92 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More