DocumentCode :
3330841
Title :
Maximizing throughput of jobs with multiple resource requirements
Author :
Chakaravarthy, Venkatesan T. ; Roy, Sambuddha ; Sabharwal, Yogish ; Sengupta, Neha
Author_Institution :
IBM Res., New Delhi, India
fYear :
2011
fDate :
18-21 Dec. 2011
Firstpage :
1
Lastpage :
9
Abstract :
We consider the problem of scheduling jobs that require multiple resources such as memory, bandwidth and processors. For each job, the input specifies start time, finish time and profit; the input also specifies the job´s requirement for each resource. Each resource has a fixed capacity (called bandwidth). A feasible solution is a subset of jobs such that for any timeslot and any resource, the total requirement of the jobs active at the timeslot does not exceed the capacity of the resource. The goal is to maximize the profit of the jobs selected. We present an approximation algorithm with provable guarantees and effective heuristics for this problem. The algorithm has an approximation ratio of O(r), where r is the number of resources. We present an experimental evaluation of our algorithms that exhibit their effectiveness.
Keywords :
approximation theory; digital storage; processor scheduling; resource allocation; approximation algorithm; approximation ratio; bandwidth; job scheduling; memory; multiple resource requirements; processors; Algorithm design and analysis; Approximation algorithms; Approximation methods; Bandwidth; Optimized production technology; Polynomials; Processor scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Performance Computing (HiPC), 2011 18th International Conference on
Conference_Location :
Bangalore
Print_ISBN :
978-1-4577-1951-6
Electronic_ISBN :
978-1-4577-1949-3
Type :
conf
DOI :
10.1109/HiPC.2011.6152721
Filename :
6152721
Link To Document :
بازگشت