Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
A Flexible Real-Time Locking Protocol for Multiprocessors
- A. Block, H. Leontyev, Björn B. Brandenburg, James H. Anderson
- Computer Science13th IEEE International Conference on Embedded…
- 21 August 2007
A new flexible multiprocessor locking scheme is presented that can be applied under both partitioning and global scheduling and allows unrestricted critical-section nesting, but has been designed to deal with the common case of short non-nested accesses efficiently.
LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers
- J. Calandrino, H. Leontyev, A. Block, Umamaheswari Devi, James H. Anderson
- Computer Science27th IEEE International Real-Time Systems…
- 5 December 2006
This paper is the first attempt by anyone to compare partitioned and global real-time scheduling approaches using empirical data.
Scheduling and locking in multiprocessor real-time operating systems
The experiments show that partitioned earliest-deadline first (EDF) scheduling is generally preferable in a hard real- time setting, whereas global and clustered EDF scheduling are effective in a soft real-time setting.
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
This book discusses Real-Time Scheduling Problems, Scheduling Models, Stochastic Scheduling, and Online Deterministic Scheduling as well as some basic Scheduling Algorithms and Complexity.
A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms
- John Carpenter, S. Funk, Philip Holman, A. Srinivasan, James H. Anderson, Sanjoy Baruah
- Computer ScienceHandbook of Scheduling
This chapter analyzes the trade-offs involved in scheduling independent, periodic real-time tasks on a multiprocessor.
Optimality Results for Multiprocessor Real-Time Locking
- Björn B. Brandenburg, James H. Anderson
- Computer Science31st IEEE Real-Time Systems Symposium
- 30 November 2010
This paper presents two definitions of blocking that are applicable to suspension-based multiprocessor locking protocols and presents protocols that have asymptotically optimal blocking behavior for any job-level static-priority global or partitioned scheduling algorithm.
Early-release fair scheduling
Average job response times may be much lower under ERfair scheduling than under Pfair scheduling, particularly in lightly loaded systems, and run-time costs are lower underERfair scheduling.
Wait-Free Algorithms for Fast, Long-Lived Renaming
Cache-Related Preemption and Migration Delays : Empirical Approximation and Impact on Schedulability ∗
Two empirical methods to approximate cacherelated preemption and migration delays on actual hardware are proposed, and a case study reporting measured average and worst-case overheads on a 24-core Intel system with a hierarchy of shared caches is presented.
An EDF-based scheduling algorithm for multiprocessor soft real-time systems
- James H. Anderson, Vasile Bud, Umamaheswari Devi
- Computer Science17th Euromicro Conference on Real-Time Systems…
- 6 July 2005
This paper proposes a new EDF-based scheme that ensures bounded deadline tardiness, which should enable a wide range of soft real-time applications to be scheduled with no constraints on total utilization.