A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lock-free linked lists using compare-and-swap
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Real-time computing with lock-free shared objects
ACM Transactions on Computer Systems (TOCS)
Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
Journal of Parallel and Distributed Computing
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
An Adaptive, Distributed Airborne Tracking System ("process the Right Tracks at the Right Time")
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Improving Wait-Free Algorithms for Interprocess Communication in Embedded Real-Time Systems
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Wait-free object-sharing schemes for real-time uniprocessors and multiprocessors
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Efficient Object Sharing in Quantum-Based Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
IEEE Transactions on Software Engineering
On Recent Advances in Time/Utility Function Real-Time Scheduling and Resource Management
ISORC '05 Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
A Space-Optimal Wait-Free Real-Time Synchronization Protocol
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Space-Optimal, Wait-Free Real-Time Synchronization
IEEE Transactions on Computers
On scheduling soft real-time tasks with lock-free synchronization for embedded devices
Proceedings of the 2009 ACM symposium on Applied Computing
Journal of Parallel and Distributed Computing
Energy and throughput efficient transactional memory for embedded multicore systems
HiPEAC'10 Proceedings of the 5th international conference on High Performance Embedded Architectures and Compilers
| Hi-index | 0.00 |
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.