Learn More
In this paper, we classify the dynamic, decentralized load balancing algorithms for heterogenous distributed computer systems into three policies: queue adjustment policy (QAP), rate adjustment policy (RAP) and queue and rate adjustment policy (QRAP). We propose two efficient algorithms, referred to as rate based load balancing via virtual routing (RLBVR)(More)
As time-triggered communication protocols [e.g., time-triggered controller area network (TTCAN), time-triggered protocol (TTP), and FlexRay] are widely used on vehicles, the scheduling of tasks and messages on in-vehicle networks becomes a critical issue for offering quality-of-service (QoS) guarantees to time-critical applications on vehicles. This paper(More)
In this paper, we propose a static, decentralized load balancing algorithm for handling multi-class jobs in distributed network system for minimizing the mean response time of a job, using the concept of virtual routing. We formulate the problem as a constrained non-linear minimization problem with job flow-rate, communication delays, and processing delays,(More)
Balancing the computational load over multiprocessor networks is an important problem in massively parallel systems. The key advantage of such systems is to allow concurrent execution of workload characterized by computation units known as processes or tasks. The scheduling problem is to maintain a balanced execution of all the tasks among the various(More)
In a large-scale multimedia storage system (LMSS) where client requests for different multimedia objects may have different demands, the placement and replication of the objects is an important factor, as it may result in an imbalance in server loading across the system. Since replication management and load balancing are all the more crucial issues in(More)
In this paper, we classify the dynamic distributed load balancing algorithms for heterogenous distributed computer systems into three policies: Queue Adjustment Policy (QAP), Rate Adjustment Policy (RAP), and Queue and Rate Adjustment Policy (QRAP). We propose two efficient algorithms, referred to as Rate-based Load Balancing via Virtual Routing (RLBVR) and(More)
In this paper, we propose a distributed algorithm for scheduling divisible loads originating from single site on arbitrary networks. We first propose a mathematical model and formulate the scheduling problem as an optimization problem with an objective to minimize the processing time of the loads. A number of theoretical results on the solution of the(More)