Journal of the ACM (JACM)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM (JACM)
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Classifying scheduling policies with respect to unfairness in an M/GI/1
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
How fair is queue prioritization?
ACM SIGMETRICS Performance Evaluation Review
Classifying scheduling policies with respect to higher moments of conditional response time
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fair operation of multi-server and multi-queue systems
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review - Special issue on the workshop on MAthematical performance Modeling And Analysis (MAMA 2005)
Revisiting unfairness in web server scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
Performance Evaluation
Fairness considerations of scheduling in multi-server and multi-queue systems
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
PBS: a unified priority-based scheduler
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SQF: A slowdown queueing fairness measure
Performance Evaluation
The Foreground-Background queue: A survey
Performance Evaluation
Benefits of alternating FCFS/SJF service order
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Quantifying fairness in queuing systems: Principles, approaches, and applicability
Probability in the Engineering and Informational Sciences
Probability in the Engineering and Informational Sciences
Class treatment in queueing systems: discrimination and fairness aspects
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Service level agreement for multithreaded processors
ACM Transactions on Architecture and Code Optimization (TACO)
Performance, fairness and effectiveness in space-slicing multi-cluster schedulers
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
PV-EASY: a strict fairness guaranteed and prediction enabled scheduler in parallel job scheduling
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Principles of fairness quantification in queueing systems
Network performance engineering
Unfairness metrics for space-sharing parallel job schedulers
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Truth, envy, and truthful market clearing bundle pricing
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Locality of reference and the use of sojourn time variance for measuring queue unfairness
Operations Research Letters
Envy-Free Makespan Approximation
SIAM Journal on Computing
Choosy: max-min fair sharing for datacenter jobs with constraints
Proceedings of the 8th ACM European Conference on Computer Systems
On-line fair allocations based on bottlenecks and global priorities
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
Joint optimization of overlapping phases in MapReduce
Performance Evaluation
Toward balanced and sustainable job scheduling for production supercomputers
Parallel Computing
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
Hi-index | 0.00 |
Fairness is a major issue in the operation of queues, perhaps it is the reason why queues were formed in the first place. Recent studies show that the fairness of a queueing system is important to customers not less than the actual delay they experience. Despite this observation little research has been conducted to study fairness in queues, and no commonly agreed upon measure of queue fairness exists. Two recent research exceptions are Avi-Itzhak and Levy [1], where a fairness measure is proposed, and Wierman and Harchol-Balter [18] (this conference, 2003), where a criterion is proposed for classifying service policies as fair or unfair; the criterion focuses on customer service requirement and deals with fairness with respect to service times.In this work we recognize that the inherent behavior of a queueing system is governed by two major factors: Job seniority (arrival times) and job service requirement (service time). Thus, it is desired that a queueing fairness measure would account for both. To this end we propose a Resource Allocation Queueing Fairness Measure, (RAQFM), that accounts for both relative job seniority and relative service time. The measure allows accounting for individual job discrimination as well as system unfairness. The system measure forms a full scale that can be used to evaluate the level of unfairness under various queueing disciplines. We present several basic properties of the measure. We derive the individual measure as well as the system measure for an M/M/1 queue under five fundamental service policies: Processor Sharing (PS), First Come First Served (FCFS), Non-Preemptive Last Come First Served (NP-LCFS), Preemptive Last Come First Served (P-LCFS), and Random Order of Service (ROS). The results of RAQFM are then compared to those of Wierman and Harchol-Balter [18], and the quite intriguing observed differences are discussed.