Class-dependent assignment in cluster-based servers

Victoria Ungureanu, Benjamin Melamed, Phillip G. Bradford, Michael Katehakis

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations


A cluster-based server consists of a front-end dispatcher and several back-end servers. The dispatcher receives incoming requests, and then assigns them to back-end servers for processing. Our goal is to devise an assignment policy that has good response time performance, and is practical to implement in that the amount of information used by the dispatcher is relatively small, so that the attendant computation and communication overheads are low. In contrast to extant assignment policies that apply the same assignment policy to all incoming jobs, our approach calls for the dispatcher to classify incoming jobs as long or short, and then use class-dependent assignment policies. Specifically, we propose a policy, called CDA (Class Dependent Assignment), where short jobs are assigned in Round-Robin manner as soon as they arrive, while long jobs are deferred and assigned only when a back-end server becomes idle. Furthermore, when processing a long job, a back-end server is not assigned any other jobs. Our approach is motivated by empirical evidence suggesting that the sizes of files traveling on the Internet follow power-law distributions, where long jobs constituting a small fraction of all incoming jobs actually account for a large fraction of the overall load. To gauge the performance of the proposed policy, we exercised it on empirical data traces measured at Internet sites serving the 1998 World Cup. Since the assignment of long jobs incurs computational overhead as well as extra communication overhead, we studied the performance of CDA as function of the fraction of jobs classified as long. Our study shows that classification of even a small fraction of jobs as long can have a profound impact on overall response time performance. More specifically, our experimental results show that if less than 3% of the jobs are classified as long, then CDA outperforms traditional policies, such as Round-Robin, by two orders of magnitude. From an implementation viewpoint, these results support our contention that CDA-based assignment is a practical policy combining low overhead and greatly improved performance.

Original languageEnglish (US)
Number of pages6
StatePublished - 2004
EventApplied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing - Nicosia, Cyprus
Duration: Mar 14 2004Mar 17 2004


OtherApplied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing

All Science Journal Classification (ASJC) codes

  • Software


  • Assignment policy
  • Cluster-based server
  • Power-law distribution
  • Simulation


Dive into the research topics of 'Class-dependent assignment in cluster-based servers'. Together they form a unique fingerprint.

Cite this