Sciweavers

9 search results - page 1 / 2
» Surplus Fair Scheduling: A Proportional-Share CPU Scheduling...
Sort
View
OSDI
2000
ACM
13 years 8 months ago
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain...
Abhishek Chandra, Micah Adler, Pawan Goyal, Prasha...
TPDS
2008
164views more  TPDS 2008»
13 years 7 months ago
Hierarchical Scheduling for Symmetric Multiprocessors
Hierarchical scheduling has been proposed as a scheduling technique to achieve aggregate resource partitioning among related groups of threads and applications in uniprocessor and...
Abhishek Chandra, Prashant J. Shenoy
PODC
2006
ACM
14 years 1 months ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
Bogdan Caprita, Jason Nieh, Clifford Stein
VLSID
2006
IEEE
143views VLSI» more  VLSID 2006»
14 years 1 months ago
Frame Based Fair Multiprocessor Scheduler: A Fast Fair Algorithm for Real-Time Embedded Systems
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
HUMAN
2003
Springer
14 years 20 days ago
Fair Real-Time Resource Allocation for Internet End System's QoS Support
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...
Jungkeun Park, Minsoo Ryu, Seongsoo Hong