Load Profiling In Distributed Real-Time Systems

Load balancing is often used to ensure that nodes in a distributed systems are equally loaded. In this paper, we show that for real-time systems, load balancing is not desirable. In particular, we propose a new load-pro ling strategy that allows the nodes of a distributed system to be unequally loaded. Using load pro ling, the system attempts to distribute the load amongst its nodes so as to maximize the chances of nding a node that would satisfy the computational needs of incoming real-time tasks. To that end, we describe and evaluate a distributed load-pro ling protocol for dynamically scheduling time-constrained tasks in a loosely-coupled distributed environment. When a task is submitted to a node, the scheduling software tries to schedule the task locally so as to meet its deadline. If that is not feasible, it tries to locate another node where this could be done with a high probability of success, while attempting to maintain an overall load pro le for the system. Nodes in the sy...

• Type: Conference
• Year: 1997
• Where: ICDCS
• Authors: Azer Bestavros
• Keywords: Distributed And Parallel Computing, Distributed Systems, ICDCS 1997, Load Balancing, Load Pro