The Community for Technology Leaders
2013 IEEE 34th Real-Time Systems Symposium (2005)
Miami, Florida
Dec. 5, 2005 to Dec. 8, 2005
ISSN: 1052-8725
ISBN: 0-7695-2490-7
pp: 62-71
Bin Xin , Purdue University
Antonio Cunei , Purdue University
Suresh Jagannathan , Purdue University
Marek Prochazka , Purdue University
Jeremy Manson , Purdue University
Jan Vitek , Purdue University
Jason Baker , Purdue University
We present a new concurrency control abstraction for real-time systems called preemptible atomic regions (PARs). PARs a transactional mechanism that improves upon lock-based mutual exclusion in several ways. First, and foremost, PARs provide strong correctness guarantees. Any sequence of operations declared atomic will not suffer interference from other threads, even in the presence of programmer errors. In spite of this, PARs can be preempted by high priority tasks; this is essential to the minimization of blocking times. We have implemented PARs in a uniprocessor real-time Java virtual machine and evaluated their utility on a number of programs. The results suggest that programs that use PARs, depending on their semantics, can run faster and experience less jitter than those that use locks.
Bin Xin, Antonio Cunei, Suresh Jagannathan, Marek Prochazka, Jeremy Manson, Jan Vitek, Jason Baker, "Preemptible Atomic Regions for Real-Time Java", 2013 IEEE 34th Real-Time Systems Symposium, vol. 00, no. , pp. 62-71, 2005, doi:10.1109/RTSS.2005.34
82 ms
(Ver 3.3 (11022016))