Fairness and scheduling in single server queues

@inproceedings{Wierman2011FairnessAS,
  title={Fairness and scheduling in single server queues},
  author={Adam Wierman},
  year={2011}
}
Abstract Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficult to define and so it has been studied only sporadically. This has changed over the past decade and a growing literature providing an analytic framework for studying fairness has emerged… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 37 CITATIONS

Theoretical and Experimental Evaluation of the Two-Level Processor Sharing Discipline for TCP Flows

  • 2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

HFSP: Bringing Size-Based Scheduling To Hadoop

  • IEEE Transactions on Cloud Computing
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 55 REFERENCES

A resource-allocation queueing fairness measure

  • SIGMETRICS '04/Performance '04
  • 2004
VIEW 20 EXCERPTS
HIGHLY INFLUENTIAL