Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Distributed control of computer systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Load sharing in soft real-time distributed computer systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Load Sharing in Distributed Real-Time Systems with State-Change Broadcasts
IEEE Transactions on Computers
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System
IEEE Transactions on Computers
Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems
IEEE Transactions on Computers
Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Performance Measures for Multiprocessor Controllers
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Load balancing in homogeneous broadcast distributed systems
Proceedings of the Computer Network Performance Symposium
Evaluation of load sharing in HARTS while considering message routing and broadcasting
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Evaluation of Load Sharing in HARTS with Consideration of Its Communication Activities
IEEE Transactions on Parallel and Distributed Systems
Parallel Processing for Real-Time Simulation: A Case Study
IEEE Parallel & Distributed Technology: Systems & Technology
Incorporation of Optimal Timeouts into Distributed Real-Time Load Sharing
IEEE Transactions on Computers
IEEE Transactions on Computers
Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Dynamic Task Scheduling with Precedence Constraints and Communication Delays
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Run-Time Statistical Estimation of Task Execution Times for Heterogeneous Distributed Computing
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Object Assignment Strategy for Distributed Multimedia Systems
MMM '98 Proceedings of the 1998 Conference on MultiMedia Modeling
Using system state information for adaptive state polling policy in distributed load balancing
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
A dynamic load distribution strategy for systems under high task variation and heavy traffic
Proceedings of the 2003 ACM symposium on Applied computing
Efficient processing of client transactions in real-time
Distributed and Parallel Databases
A least flow-time first load sharing approach for distributed server farm
Journal of Parallel and Distributed Computing
To balance or unbalance load in size-interval task allocation
Probability in the Engineering and Informational Sciences
Hi-index | 0.01 |
In a distributed real-time system, uneven task arrivals temporarily overload some nodesand leave others idle or underloaded. Consequently, some tasks may miss their deadlineseven if the overall system has the capacity to meet the deadlines of all tasks. Aneffective load-sharing (LS) scheme is proposed as a solution to this problem. Upon arrival of a task at a node, the node determines whether the node can complete the task in time under the minimum-laxity first-served policy. If the task cannot be guaranteed, or if guarantees of some other tasks are to be violated as a result of the addition of this taskto the existing schedule, the node looks up the list of loss-minimizing decisions anddetermines the best node among a set of nodes in its physical proximity, called its buddyset, to which the task(s) may be transferred. This list of decisions is periodically updatedusing Bayesian decision analysis and prior/posterior state distributions. These probabilitydistributions are derived from the information collected via time-stamped state-regionchange broadcasts within each buddy set. By characterizing the inconsistency between anode's "observed" state and the corresponding true state with prior and posteriordistributions, the node can first estimate the states of other nodes, and then use themto reduce the probability of transferring a task to an "incapable") node. Moreover, the useof prior and posterior distributions and Bayesian analysis has made the proposed schemerobust to the variation of design parameters that usually require fine-tuning for adaptiveLS. The performance of the proposed scheme is evaluated via simulation, along with fiveother schemes: no LS, LS with state probing, LS with random selection, LS with focusedaddressing, and perfect LS.