Pages that link to "Item:Q5390597"
From MaRDI portal
The following pages link to Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service (Q5390597):
Displaying 17 items.
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Revisiting unfairness in Web server scheduling (Q871099) (← links)
- Interactivity vs. fairness in networked Linux systems (Q995534) (← links)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- A unified framework for designing EPTAS for load balancing on parallel machines (Q2415372) (← links)
- The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
- Concurrent fair queueing: Fair service for virtual web sites (Q2751909) (← links)
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing (Q4631681) (← links)
- Fair Queuing and Other Probabilistic Allocation Methods (Q5704060) (← links)
- (Q5743473) (← links)
- (Q5743474) (← links)
- (Q5743501) (← links)
- LATIN 2004: Theoretical Informatics (Q5901663) (← links)