Sciweavers

102 search results - page 3 / 21
» Fair Queuing Memory Systems
Sort
View
ASPLOS
2010
ACM
13 years 9 months ago
Fairness via source throttling: a configurable and high-performance fairness substrate for multi-core memory systems
Cores in a chip-multiprocessor (CMP) system share multiple hardware resources in the memory subsystem. If resource sharing is unfair, some applications can be delayed significantl...
Eiman Ebrahimi, Chang Joo Lee, Onur Mutlu, Yale N....
CF
2006
ACM
14 years 12 hour ago
Exploiting locality to ameliorate packet queue contention and serialization
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
Sailesh Kumar, John Maschmeyer, Patrick Crowley
WDAG
2001
Springer
78views Algorithms» more  WDAG 2001»
13 years 10 months ago
Self Stabilizing Distributed Queuing
Distributed queuing is a fundamental coordination problem, arising in a variety of applications, including distributed shared memory, distributed directories, and totally ordered ...
Maurice Herlihy, Srikanta Tirthapura
FPL
2006
Springer
124views Hardware» more  FPL 2006»
13 years 9 months ago
A Dynamically Reconfigurable Queue Scheduler
In this paper we present the design and implementation of a dynamically reconfigurable system for packet queue scheduling. Two widely accepted queue schedulers have been implement...
Christoforos Kachris, Stamatis Vassiliadis
SIGMETRICS
2008
ACM
159views Hardware» more  SIGMETRICS 2008»
13 years 6 months ago
Weighted fair sharing for dynamic virtual clusters
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
Laura E. Grit, Jeffrey S. Chase