Simulations of three adaptive, decentralized controlled, job scheduling algorithms
Computer Networks and ISDN Systems
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
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
Design and Evaluation of Effective Load Sharing 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
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Evaluation of Load Sharing in HARTS with Consideration of Its Communication Activities
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Dynamic, Competitive Scheduling of Multiple DAGs in a Distributed Heterogeneous Environment
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
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
Dynamic Migration Algorithms for Distributed Object Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
An analysis of the optimal number of servers in distributed client/server environments
Decision Support Systems
Journal of Parallel and Distributed Computing
Enhancing self-scheduling algorithms via synchronization and weighting
Journal of Parallel and Distributed Computing
Resource management using multiple feedback loops in soft real-time distributed object systems
Journal of Systems and Software
Proceedings of the 4th on Middleware doctoral symposium
| Hi-index | 14.98 |
In a heterogeneous distributed real-time system, 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 it can complete the task in time using the minimum-laxity-first-served discipline. If the node cannot guarantee the arrived task, or if 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 is to be transferred. The 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 (TSRCBs) and Bayesian estimation. By using TSRCBs, the collected state information can be used to estimate other nodes' states. Use of Bayesian estimation makes the LS algorithm adaptive to dynamically varying workloads with little computational overhead. Simulation results show that the proposed LS algorithm outperforms other LS algorithms in minimizing the probability of dynamic failure, task collisions and excessive task transfers.