Scheduling of Computing Services on Intranet Networks

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 co...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on services computing 2011-07, Vol.4 (3), p.207-215
Main Authors: Yenke, B. O., Mehaut, J., Tchuente, M.
Format: Article
Language:English
Subjects:
Algorithms
Approximation algorithms
Approximation methods
Bandwidth
checkpoint scheduling
Checkpointing
Computation
Computer Science
Computing services
Delay
Distributed, Parallel, and Cluster Computing
intranet networks
Intranets
Networks
Operating systems
Scheduling
Studies
virtual clusters
Workstations
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1939-1374
1939-1374
2372-0204
DOI:10.1109/TSC.2011.28