.png){kind=icon}
返回
Processor saving scheduling policies for multiprocessor systems
.png){kind=icon}
PRE
AI
DOI：10.1109/12.663764.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, processor scheduling policies that save processors are introduced and studied. In a multiprogrammed parallel system, a processor saving scheduling policy purposefully keeps some of the available processors idle in the presence of work to be done. The conditions under which processor saving policies can be more effective than their greedy counterparts, i.e., policies that never leave processors idle in the presence of work to be done, are examined. Sensitivity analysis is performed with respect to application speedup, system size, coefficient of variation of the applications' execution time, variability in the arrival process, and mu[tic[ass workloads. Analytical, simulation, and experimental results show that processor saving policies outperform their greedy counterparts under a variety of system and workload characteristics.
Keyword:
multiprocessor systems
processor scheduling
processor saving algorithm
work conserving
Markov analysis
performance evaluation
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Gray’s Personality Dimensions and Reasons for Voluntary Sleep Deprivation Among College Students
OAAI
OAAI分享收藏
查看更多内容