Scheduling Divisible Real-Time Loads on Clusters with Varying Processor Start Times

被引:15
作者
Chuprat, Suriayati [1 ]
Baruah, Sanjoy [2 ]
机构
[1] Univ Teknol Malaysia, Kuala Lumpur, Malaysia
[2] Univ N Carolina, Chapel Hill, NC 27515 USA
来源
RTCSA 2008: 14TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS - PROCEEDINGS | 2008年
关键词
D O I
10.1109/RTCSA.2008.23
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Recent research in real-time divisible load theory (RT-DLT) has addressed the problem of distributing arbitrarily parallelizable real-time workloads among processors which become available at different instants in the future. Given a real-time job and the times as which the processors become available, we devise exact efficient algorithms to solve two important problems: (i) determine the smallest number of processors needed to complete this job by its deadline; and (ii) given a specific number of processors, determine the earliest completion time for the job on these processors.
引用
收藏
页码:15 / +
页数:2
相关论文
共 9 条
[1]  
CHUPRAT S, 2007, P ICSA INT C PAR DIS
[2]  
Dantzig G. B., 1963, LINEAR PROGRAMMING E
[3]   A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].
KARMARKAR, N .
COMBINATORICA, 1984, 4 (04) :373-395
[4]  
KHACHIIAN LG, 1979, DOKL AKAD NAUK SSSR+, V244, P1093
[5]  
LIN X, 2007, P 14 IEEE INT C HIGH
[6]  
LIN X, 2006, UNLCSE20060016 DEP C
[7]  
LIN X, 2007, P IEEE REAL TIM TECH
[8]  
LIN X, 2007, P INT C PAR PROC ICP
[9]  
Lin X., 2006, P REAL TIM IN PRESS, P9