|
Published Articles >> Table of Contents >> Abstract
Network Computing and Applications, Third IEEE International Symposium on (NCA'04)
pp. 177-184
The LC Assignment Policy for Cluster-Based Servers
Victoria Ungureanu, Rutgers University, Newark, NJ
Benjamin Melamed, Rutgers University, Piscataway, NJ
Michael Katehakis, Rutgers University, Newark, NJ
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NCA.2004.1347775
Send link to a friend
| Abstract |
|
A cluster-based server consists of a front-end dispatcher and multiple back-end servers. The dispatcher receives incoming jobs, and then decides how to assign them to back-end servers, which in turn serve the jobs according to some discipline. Cluster-based servers have been broadly deployed as they combine good performance with low cost. Several assignment policies have been proposed for cluster-based servers, most of which aim to balance the load among back-end servers. There are two main strategies for load balancing: The first strategy aims at balancing the amount of work at back-end servers, while the second strategy aims at balancing the number of jobs assigned to back-end servers. Example of policies using these strategies are JSQ (Join Shortest Queue) and LC (Least Connected), respectively. In this paper we propose a policy, called LC, which combines the two aforementioned strategies. The paper shows experimentally that when preemption is admitted (i.e. jobs are executed concurrently by back-end servers), LC substantially outperforms both JSQ and LC. This improved performance is achieved by using only information readily available to the dispatcher, and therefore LC is a practical policy in regards to implementation.
|
 Additional Information
|
Index Terms- cluster-based servers, back-end server architecture, job preemption, simulation
Citation:
Victoria Ungureanu, Benjamin Melamed, Michael Katehakis,
"The LC Assignment Policy for Cluster-Based Servers,"
nca,
pp. 177-184,
Network Computing and Applications, Third IEEE International Symposium on (NCA'04),
2004
|
|
