Paper Info
Title
Bi-criteria Scheduling Algorithm with Deployment in Cluster
Abstract
Computational grids clusters provide powerful computing resources for executing applications of large scale. In grid (clusters) usually several applications run simultaneously. The originality of Grid'5000 is that each application has characterized by its own specific requirement such as operating system (OS) or library components. Deploying the adequate OS needs to reboot the processors on which the application is executed. It is time-consuming and moreover frequent reboots may damage machines. In this work we investigate how to minimize the number of deployments, while keeping the running time as short as possible. We present the multiprocessors scheduling with deployment problem and provide a list scheduling algorithm. The analysis details are presented in the worst case performance of the algorithm.
Year
DOI
Venue
2007
10.1109/IPDPS.2007.370326
Long Beach, CA
Keywords
Field
DocType
computational complexity,grid computing,operating systems (computers),processor scheduling,workstation clusters,bi-criteria scheduling algorithm,computational complexity,computational grid cluster,library component,multiprocessor scheduling,operating system
Reboot,Multiprocessor scheduling,Grid computing,Software deployment,Fair-share scheduling,Computer science,Scheduling (computing),Parallel computing,Grid,Distributed computing,Computational complexity theory
Conference
ISBN
Citations 
PageRank 
1-4244-0910-1
0
0.34
References 
Authors
4
2
Name
Order
Citations
PageRank
Feryal-kamila Moulaï100.34
Gregory Mounie213711.22