Add to ORKGWe present a wait-free protocol for the single-writer/multiple-reader problem in small-memory embedded real-time systems. We analytically establish that our proto-col requires lesser (or equal) number of buffers than previ-ously best wait-free protocols for this problem. Further, we prove that our protocol is space-optimal — the first space optimality established for wait-free protocols that consider a-priori knowledge of preemptions. Our evaluation studies and implementation measurements using the SHaRK RTOS kernel confirm the protocol’s superiority and effectiveness. 1
Recently, we have proposed a set of buffering schemes to preserve the semantics of a synchronous pro...
Multi-core CPUs have become the standard in embedded real-time systems. In such systems, where sever...
Abstract. A wait-free algorithm for implementing a snapshot mechanism for real-time systems is prese...
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor ...
Data sharing among tasks within multiprocessor real-time systems is a crucial issue. This report pre...
A non-blocking protocol that allows real-time tasks to share data in a multiprocessor system is pres...
The thesis investigates non-blocking synchronization in shared memory systems, in particular in high...
As a transparent communication protocol for concurrent distributed applications, the Publish-Subscri...
A wait-free algorithm for implementing a snapshot mechanism for real-time systems is presented in th...
We consider the problem of wait-free implementation of a multi-writer snapshot object with m >= 2...
The thesis investigates non-blocking synchronization in shared memory systems, in particular in high...
International audienceWe consider a system of n processes with ids not a priori known, that are draw...
International audienceMany algorithms designed for shared-memory distributed systems assume the sing...
This paper aims at bridging the gap between the lack of synchronization mechanisms in recent graphic...
Conventional wisdom holds that contention due to busy-wait synchronization is a major obstacle to sc...
Recently, we have proposed a set of buffering schemes to preserve the semantics of a synchronous pro...
Multi-core CPUs have become the standard in embedded real-time systems. In such systems, where sever...
Abstract. A wait-free algorithm for implementing a snapshot mechanism for real-time systems is prese...
A space efficient wait-free algorithm for implementing a shared buffer for real-time multiprocessor ...
Data sharing among tasks within multiprocessor real-time systems is a crucial issue. This report pre...
A non-blocking protocol that allows real-time tasks to share data in a multiprocessor system is pres...
The thesis investigates non-blocking synchronization in shared memory systems, in particular in high...
As a transparent communication protocol for concurrent distributed applications, the Publish-Subscri...
A wait-free algorithm for implementing a snapshot mechanism for real-time systems is presented in th...
We consider the problem of wait-free implementation of a multi-writer snapshot object with m >= 2...
The thesis investigates non-blocking synchronization in shared memory systems, in particular in high...
International audienceWe consider a system of n processes with ids not a priori known, that are draw...
International audienceMany algorithms designed for shared-memory distributed systems assume the sing...
This paper aims at bridging the gap between the lack of synchronization mechanisms in recent graphic...
Conventional wisdom holds that contention due to busy-wait synchronization is a major obstacle to sc...
Recently, we have proposed a set of buffering schemes to preserve the semantics of a synchronous pro...
Multi-core CPUs have become the standard in embedded real-time systems. In such systems, where sever...
Abstract. A wait-free algorithm for implementing a snapshot mechanism for real-time systems is prese...