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 tradit...
Saved in:
Published in | Proceedings of the Design Automation & Test in Europe Conference Vol. 1; pp. 1 - 6 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
2006
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
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 the 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 upper bound on the increase in accrued utility that is possible with lock-free. We confirm our analytical results with a POSIX RTOS implementation |
---|---|
ISBN: | 3981080114 9783981080117 |
ISSN: | 1530-1591 |
DOI: | 10.1109/DATE.2006.243800 |