|
Published Articles >> Table of Contents >> Abstract
24th IEEE International Real-Time Systems Symposium (RTSS'03)
p. 25
Evolving real-time systems using hierarchical scheduling and concurrency analysis
John Regehr, University of Utah
Alastair Reid, University of Utah
Kirk Webb, University of Utah
Michael Parker, University of Utah
Jay Lepreau, University of Utah
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/REAL.2003.1253251
Send link to a friend
| Abstract |
|
We have developed a new way to look at real-time and embedded software: as a collection of execution environments created by a hierarchy of schedulers. Common schedulers include those that run interrupts, bottom-half handlers, threads, and events. We have created algorithms for deriving response times, scheduling overheads, and blocking terms for tasks in systems containing multiple execution environments. We have also created task scheduler logic, a formalism that permits checking systems for race conditions and other errors. Concurrency analysis of low-level software is challenging because there are typically several kinds of locks, such as thread mutexes and disabling interrupts, and groups of cooperating tasks may need to acquire some, all, or none of the available types of locks to create correct software. Our high-level goal is to create systems that are evolvable: they are easier to modify in response to changing requirements than are systems created using traditional techniques. We have applied our approach to two case studies in evolving software for networked sensor nodes.
|
 Additional Information
|
Citation:
John Regehr, Alastair Reid, Kirk Webb, Michael Parker, Jay Lepreau,
"Evolving real-time systems using hierarchical scheduling and concurrency analysis,"
rtss,
p. 25,
24th IEEE International Real-Time Systems Symposium (RTSS'03),
2003
|
|
