Results 161 to 170 of about 74,667 (207)
Queueing Systems, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gísli Hjálmtýsson, Ward Whitt
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brian Chang +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brian Chang +3 more
openaire +2 more sources
Operations Research, 1992
We develop a heuristic for a problem motivated by the loading of aircraft or trucks: pack blocks into a bin so that their center-of-gravity is as close as possible to a target point. Our heuristic either produces good solutions or else signals that none is possible.
Samir V. Amiouny +3 more
openaire +1 more source
We develop a heuristic for a problem motivated by the loading of aircraft or trucks: pack blocks into a bin so that their center-of-gravity is as close as possible to a target point. Our heuristic either produces good solutions or else signals that none is possible.
Samir V. Amiouny +3 more
openaire +1 more source
Developer load balancing bug triage: Developed load balance
Expert Systems, 2022AbstractDuring the software development process, numerous bugs are reported daily in the software bug repositories. Bug triage assigned these bugs to the most relevant and expert developer for resolution. Moreover, assigning bugs to an incompetent or an over‐engaged developer causes repeated reassignment to other developers until it is resolved.
Asmita Yadav +5 more
openaire +1 more source
Loaded: Server Load Balancing for IPv6
International conference on Networking and Services (ICNS'06), 2006With the next generation Internet protocol IPv6 at the horizon, it is time to think about how applications can migrate to IPv6. Web traffic is currently one of the most important applications in the Internet. The increasing popularity of dynamically generated content on the World Wide Web, has created the need for fast web servers.
Friedrich, Sven +3 more
openaire +3 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 Transactions on Parallel and Distributed Systems, 1999
This paper presents a hydrodynamic framework to solving the dynamic load balancing problem in heterogeneous distributed systems. In this approach, each processor is viewed as a liquid cylinder where the cross-sectional area corresponds to the capacity of the processor, the communication links are modeled as liquid channels between the cylinders, the ...
Chi-Chung Hui, Samuel T. Chanson
openaire +1 more source
This paper presents a hydrodynamic framework to solving the dynamic load balancing problem in heterogeneous distributed systems. In this approach, each processor is viewed as a liquid cylinder where the cross-sectional area corresponds to the capacity of the processor, the communication links are modeled as liquid channels between the cylinders, the ...
Chi-Chung Hui, Samuel T. Chanson
openaire +1 more source
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003
A standard load balancing model considers placing n balls into n bins by choosing d possible locations for each ball independently and uniformly at random and sequentially placing each in the least loaded of its chosen bins. It is well known that allowing just a small amount of choice (d = 2) greatly improves performance over random placement (d = 1 ...
Michael Mitzenmacher +2 more
openaire +1 more source
A standard load balancing model considers placing n balls into n bins by choosing d possible locations for each ball independently and uniformly at random and sequentially placing each in the least loaded of its chosen bins. It is well known that allowing just a small amount of choice (d = 2) greatly improves performance over random placement (d = 1 ...
Michael Mitzenmacher +2 more
openaire +1 more source
[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 +1 more source
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 +1 more source
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 +1 more source