Please use this identifier to cite or link to this item:
Title: A static load balancing algorithm via virtual routing
Authors: Zeng, Z. 
Veeravalli, B. 
Keywords: Distributed systems
Mean response time
Non-preemptive scheduling
Static load balancing
Issue Date: 2003
Citation: Zeng, Z.,Veeravalli, B. (2003). A static load balancing algorithm via virtual routing. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems 15 (1) : 244-249. ScholarBank@NUS Repository.
Abstract: We propose a novel load balancing algorithm for a static load balancing problem that considers processing multiclass jobs in distributed networks. Our objective is to minimize the mean response time of the jobs that arrive at the system. We formulate the problem as a constrained nonlinear minimization problem with job-flow rate, communication delays, and processing delays, as constraints. Using a systematic methodology, we transform the formulated problem into an equivalent virtual routing problem and propose an algorithm, referred to as Load Balancing via Virtual Routing (LBVR). Thus, we establish a correspondence between the load balancing problem and the routing problem. We show that the proposed algorithm has several interesting properties and guarantees to deliver a super-linear rate of convergence in obtaining an optimal solution, whenever it exists. With rigorous experiments we test the performance of our algorithm in terms of its rate of convergence and quality of solution.
Source Title: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
ISBN: 088986392X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Oct 14, 2021

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.