LOAD SHARING WITH CONSIDERATION OF FUTURE TASK ARRIVALS IN HETEROGENEOUS DISTRIBUTED REAL-TIME SYSTEMS

被引:19
作者
HOU, CJ [1 ]
SHIN, KG [1 ]
机构
[1] UNIV MICHIGAN,DEPT ELECT ENGN & COMP SCI,REAL TIME COMP LAB,ANN ARBOR,MI 48109
基金
美国国家科学基金会;
关键词
DEADLINES; REAL-TIME SYSTEMS; LOAD SHARING; LOCATION POLICY; QUEUING ANALYSIS; BAYESIAN PARAMETER ESTIMATION; PERFORMANCE EVALUATION;
D O I
10.1109/12.312127
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In a heterogeneous distributed real-time system, some nodes may experience more task arrivals than others, or tasks arrived at some nodes may have tighter laxities than those arrived at other nodes. In such an environment, transferring an unguaranteed task at a node to another node currently with the most abundant resources is not necessarily the best decision. We propose a new load sharing (LS) algorithm for real-time applications which takes into account the effect of future task arrivals on locating the best receiver for each unguaranteed task. Upon arrival of a task at a node, the node first checks whether or not it can complete the task in time using the minimum-laxity-first-served discipline. If the node cannot guarantee the arrived task or some of existing guarantees were to be invalidated as a result of inserting the task into its queue, then the node must locate a remote node to which each unguaranteed task will be transferred. The proposed LS algorithm minimizes not only the probability of transferring an unguaranteed task T to an incapable node with Bayesian analysis, but also the probability that a remote node fails to guarantee T because of future arrivals of tighter-laxity tasks with queueing analysis. All parameters needed for a node's LS decision are collected/estimated online using time-stamped region-change broadcasts and Bayesian estimation. By using time-stamped region-change broadcasts, the collected state information, albeit obsolete, can be used to estimate other nodes' states. Use of Bayesian estimation makes the proposed LS algorithm adaptive to dynamically varying workloads with little computational overhead. Our simulation results show that the proposed LS algorithm outperforms other existing LS algorithms in minimizing the probability of 1) dynamic failure, 2) task collisions, and 3) excessive task transfers. The performance improvement by the proposed policy over others becomes more pronounced as the degree of system heterogeneity increases.
引用
收藏
页码:1076 / 1090
页数:15
相关论文
共 22 条
[1]  
[Anonymous], 1996, STOCHASTIC PROCESSES
[2]  
DeGroot, 1970, OPTIMAL STAT DECISIO, V82
[3]  
DEGROOT MH, 1986, PROBABILITY STATISTI
[4]   ADAPTIVE LOAD SHARING IN HOMOGENEOUS DISTRIBUTED SYSTEMS [J].
EAGER, DL ;
LAZOWSKA, ED ;
ZAHORJAN, J .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1986, 12 (05) :662-675
[5]  
Gross D, 1985, FUNDAMENTALS QUEUING, V3rd
[6]   A PERFORMANCE ANALYSIS OF MINIMUM LAXITY AND EARLIEST DEADLINE SCHEDULING IN A REAL-TIME SYSTEM [J].
HONG, J ;
TAN, X ;
TOWSLEY, D .
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (12) :1736-1744
[7]  
Kleinrock L., 1975, QUEUEING SYST
[8]  
KRISHNA CM, 1983, PERFORMANCE 83, P229
[9]   LOAD SHARING IN SOFT REAL-TIME DISTRIBUTED COMPUTER-SYSTEMS [J].
KUROSE, JF ;
CHIPALKATTI, R .
IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (08) :993-1000
[10]  
MIRCHANDANEY R, 1989, 9TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, P298, DOI 10.1109/ICDCS.1989.37959