Utility Driven Dynamic Resource Management in an Oversubscribed Energy-Constrained Heterogeneous System

被引:6
作者
Khemka, Bhavesh [1 ]
Friese, Ryan [1 ]
Pasricha, Sudeep [1 ,2 ]
Maciejewski, Anthony A. [1 ]
Siegel, Howard Jay [1 ,2 ]
Koenig, Gregory A. [3 ]
Powers, Sarah [3 ]
Hilton, Marcia [4 ]
Rambharos, Rajendra [4 ]
Poole, Steve [3 ,4 ]
机构
[1] Colorado State Univ, Dept Elect & Comp Engn, Ft Collins, CO 80523 USA
[2] Colorado State Univ, Dept Comp Sci, Ft Collins, CO 80523 USA
[3] Oak Ridge Natl Lab, Oak Ridge, TN 37831 USA
[4] Dept Def, Washington, DC 20001 USA
来源
PROCEEDINGS OF 2014 IEEE INTERNATIONAL PARALLEL & DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW) | 2014年
基金
美国国家科学基金会;
关键词
scheduling; energy-constrained; utility functions; energy filtering; TASKS;
D O I
10.1109/IPDPSW.2014.12
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we address the problem of scheduling dynamically-arriving tasks to machines in an oversubscribed heterogeneous computing environment. Each task has a monotonically decreasing utility function associated with it that represents the utility (or value) based on the task's completion time. Our system model is designed based on the environments of interest to the Extreme Scale Systems Center at Oak Ridge National Laboratory. The goal of our scheduler is to maximize the total utility earned from task completions while satisfying an energy constraint. We design an energy-aware heuristic and compare its performance to heuristics from the literature. We also design an energy filtering technique for this environment that is used in conjunction with the heuristics. The filtering technique adapts to the energy remaining in the system and estimates a fair-share of energy that a task's execution can consume. The filtering technique improves the performance of all the heuristics and distributes the consumption of energy throughout the day. Based on our analysis, we recommend the level of filtering to maximize the performance of scheduling techniques in an oversubscribed environment.
引用
收藏
页码:58 / 67
页数:10
相关论文
共 35 条
[1]  
ALI S, 2000, Journal of Applied Science and Engineering, V3, P195
[2]  
[Anonymous], 1979, COMPUTERS INTRACTABI
[3]  
Barada H., 2001, 10 IEEE HETEROGENEOU, P875
[4]  
Bohrer P, 2002, S COMP SCI, P261
[5]  
Briceno L. D., 2011, 2011 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum, P7, DOI 10.1109/IPDPS.2011.123
[6]   Characterization of the iterative application of makespan heuristics on non-makespan machines in a heterogeneous parallel and distributed environment [J].
Briceno, Luis Diego ;
Siegel, Howard Jay ;
Maciejewski, Anthony A. ;
Oltikar, Mohana .
JOURNAL OF SUPERCOMPUTING, 2012, 62 (01) :461-485
[7]   Heuristics for Robust Resource Allocation of Satellite Weather Data Processing on a Heterogeneous Parallel System [J].
Briceno, Luis Diego ;
Siegel, Howard Jay ;
Maciejewski, Anthony A. ;
Oltikar, Mohana ;
Brateman, Jeff ;
White, Joe ;
Martin, Jonathan R. ;
Knapp, Keith .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (11) :1780-1787
[8]   Toward Energy-Efficient Computing [J].
Brown, David J. ;
Reams, Charles .
COMMUNICATIONS OF THE ACM, 2010, 53 (03) :50-58
[9]   An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems [J].
Dhodhi, MK ;
Ahmad, I ;
Yatama, A ;
Ahmad, I .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2002, 62 (09) :1338-1361
[10]   A benefit function mapping heuristic for a class of meta-tasks in grid environments [J].
Ding, Q ;
Chen, GL .
FIRST IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER COMPUTING AND THE GRID, PROCEEDINGS, 2001, :654-659