SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Revisiting unfairness in Web server scheduling · Study

ArticleShelves

ArticleRevisiting unfairness in Web server scheduling

Mingwei Gong2005

Article2005

Revisiting unfairness in Web server scheduling

Mingwei Gong · Carey L. Williamson

18 citations·0/0 files stored·Computer Networks

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Cloud Computing and Resource Management

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 18 citations exist upstream.

References

1968Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline 2000A Practical Guide to Heavy Tails 1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline 2001Analysis of SRPT scheduling 2003Classifying scheduling policies with respect to unfairness in an M/GI/1 2004On measuring fairness in queues 2002Asymptotic convergence of scheduling policies with respect to slowdown 2004A resource-allocation queueing fairness measure

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2007Scheduling for today's computer systems: bridging theory and practicethesis · 9 shared references 2010Fairness and scheduling in single server queuesarticle · 7 shared references 2005Classifying scheduling policies with respect to higher moments of conditional response timeother · 7 shared references 2004Simulation evaluation of hybrid srpt scheduling policiesother · 7 shared references 2005Nearly insensitive bounds on SMART schedulingarticle · 7 shared references 2005Nearly insensitive bounds on SMART schedulingother · 6 shared references

Details

Year2005

Typearticle

Published2005-09-21

VenueComputer Networks

ISSN-L1389-1286

Languageen

Citations18

Files0 public / 0

ShelfAdvanced Queuing Theory Analysis

Identifiers

doi10.1016/j.comnet.2005.08.005

openalex_workW2071661657

Links

Imported from OpenAlex (CC0) — nothing here is generated.