Results 231 to 240 of about 375,588 (279)
Some of the next articles are maybe not open access.
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
Load balanced distributed directories
Information and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rai, Shishir +3 more
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 +2 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 +2 more sources
Efficient load balancing using improved central load balancing technique
2018 2nd International Conference on Inventive Systems and Control (ICISC), 2018Within a large-scale computing atmosphere the actual reasoning details centers and end users are usually geographically dispersed through the globe. The most significant for centers is how to handle and repair the actual countless needs that happens often by end users proficiently and correctly.
Simranjit Kaur, Tejinder Sharma
openaire +1 more source
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015
Modern scientific simulations divide work between parallel processors by decomposing a spatial domain of mesh cells, particles, or other elements. A balanced assignment of the computational load is critical for parallel performance. If the computation per element changes over the simulation time, simulations can use dynamic load balance algorithms to ...
Olga Pearce +4 more
openaire +1 more source
Modern scientific simulations divide work between parallel processors by decomposing a spatial domain of mesh cells, particles, or other elements. A balanced assignment of the computational load is critical for parallel performance. If the computation per element changes over the simulation time, simulations can use dynamic load balance algorithms to ...
Olga Pearce +4 more
openaire +1 more source
Proceedings of the 27th IEEE Conference on Decision and Control, 2003
Summary form only given. The authors solve a load balancing problem for parallel processors, given limited state information. The novelty of the problem is that the routing units at the parallel arrival streams of tasks have different and limited state information. This makes the problem a team problem of a distributed control problem.
R.K. Boel, J.H. van Schuppen
openaire +1 more source
Summary form only given. The authors solve a load balancing problem for parallel processors, given limited state information. The novelty of the problem is that the routing units at the parallel arrival streams of tasks have different and limited state information. This makes the problem a team problem of a distributed control problem.
R.K. Boel, J.H. van Schuppen
openaire +1 more source
Queueing Systems, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hjálmtýsson, Gísli, Whitt, Ward
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hjálmtýsson, Gísli, Whitt, Ward
openaire +2 more sources
Overall Optimal Load Balancing vs. Individually Optimal Load Balancing
1997We can think of two load balancing policies each of which has a distinct performance objective. One is the overall optimal policy and the other is the individually optimal policy. The overall optimal load balancing policy is the policy whereby job scheduling is determined so as to minimize the system-wide mean job response time.
Hisao Kameda +3 more
openaire +1 more source
2012
DNS load balancing is the simplest form of load balancing. That said, it’s also very powerful. It can be used to solve many performance problems very quickly as it allows you to direct incoming traffic to any one of a set of servers. But as with all quick and easy solutions, there are many things that DNS load balancing can’t do.
Peter Membrey, David Hows, Eelco Plugge
openaire +1 more source
DNS load balancing is the simplest form of load balancing. That said, it’s also very powerful. It can be used to solve many performance problems very quickly as it allows you to direct incoming traffic to any one of a set of servers. But as with all quick and easy solutions, there are many things that DNS load balancing can’t do.
Peter Membrey, David Hows, Eelco Plugge
openaire +1 more source