Proceedings Article10.1109/RTSS.2005.34
Preemptible atomic regions for real-time Java
Jeremy Manson,Jason Baker,Antonio Cunei,Suresh Jagannathan,M. Prochazka,Bin Xin,Jan Vitek +6 more
- 05 Dec 2005
- pp 62-71
TL;DR: The results suggest that programs that use PARs, depending on their semantics, can run faster and experience less jitter than those that use locks.
read more
Abstract: 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
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The transactional memory / garbage collection analogy
Dan Grossman
- 21 Oct 2007
TL;DR: This essay presents remarkable similarities between transactional memory and garbage collection, and lets us better understand one technology by thinking about the corresponding issues for the other.
E-FRP with priorities
Roumen Kaiabachev,Walid Taha,Angela Zhu +2 more
- 30 Sep 2007
TL;DR: This paper shows that the compilation strategy of E-FRP enjoys the same properties as the original strategy, with the only change being that the programmer reasons modulo permutations on the order of event arrivals.
RTTM: real-time transactional memory
Martin Schoeberl,Florian Brandner,Jan Vitek +2 more
- 22 Mar 2010
TL;DR: This work proposes real-time transactional memory (RTTM) as a time-predictable synchronization solution for chip-multiprocessors in real- time systems and defines the hardware for time-Predictable transactions and provides a bound for the maximum transaction retries.
Software Transactional Memory as a Building Block for Parallel Embedded Real-Time Systems
António Barros,Luis Miguel Pinho +1 more
- 30 Aug 2011
TL;DR: This paper defends that the amount of contention can be reduced if read-only transactions access recent consistent data snapshots, progressing in a wait-free manner, and shows how the required number of versions of a shared object can be calculated for a set of tasks.
28
Response Time Analysis for the Abort-and-Restart Event Handlers of the Priority-Based Functional Reactive Programming (P-FRP) Paradigm
Jim Ras,Albert M. K. Cheng +1 more
- 24 Aug 2009
TL;DR: This paper refines the response time analysis for the abort-and-restart model on single-core systems with P-FRP, which is neither a concurrency control policy nor a true scheduling policy.
28
References
Transactional memory: architectural support for lock-free data structures
Maurice Herlihy,J. Eliot B. Moss +1 more
- 01 May 1993
TL;DR: Simulation results show that transactional memory matches or outperforms the best known locking techniques for simple benchmarks, even in the absence of priority inversion, convoying, and deadlock.
Priority inheritance protocols: an approach to real-time synchronization
TL;DR: An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol, both of which solve the uncontrolled priority inversion problem.
2.5K
The rate monotonic scheduling algorithm: exact characterization and average case behavior
John P. Lehoczky,Lui Sha,Y. Ding +2 more
- 05 Dec 1989
TL;DR: An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set and a stochastic analysis which gives the probability distribution of the breakdown utilization of randomly generated task sets are represented.
1.6K
Software transactional memory
Nir N. Shavit,Dan Touitou +1 more
- 20 Aug 1995
TL;DR: STM is used to provide a general highly concurrent method for translating sequential object implementations to non-blocking ones based on implementing a k-word compare&swap STM-transaction, a novel software method for supporting flexible transactional programming of synchronization operations.
Software transactional memory for dynamic-sized data structures
Maurice Herlihy,Victor Luchangco,Mark Moir,William N. Scherer +3 more
- 13 Jul 2003
TL;DR: A new form of software transactional memory designed to support dynamic-sized data structures, and a novel non-blocking implementation of this STM that uses modular contention managers to ensure progress in practice.
Related Papers (5)
Nir N. Shavit,Dan Touitou +1 more
- 20 Aug 1995
Roumen Kaiabachev,Walid Taha,Angela Zhu +2 more
- 30 Sep 2007
Zhanyong Wan,Paul Hudak +1 more
- 01 May 2000