Journal of the ACM (JACM)
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE Transactions on Parallel and Distributed Systems
A unified architecture for the design and evaluation of wireless fair queueing algorithms
Wireless Networks - Selected Papers from Mobicom'99
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
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
Characterization of Backfilling Strategies for Parallel Job Scheduling
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
A resource-allocation queueing fairness measure
Proceedings of the joint international conference on Measurement and modeling of computer systems
Job Fairness in Non-Preemptive Job Scheduling
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
On fairness in distributed job scheduling across multiple sites
CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
SQF: A slowdown queueing fairness measure
Performance Evaluation
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
New challenges of parallel job scheduling
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
Service control with the preemptive parallel job scheduler Scojo-PECT
Cluster Computing
Future Generation Computer Systems
| Hi-index | 0.00 |
Sociology, computer networking and operations research provide evidence of the importance of fairness in queuing disciplines. Currently, there is no accepted model for characterizing fairness in parallel job scheduling. We introduce two fairness metrics intended for parallel job schedulers, both of which are based on models from sociology, networking, and operations research. The first metric is motivated by social justice and attempts to measure deviation from arrival order, which is perceived as fair by the end user. The second metric is based on resource equality and compares the resources consumed by a job with the resources deserved by the job. Both of these metrics are orthogonal to traditional metrics, such as turnaround time and utilization. The proposed fairness metrics are used to measure the unfairness for some typical scheduling policies via simulation studies. We analyze the fairness of these scheduling policies using both metrics, identifying similarities and differences.