Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
نویسندگان
چکیده
منابع مشابه
Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
We consider optimal load balancing in a distributed computing environment with several homogeneous unreliable processors that have limited state information. Each processor receives its own arrival process of tasks from outside users, some of which can be redirected to the other processors. Processing times are iid and arbitrarily distributed. The arrival process of outside tasks to each proces...
متن کاملOn balancing computational load on rings of processors
We consider a simple, deterministic policy for scheduling certain genres of dynamically evolving computations | speciically, computations in which tasks that spawn produce precisely two oospring | on rings of processors. Such computations include, for instance , tree-structured branching computations. We believe that our policy yields good parallel speedup on most computations of the genre, but...
متن کاملLocally Optimal Load Balancing
This work studies distributed algorithms for locally optimal load-balancing : We are given a graph of maximum degree ∆, and each node has up to L units of load. The task is to distribute the load more evenly so that the loads of adjacent nodes differ by at most 1. If the graph is a path (∆ = 2), it is easy to solve the fractional version of the problem in O(L) communication rounds, independentl...
متن کاملSynchronous distributed load balancing on dynamic networks
In this paper, three distributed load balancing algorithms for dynamic networks are investigated. Dynamic networks are networks in which the topology may change dynamically. The definition of a dynamic network is introduced and its graph model is presented. The main result of this study consists in proving the convergence toward the uniform load distribution of the diffusion algorithm on an arb...
متن کاملOn Load Balancing for Distributed Multiagent Computing
Multiagent computing on a cluster of workstations is widely envisioned to be a powerful paradigm for building useful distributed applications. The agents of the system span across all the machines of a cluster. Just like the case of traditional distributed systems, load balancing becomes an area of concern. With different characteristics between ordinary processes and agents, it is both interes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1998
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.46.4.563