10 search results - page 2 / 2 » Virtual-Time Round-Robin: An O(1) Proportional Share Schedul... |
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput...
PPOPP
2009
ACM
14 years 7 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
CLOUD
2010
ACM
14 years 4 days ago
2010
ACM
This paper investigates what it entails to provide I/O service differentiation and performance isolation for virtual machines on individual multicore nodes in cloud platforms. Sh...
HUMAN
2003
Springer
14 years 8 days ago
2003
Springer
Delivered end-to-end QoS is often limited by the ineffective resource management at Internet end systems. To overcome this problem, we present a resource allocation framework tha...
SPAA
2005
ACM
14 years 18 days ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...