Deferred Assignment Scheduling in cluster-based servers

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

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

This paper proposes a new scheduling policy for cluster-based servers called DAS (Deferred Assignment Scheduling). The main idea in DAS is to defer scheduling as much as possible in order to make better use of the accumulated information on job sizes. In broad outline, DAS operates as follows: (1) incoming jobs are held by the dispatcher in a buffer; (2) the dispatcher monitors the number of jobs being processed by each server; (3) when the number of jobs at a server queue drops below a prescribed threshold, the dispatcher sends to it the shortest job in its buffer. To gauge the efficacy of DAS, the paper presents simulation studies, using various data traces. The studies collected response times and slowdowns for two cluster configurations under multi-threaded and multi-process back-end server architectures. The experimental results show that in both architectures, DAS outperforms the Round-Robin policy in all traffic regimes, and the JSQ (Join Shortest Queue) policy in medium and heavy traffic regimes.

Original languageEnglish (US)
Pages (from-to)57-65
Number of pages9
JournalCluster Computing
Volume9
Issue number1
DOIs
StatePublished - Jan 2006

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications

Keywords

  • Clustered servers
  • Deferred assignment
  • Heavy-tail distribution
  • Scheduling
  • Simulation

Fingerprint

Dive into the research topics of 'Deferred Assignment Scheduling in cluster-based servers'. Together they form a unique fingerprint.

Cite this