The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Task assignment with unknown duration
Journal of the ACM (JACM)
Fault-Tolerant Scheduling in Distributed Real-Time Systems
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Efficient processing of client transactions in real-time
Distributed and Parallel Databases
Comparing job allocation schemes where service demand is unknown
Journal of Computer and System Sciences
Online pairing of VoIP conversations
The VLDB Journal — The International Journal on Very Large Data Bases
A marketplace for cloud resources
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Modelling job allocation where service duration is unknown
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Resource Management in Real Time Distributed System with Security Constraints: A Review
International Journal of Distributed Systems and Technologies
Hi-index | 0.00 |
Traditionally, the goal of load management protocols for distributed systems has been to ensure that nodes are equally loaded. We show that for real time systems, load balancing is not desirable since it results in the available bandwidth being distributed equally amongst all nodes-in effect making all nodes in the system capable of offering almost the same bandwidth (e.g., in cycles per second) to incoming tasks. We show that this "one size fits all" practice leads to a higher rate of missed deadlines as incoming tasks may be denied service because they require bandwidth that cannot be granted at any single node-while plenty of fragmented bandwidth is collectively available in the system. We propose a new load profiling strategy that allows the nodes of a distributed system to be unequally loaded so as to maximize the chances of finding a node that would satisfy the computational needs of incoming real time tasks. The performance of the proposed protocol is evaluated via simulation, and is contrasted to other dynamic scheduling protocols for real time distributed systems.