Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

STOC
2002
ACM

favoriteEmaildiscussreport

123views Algorithms» more STOC 2002»

Optimal rate-based scheduling on multiprocessors

14 years 5 months ago

Optimal rate-based scheduling on multiprocessors

Download www.cs.unc.edu

The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is also optimal for scheduling "rate-based" tasks whose processing steps may be highly jittered. The rate-based task model we consider generalizes the widely-studied sporadic task model.

Anand Srinivasan, James H. Anderson

Real-time Traffic

Algorithms | Efficient Known Algorithm | STOC 2002 | Task Model | Widely-studied Sporadic Task |

claim paper

Related Content

» Earlyrelease fair scheduling

» TL planebased realtime scheduling for homogeneous multiprocessors

» Cyclic executive for safetycritical Java on chipmultiprocessors

» Bus Access Optimization for Predictable Implementation of RealTime Applications on Multipr...

» An Optimal RealTime Scheduling Algorithm for Multiprocessors

» LRETL an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadli...

» Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors

» A LookupTable Driven Approach to Partitioned Scheduling

» SelfTimed Resynchronization A PostOptimization for Static Multiprocessor Schedules

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Anand Srinivasan, James H. Anderson

Comments (0)