An asynchronous nonblocking coordination and synchronization protocol for a parallel robotic control kernel

Authors:
Philippe Stellwag;Wolfgang Schröder-Preikschat;Daniel Lohmann
Affiliations:
Friedrich-Alexander University Erlangen-Nuremberg, Erlangen, Germany;Friedrich-Alexander University Erlangen-Nuremberg, Erlangen, Germany;Friedrich-Alexander University Erlangen-Nuremberg, Erlangen, Germany
Venue:
Proceedings of the Second Workshop on Isolation and Integration in Embedded Systems
Year:
2009

Citing 7
Cited 0

Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent Reading While Writing

ACM Transactions on Programming Languages and Systems (TOPLAS)
A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
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
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
A Non-Blocking Buffer Mechanism for Real-Time Event Message Communication

Real-Time Systems
Software Transactional Memory: Why Is It Only a Research Toy?

Queue - The Concurrency Problem

Quantified Score

Hi-index	0.00

Visualization

Abstract

Over the last 25 years, performance improvements by the steady increase of CPU clock frequencies were the driving factor for innovations in the domain of computationally intensive embedded applications. Now the free lunch is over [12] --- developers have to parallelize their systems in order to achieve further improvements by integration of multi-core platforms. In embedded systems, this is even more challenging than in the domain of desktop computers, as safety properties and hard real-time constraints impose a much stronger demand on determinism. In this experience report, we present a concrete coordination and synchronization problem for a double buffering procedure that arose on our ongoing attempts to parallelize a robotic control kernel. This double buffering procedure used by two tasks must assure a consistent data flow without data losses. Therefore, we approach a fast bounded wait-free solution, which does not suffer from priority inversion.