Sharing Non-Processor Resources in Multiprocessor Real-Time Systems
Public DepositedAdd to collection
You do not have access to any existing collections. You may create a new collection.
Downloadable Content
Download PDFCitation
MLA
Ward, Bryan. Sharing Non-processor Resources In Multiprocessor Real-time Systems. 2016. https://doi.org/10.17615/d7vb-fg81APA
Ward, B. (2016). Sharing Non-Processor Resources in Multiprocessor Real-Time Systems. https://doi.org/10.17615/d7vb-fg81Chicago
Ward, Bryan. 2016. Sharing Non-Processor Resources In Multiprocessor Real-Time Systems. https://doi.org/10.17615/d7vb-fg81- Last Modified
- March 20, 2019
- Creator
-
Ward, Bryan
- Affiliation: College of Arts and Sciences, Department of Computer Science
- Abstract
- Computing devices are increasingly being leveraged in cyber-physical systems, in which computing devices sense, control, and interact with the physical world. Associated with many such real-world interactions are strict timing constraints, which if unsatisfied, can lead to catastrophic consequences. Modern examples of such timing constraints are prevalent in automotive systems, such as airbag controllers, anti-lock brakes, and new autonomous features. In all of these examples, a failure to correctly respond to an event in a timely fashion could lead to a crash, damage, injury and even loss of life. Systems with imperative timing constraints are called real-time systems, and are broadly the subject of this dissertation. Much previous work on real-time systems and scheduling theory assumes that computing tasks are independent, i.e., the only resource they share is the platform upon which they are executed. In practice, however, tasks share many resources, ranging from more overt resources such as shared memory objects, to less overt ones, including data buses and other hardware and I/O devices. Accesses to some such resources must be synchronized to ensure safety, i.e., logical correctness, while other resources may exhibit better run-time performance if accesses are explicitly synchronized. The goal of this dissertation was to develop new synchronization algorithms and associated analysis techniques that can be used to synchronize access to many classes of resources, while improving the overall resource utilization, specifically as measured by real-time schedulability. Towards that goal, the Real-Time Nested Locking Protocol (RNLP), the first multiprocessor real-time locking protocol that supports lock nesting or fine-grained locking is proposed and analyzed. Furthermore, the RNLP is extended to support reader/writer locking, as well as k-exclusion locking. All presented RNLP variants are proven optimal. Furthermore, experimental results demonstrate the schedulability-related benefits of the RNLP. Additionally, three new synchronization algorithms are presented, which are specifically motivated by the need to manage shared hardware resources to improve real-time predictability. Furthermore, two new classes of shared resources are defined, and the first synchronization algorithms for them are proposed. To analyze these new algorithms, a novel analysis technique called idleness analysis is presented, which can be used to incorporate the effects of blocking into schedulability analysis.
- Date of publication
- December 2016
- Keyword
- DOI
- Resource type
- Rights statement
- In Copyright
- Advisor
- Anderson, James H.
- Smith, Don
- Baruah, Sanjoy
- Burns, Alan
- Brandenburg, Björn
- Degree
- Doctor of Philosophy
- Degree granting institution
- University of North Carolina at Chapel Hill Graduate School
- Graduation year
- 2016
- Language
Relations
- Parents:
This work has no parents.
Items
Thumbnail | Title | Date Uploaded | Visibility | Actions |
---|---|---|---|---|
Ward_unc_0153D_16612.pdf | 2019-04-09 | Public | Download |