raqfm – a resource allocation queueing fairness measure david raz school of computer science, tel...
TRANSCRIPT
![Page 1: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/1.jpg)
RAQFM – a Resource Allocation Queueing Fairness Measure
David RazSchool of Computer Science, Tel Aviv University
Jointly withHanoch Levy, Tel Aviv UniversityBenjamin Avi-Itzhak, RUTGERS University
Sigmetrics – Performance, June 2004
![Page 2: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/2.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics042
Outline
Motivation– The importance of fairness in queues– The physical properties of the problem– Related work
The RAQFM approach Properties Analysis
![Page 3: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/3.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics043
Why is Fairness in Queues Important?
Fundamental reason:– Isn’t fairness why we have queues in the first
place? Scientific evidence, recent studies, Rafaeli et.
al. [2003] (experimental psychology):– Experiments on humans in multi-queue and single
queue – Fairness in queue is very important to people– Perhaps even more than the delay itself
![Page 4: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/4.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics044
Queueing Theory and Fairness
Decades of research on:– Queueing structures / policies– Focused on efficiency – delay distribution/moments,
utilization, etc. The issue of fairness is discussed, but not quantified
– Larson (1988), Palm (1953), Mann (1969), Whitt (1984) etc. Existing measures for streams (WFQ) Little analysis on job fairness
– Morris & Wang (1985)– Avi-Itzhak & Levy (2004)– Wierman & Harchol-Balter (Sigmetrics 2003)
We know very little about job fairness
![Page 5: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/5.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics045
Queues: The Physical Factors
Size(Service Requirement)
ResourcesSeniority(Arrival Time)
![Page 6: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/6.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics046
Fairness: Size and Seniority
Size
Seniority
![Page 7: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/7.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics047
The Size vs. Seniority Dilemma
Short vs. Long
Is it more fair to serve Short ahead of Long? What is the intuition?
LongShort
![Page 8: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/8.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics048
Recent Related Work(1)
Avi-Itzhak & Levy (2004):– Axiomatic approach to fairness– Departure point & emphasis: Seniority (Order of
service)
Some results (for equal service times)– FCFS is the most fair (among non preemptive)– LCFS is the most unfair (among non preemptive)
Takes Seniority into account
![Page 9: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/9.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics049
Recent Related Work(2)
Wierman & Harchol-Balter (2003):– Propose a Fairness Criterion– Slowdown: for job of size x compute E[T(x)/x]. If it
is bounded the system is FAIR.
Some results:– FCFS is “Always UNFAIR”– LCFS (preemptive) is FAIR
Takes Size into account
![Page 10: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/10.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0410
Requirements From a Job Fairness Measure
Reacts well to both Seniority and Size Aim for standard have a consistent view
and agree with Intuition build confidence Yields to Analysis
RAQFM – A Resource Allocation Queueing Fairness Measure
![Page 11: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/11.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0411
RAQFM Philosophy
Equal Share of Resources
Fairness
![Page 12: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/12.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0412
RAQFM - How to Apply the Philosophy: Individual Discrimination
At every epoch t with N(t) customers in the system, each customer should get 1/N(t)
Warranted service:
Granted service:
Compare the warranted service with the granted service : discrimination:
i
i
dttN
Ri
departure
arrival )(
1
iii sdttsGi
i
departure
arrival
)(
iii RGD
![Page 13: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/13.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0413
Basic Properties of the Discrimination
E[D]=0 (every sample path, every policy)Proof sketch: The momentary rate of discrimination is”zero sum”
For PS individual discrimination is zero
0)(
1)(1
tNtN
0)(
1
)(
1
tNtNDi
![Page 14: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/14.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0414
RAQFM – System Fairness
System Unfairness: differences in customer treatment (customer discrimination)
We measure the unfairness in a system using Var[D] (D is r.v.)
Var[D] ≥ 0
Property 1: PS is the most fair policy
![Page 15: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/15.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0415
Short vs. Long Revisited
Seniority (Arrival Time)
Difference sen Size (Service Requirement)
Difference
sizeIs it more fair to serve Short ahead of Long?
![Page 16: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/16.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0416
The difference in unfairness resulting from serving short ahead of long is
If size difference is small – serve by order of arrival If seniority difference is small – serve by order of
service requirement
)( sizesenc
RAQFM Agrees With Intuition
Short vs. Long Revisited
![Page 17: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/17.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0417
Property 2: Bounds
Individual discrimination is bound by– How good– How bad
i iD s
/ 2i iD W
![Page 18: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/18.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0418
Property 3: Reaction to Seniority
Theorem: If customers have equal service requirements– For each pair of customers, it is more fair to serve
the senior first
⇒FCFS is the most fair⇒LCFS is the least fair
(Proof sketch: compare scenarios)
RAQFM Reacts Well to Seniority
![Page 19: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/19.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0419
Property 3: Reaction to Size
Theorem: If customers arrive together– For each pair of customers, it is more fair to serve
the shorter first
⇒SJF is the most fair⇒LJF is the least fair
(Proof sketch – prove )
RAQFM Reacts Well to Size
2
1
[ ] ( )1
N
ii
N iVar D S
N i
![Page 20: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/20.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0420
Property 4: RAQFM is Analyzable
Example: analysis of M/M/1 FCFS– Markov chain state is (a,b)=(# ahead, # behind)– c(a,b)=momentary discrimination rate at state (a,b)– d(a,b)=expected discrimination of a walk starting
at (a,b)–
– Similarly for the second moment d(2)(a,b)–
( 1, ) 0( , ) ( , ) ( , 1)
0 0
d a b ad a b tc a b d a b
a
kk
PkdDE
0
)2(2 )0,(][
![Page 21: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/21.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics04210 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
0
1
2
3
4
5
6
7
Var
[D]
Preemptive LCFSNon-Preemprive LCFSROSFCFSPS
Fairness of Service Policies Not Discriminating For Sizeas function of load
Empty system: everyon
e is alone
LCFS: Severe
seniority violation
FCFS: no seniority violation
PS:
Absolute
Fairness
![Page 22: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/22.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics04220 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
0
1
2
3
4
5
6
7
Var
[D]
Preemptive LCFSNon-Preemprive LCFSROSFCFSPS
Is FCFS Always More Fair Than LCFS?
Mice
Elephants
1.0/1,5.0
10/1,01.0
22
11
FCFS = 0.9
Preemptive LCFS = 0.15
![Page 23: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/23.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0423
Summary
Fairness is extremely important, yet there are little quantification methods for jobs
RAQFM– Philosophy: fair share of service– Agrees with intuition– Reacts well to seniority and size– Yields to analysis
![Page 24: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/24.jpg)
June, 2004 D. Raz, RAQFM, Sigmetrics0424
Future Work
More service policies – SRPT, SJF, FB etc. Generalized service requirement Different architectures – multi-class, multi-
server, multi-queue, polling etc.
![Page 25: RAQFM – a Resource Allocation Queueing Fairness Measure David Raz School of Computer Science, Tel Aviv University Jointly with Hanoch Levy, Tel Aviv University](https://reader030.vdocument.in/reader030/viewer/2022032706/56649dfe5503460f94ae6b51/html5/thumbnails/25.jpg)
RAQFM – a Resource Allocation Queueing Fairness Measure
David RazSchool of Computer Science, Tel Aviv University
Jointly withHanoch Levy, Tel Aviv UniversityBenjamin Avi-Itzhak, RUTGERS University
Sigmetrics – Performance, June 2004
Thank You
http://www.cs.tau.ac.il/~davidraz