Sciweavers

157 search results - page 6 / 32
» The Case for Fair Multiprocessor Scheduling
Sort
View
MICRO
2006
IEEE
79views Hardware» more  MICRO 2006»
14 years 1 months ago
Fair Queuing Memory Systems
We propose and evaluate a multi-thread memory scheduler that targets high performance CMPs. The proposed memory scheduler is based on concepts originally developed for network fai...
Kyle J. Nesbit, Nidhi Aggarwal, James Laudon, Jame...
RTSS
2006
IEEE
14 years 1 months ago
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
RTCSA
2007
IEEE
14 years 1 months ago
A Flexible Real-Time Locking Protocol for Multiprocessors
Real-time scheduling algorithms for multiprocessor systems have been the subject of considerable recent interest. For such an algorithm to be truly useful in practice, support for...
Aaron Block, Hennadiy Leontyev, Björn B. Bran...
RTSS
2000
IEEE
14 years 1 days ago
Static-Priority Periodic Scheduling on Multiprocessors
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...
Srikanth Rarnarnurthy, Mark Moir
SPAA
2003
ACM
14 years 27 days ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...