Results 251 to 260 of about 1,494,355 (294)
Some of the next articles are maybe not open access.
Queueing Systems, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gísli Hjálmtýsson, Ward Whitt
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gísli Hjálmtýsson, Ward Whitt
openaire +3 more sources
[1991] Proceedings. The Fifth International Parallel Processing Symposium, 2002
Assuming there is a hypercube with p=2/sup d/ processors and that each hypercube processor, PE(i), has L/sub i/ units of load. The load is always in integral units and may be distributed to other processors in integral units. In the load balancing problem the load is required to be redistributed so that if L'/sub i/ is the load on processor i following
Jinwoon Woo, Sartaj Sahni
openaire +2 more sources
Assuming there is a hypercube with p=2/sup d/ processors and that each hypercube processor, PE(i), has L/sub i/ units of load. The load is always in integral units and may be distributed to other processors in integral units. In the load balancing problem the load is required to be redistributed so that if L'/sub i/ is the load on processor i following
Jinwoon Woo, Sartaj Sahni
openaire +2 more sources
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005
This paper is about load-balancing packets across multiple paths inside a switch, or across a network. It is motivated by the recent interest in load-balanced switches. Load-balanced switches provide an appealing alternative to crossbars with centralized schedulers. A load-balanced switch has no scheduler, is particularly amenable to optics, and - most
Isaac Keslassy +3 more
openaire +1 more source
This paper is about load-balancing packets across multiple paths inside a switch, or across a network. It is motivated by the recent interest in load-balanced switches. Load-balanced switches provide an appealing alternative to crossbars with centralized schedulers. A load-balanced switch has no scheduler, is particularly amenable to optics, and - most
Isaac Keslassy +3 more
openaire +1 more source
IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference, 2007
We study the problem of balancing the traffic load in a network by route selection. The traditional approach starts from a given traffic matrix. However, as the traffic matrix is seldom available, estimated traffic matrices have to be used. Thus, the solution of the load balancing algorithm is not optimal due to errors in traffic matrix estimate.
openaire +2 more sources
We study the problem of balancing the traffic load in a network by route selection. The traditional approach starts from a given traffic matrix. However, as the traffic matrix is seldom available, estimated traffic matrices have to be used. Thus, the solution of the load balancing algorithm is not optimal due to errors in traffic matrix estimate.
openaire +2 more sources
Discrete load balancing is (almost) as easy as continuous load balancing
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, 2010We consider the problem of diffusion-based load balancing on a distributed network with n processors. If the load is arbitrarily divisible, then the convergence is fairly well captured in terms of the second largest eigenvalue of the diffusion matrix. As for many applications load can not be arbitrarily divided, we consider a model where load consists ...
Robert Elsässer, Thomas Sauerwald
openaire +2 more sources
Load balanced distributed directories
Information and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shishir Rai +3 more
openaire +2 more sources
2002
Despite the large number of papers that have been published, scheduling and load balancing continue to be an active area of research.The topic covers all aspects related to scheduling and load balancing including application and system level techniques, theoretical foundations and practical tools.New aspects of parallel and distributed systems, such as
Maciej Drozdowski +3 more
openaire +1 more source
Despite the large number of papers that have been published, scheduling and load balancing continue to be an active area of research.The topic covers all aspects related to scheduling and load balancing including application and system level techniques, theoretical foundations and practical tools.New aspects of parallel and distributed systems, such as
Maciej Drozdowski +3 more
openaire +1 more source
Experiments in Automated Load Balancing
Proceedings of Symposium on Parallel and Distributed Tools, 1996One of the promises of parallelized discrete-event simulation is that it might provide significant speedups over sequential simulation. In reality, high performance cannot be achieved unless the system is fine-tuned to balance computation, communication, and synchronization requirements.
Linda F. Wilson, David M. Nicol
openaire +1 more source
Performance Evaluation, 2014
To date, the study of dispatching or load balancing in server farms has primarily focused on the minimization of response time. Server farms are typically modeled by a front-end router that employs a dispatching policy to route jobs to one of several servers, with each server scheduling all the jobs in its queue via Processor-Sharing.
Doroudi, Sherwin +3 more
openaire +3 more sources
To date, the study of dispatching or load balancing in server farms has primarily focused on the minimization of response time. Server farms are typically modeled by a front-end router that employs a dispatching policy to route jobs to one of several servers, with each server scheduling all the jobs in its queue via Processor-Sharing.
Doroudi, Sherwin +3 more
openaire +3 more sources
Load Balancing in Quorum Systems
SIAM Journal on Discrete Mathematics, 1997Summary: This paper introduces and studies the question of balancing the load on processors participating in a given quorum system. Our proposed measure for the degree of balancing is the ratio between the load on the least frequently referenced element and on the most frequently used one.
Ron Holzman, Yosi Marcus, David Peleg
openaire +3 more sources