Deferred Assignment Scheduling in Cluster-Based Servers

被引：0

作者：

Victoria Ungureanu

Benjamin Melamed

Michael Katehakis

Phillip G. Bradford

机构：

[1] Rutgers University,Department of MSIS

[2] Rutgers University,Department of MSIS

[3] The University of Alabama,Department of Computer Science

[4] DIMACS Center,undefined

来源：

Cluster Computing | 2006年 / 9卷

关键词：

clustered servers; deferred assignment; heavy-tail distribution; scheduling; simulation;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：57 / 65

页数：8

共 16 条

[1]

Ciardo G.(2001)EquiLoad: A load balancing policy for clustered web servers Performance Evaluation 46 101-124

[2]

Riska A.(2002)Task Assignment with Unknown Duration Journal of the ACM 49 260-288

[3]

Smirni E.(2001)Measurement, analysis and performance improvement of the apache web server International Journal of Computers and Their Applications 8 217-231

[4]

Harchol-Balter M.(1994)On the optimal maintenance of systems and control of arrivals in queues Stochastic Analysis and Applications 8 12-25

[5]

Hu Y.(2002)Scheduling in multiclass networks with deterministic service times Queuing Systems 41 305-319

[6]

Nanda A.(1996)Scheduling with random service times Management Science 12 703-713

[7]

Yang Q.(1956)Various optimizers for single-stage production Naval Research Logistics Quarterly 3 59-66

[8]

Katehakis M.(2001)Comparison of load balancing strategies on cluster-based web servers, Simulation The Journal of the Society for Modeling and Simulation International 77 185-195

[9]

Melolidakis C.(1986)Deciding which queue to Join: Some Counter Examples Operations Research 34 55-62

[10]

Righter R.(1977)Optimality of the shortest line discipline Journal of Applied Probability 14 181-189

← 1 2 →