Lock-Free Synchronization for Dynamic Embedded Real-Time Systems
- Authors
- Cho, Hyeonjoong; Ravindran, Binoy; Jensen, E. Douglas
- Issue Date
- 2월-2010
- Publisher
- ASSOC COMPUTING MACHINERY
- Keywords
- Experimentation; Performance; Theory; Time/utility function; utility accrual criteria; real-time; lock-free; scheduling; synchronization
- Citation
- ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, v.9, no.3
- Indexed
- SCIE
SCOPUS
- Journal Title
- ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS
- Volume
- 9
- Number
- 3
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/117023
- DOI
- 10.1145/1698772.1698781
- ISSN
- 1539-9087
- Abstract
- We consider lock-free synchronization for dynamic embedded real-time systems that are subject to resource overloads and arbitrary activity arrivals. We model activity arrival behaviors using the unimodal arbitrary arrival model (or UAM). UAM embodies a stronger "adversary" than most traditional arrival models. We derive an upper bound on lock-free retries under the UAM with utility accrual scheduling-the first such result. We establish the tradeoffs between lock-free and lock-based sharing under UAM. These include conditions under which activities' accrued timeliness utility is greater under lock-free than lock-based, and the consequent lower and upper bound on the total accrued utility that is possible with lock-free and lock-based sharing. We confirm our analytical results with a POSIX RTOS implementation.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer and Information Science > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.