Sciweavers

102 search results - page 10 / 21
» Fair Queuing Memory Systems
Sort
View
CONCUR
2007
Springer
14 years 2 months ago
Fair Cooperative Multithreading
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...
Gérard Boudol
FAST
2007
13 years 10 months ago
Proportional-Share Scheduling for Distributed Storage Systems
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are...
Yin Wang, Arif Merchant
OSDI
1996
ACM
13 years 9 months ago
A Hierarchical CPU Scheduler for Multimedia Operating Systems
The need for supportingvarietyof hard and soft real-time, as well as best effort applications ina multimedia computing environment requires an operating system framework that: (1)...
Pawan Goyal, Xingang Guo, Harrick M. Vin
OSDI
2004
ACM
14 years 8 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
PPOPP
2009
ACM
14 years 9 months ago
A comprehensive strategy for contention management in software transactional memory
In Software Transactional Memory (STM), contention management refers to the mechanisms used to ensure forward progress-to avoid livelock and starvation, and to promote throughput ...
Michael F. Spear, Luke Dalessandro, Virendra J. Ma...