On bounding response times under software transactional memory in distributed multiprocessor real-time systems

Authors:
Sherif F. Fahmy;Binoy Ravindran;E. D. Jensen
Affiliations:
Virginia Tech, Blacksburg, VA;Virginia Tech, Blacksburg, VA;The MITRE Corporation, Bedford, MA
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2009

Citing 11
Cited 5

Real-time computing with lock-free shared objects

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
A framework for implementing objects and scheduling tasks in lock-free real-time systems

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Language support for lightweight transactions

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

Journal of Computer and System Sciences
Preemptible Atomic Regions for Real-Time Java

RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Exploiting distributed version concurrency in a transactional memory cluster

Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
The Problem with Threads

Computer
Supporting lock-free synchronization in Pfair-scheduled real-time systems

Journal of Parallel and Distributed Computing
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms

RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Software transactional memory for large scale clusters

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
On Scalable Synchronization for Distributed Embedded Real-Time Systems

SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems

A tuneable software cache coherence protocol for heterogeneous MPSoCs

CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
STM concurrency control for embedded real-time software with tighter time bounds

Proceedings of the 49th Annual Design Automation Conference
STM concurrency control for multicore embedded real-time software: time bounds and tradeoffs

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Revisiting transactions in Ada

ACM SIGAda Ada Letters
Leveraging transactional memory for a predictable execution of applications composed of hard real-time and best-effort tasks

Proceedings of the 21st International conference on Real-Time Networks and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider multiprocessor distributed real-time systems where concurrency control is managed using software transactional memory (or STM). For such a system, we propose an algorithm to compute an upper bound on the response time. The proposed algorithm can be used to study the behavior of systems where node crash failures are possible. We compare the result of the proposed algorithm to a simulation of the system being studied in order to determine its efficacy. The results of our study indicate that it is possible to provide timeliness guarantees for multiprocessor distributed systems programmed using STM.