Lock-free synchronization for dynamic embedded real-time systems

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 arri...

Full description

Saved in:
Bibliographic Details
Published inACM transactions on embedded computing systems Vol. 9; no. 3; pp. 1 - 28
Main Authors Cho, Hyeonjoong, Ravindran, Binoy, Jensen, E. Douglas
Format Journal Article
LanguageEnglish
Published 01.02.2010
Subjects
Arrivals
Dynamical systems
Dynamics
Real time
Synchronism
Synchronization
Upper bounds
Utilities
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1539-9087
1558-3465
DOI:10.1145/1698772.1698781