Philip Holman, James H. Anderson  Home/Search
Context Related
| unc.edu/~anderson/papers/rtss02b.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unc.edu/~anderson/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present several locking synchronization protocols and associated schedulability conditions for Pfair-scheduled multiprocessor systems. We focus on two classes of protocols. The first class is only applicable in systems in which all critical sections are short relative to the length of the scheduling quantum. In this case, efficient synchronization can be achieved by ensuring that all locks have been released before tasks are preempted. The second and more general protocol class is applicable ... (Update)
Context of citations to this paper: More
.... prior work on using hierarchical scheduling under a global Pfair scheduler [11, 16] We then present resource sharing protocols [12, 13] designed for Pfair scheduled systems in Section 6. Section 7 summarizes the chapter. 2 Periodic Task Systems In this section, we...
Cited by: More
The Staggered Model: - Improving The Practicality (Correct)
The Staggered Model: Improving the Practicality of Pfair.. - Holman, Anderson (2003) (Correct)
Efficient Scheduling of Soft Real-time Applications on.. - Srinivasan, Anderson (2002) (Correct)
Active bibliography (related documents): More All
1.5: Object Sharing in Pfair-scheduled Multiprocessor Systems - Holman, Anderson (2002) (Correct)
0.8: The Case for Fair Multiprocessor Scheduling - Srinivasan, Holman, Anderson.. (2002) (Correct)
0.7: Fair Scheduling of Real-time Tasks on Multiprocessors - Anderson, Holman, Srinivasan (Correct)
Similar documents based on text: More All
0.2: Using Supertasks to Improve Processor Utilization in.. - Holman, Anderson (2003) (Correct)
0.2: Efficient Pure-buffer Algorithms for Real-time Systems - Anderson, Holman (Correct)
0.2: Fair Scheduling of Dynamic Task Systems on - Multiprocessors Anand Srinivsan (Correct)
Related documents from co-citation: More All
7: Mixed pfairerfair scheduling asynchronou periodic task - Srinivasan, erfair et al. - 2001
7: Guaranteeing pfair supertasks by reweighting - Holman, Anderson - 2001
7: Proportionate Progress: A Notion of Fairness in Resource Allocation - Baruah, Cohen et al. - 1996
BibTeX entry: (Update)
P. Holman and J. Anderson. Locking in Pfair-scheduled multiprocessor systems. In Proc. of the 23rd IEEE Real-time Systems Symposium, Dec 2002. To appear. http://citeseer.ist.psu.edu/holman02locking.html More
@inproceedings{ holman02locking,
author = "P. Holman and J. Anderson",
title = "Locking in {P}fair-scheduled multiprocessor systems",
booktitle = "Proc. of the 23rd IEEE Real-time Systems Symposium",
month = may,
year = "2002",
url = "citeseer.ist.psu.edu/holman02locking.html" }
Citations (may not include all citations):1582 Scheduling algorithms for multiprogramming in a hard real--t.. - Liu, Layland - 1973
528 Priority inheritance protocols: An approach to real-time sys.. (context) - Sha, Rajkumar et al. - 1990
104 Stack-based scheduling of real-time processes (context) - Baker - 1991
81 Real-time synchronization protocols for multiprocessors (context) - Rajkumar, Sha et al. - 1988
76 Synchronization in real-time systems -- A priority inheritan.. (context) - Rajkumar - 1991
71 Proportionate progress: A notion of fairness in resource all.. - Baruah, Cohen et al. - 1996
50 Fast scheduling of periodic tasks on multiple resources - Baruah, Gehrke et al. - 1995
28 Real-time synchronization protocols for shared memory multip.. (context) - Rajkumar - 1990
27 Early-release fair scheduling - Anderson, Srinivasan - 2000
23 Surplus fair scheduling: A proportional-share cpu scheduling.. - Chandra, Adler et al. - 2000
22 A framework for implementing objects and scheduling tasks in.. - Anderson, Ramamurthy - 1996
21 Mixed PfairERfair scheduling asynchronou periodic task - Srinivasan, ERfair et al. - 2001
19 Pfair scheduling: Beyond periodic task systems - Anderson, Srinivasan - 2000
13 Guaranteeing pfair supertasks by reweighting - Holman, Anderson - 2001
13 Pfair scheduling of fixed and migrating periodic tasks on mu.. - Moir, Ramamurthy - 1999
12 Optimal rate-based scheduling on multiprocessors - Srinivasan, Anderson - 2002
10 Real-time computing with lock-free objects (context) - Anderson, Ramamurthy et al. - 1997
8 Resource sharing in reservation-based systems - de Niz, Abeni et al. - 2001
8 Minimizing memory utilization of real-time task sets in sing.. - Gai, Lipari et al. - 2001
6 A lock-free approach to object sharing in real-time systems - Ramamurthy - 1997
6 Object sharing in pfair-scheduled multiprocessor systems - Holman, Anderson - 2002
5 Aperiodic servers with resource constraints - Caccamo, Sha - 2001
2 A bandwidth inheritance algorithm for real-time task synchro.. - Lamastra, Lipari et al. - 2001
1 Fair on-line scheduling of dynamic task systems on multiproc.. (context) - Srinivasan, Anderson - 2002
Documents on the same site (http://www.cs.unc.edu/~anderson/papers.html): More
The Granularity of Waiting (Extended Abstract) - Anderson, Yang, Gouda (1992) (Correct)
The Elusive Atomic Register - Singh, Anderson, al. (1992) (Correct)
A New Explanation of the Glitch Phenomenon - Anderson, Gouda (1989) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC