research-article

STM-HRT: A Robust and Wait-Free STM for Hard Real-Time Multicore Embedded Systems

Authors:

Sylvain Cotard,

Audrey Queudet,

Jean-Luc Béchennec,

Sébastien Faucou,

Yvon TrinquetAuthors Info & Claims

ACM Transactions on Embedded Computing Systems (TECS), Volume 14, Issue 4

Article No.: 66, Pages 1 - 25

https://doi.org/10.1145/2786979

Published: 09 September 2015 Publication History

Abstract

This article introduces STM-HRT, a nonblocking wait-free software transactional memory (STM) for hard real-time (HRT) multicore embedded systems. Resource access control in HRT systems is usually implemented with lock-based synchronization. However, these mechanisms may lead to deadlocks or starvations and do not scale well with the number of cores. Most existing nonblocking STM are not suitable for HRT systems, because it is not possible to find an upper bound of the execution time for each task. In this article, we show how STM-HRT can be a robust solution for resource sharing in HRT multicore systems. We provide a detailed description of STM-HRT architecture. We propose a set of arguments to establish the functional correctness of its concurrency control protocol. Finally, as part of a real-time analysis, we derive upper bounds on the computations required to access shared data under STM-HRT.

References

[1]

J. H. Anderson and M. Moir. 1995. Universal construction for multi-object operations. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing. 184--193.

Digital Library

[2]

J. H. Anderson and M. Moir. 1999. Universal constructions for large objects. IEEE Transactions on Parallel and Distributed Systems 10, 12, 1317--1332.

Digital Library

[3]

AUTOSAR. 2015. AUTOSAR GbR. Technical Overview. {Online} http://www.autosar.org.

[4]

T. P. Baker. 1990. A stack-based resource allocation policy for realtime processes. In Proceedings of the 11th IEEE Real-Time Systems Symposium. 191--200.

[5]

J. L. Béchennec, M. Briday, S. Faucou, and Y. Trinquet. 2006. Trampoline—an open source implementation of the OSEK/VDX RTOS specification. In Proceedings of the IEEE Conference on Emerging Technologies and Factory Automation. IEEE, Los Alamitos, CA, 62--69.

[6]

A. Benveniste, P. Caspi, M. Di Natale, C. Pinello, A. Sangiovanni-Vincentelli, and S. Tripakis. 2007. Loosely time-triggered architectures based on communication-by-sampling. In Proceedings of the International Conference on Embedded Software (EMSOFT’07). 301--310.

Digital Library

[7]

A. Block, H. Leontyev, B. B. Brandenburg, and J. H. Anderson. 2007. A flexible real-time locking protocol for multiprocessors. In Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. IEEE, Los Alamitos, CA, 47--56.

Digital Library

[8]

J. Bobba, K. E. Moore, L. Yen, H. Volos, M. D. Hill, M. M. Swift, and D. A. Wood. 2007. Performance pathologies in hardware transactional memory. In Proceedings of the 34th Annual International Symposium on Computer Architecture (ISCA’07). 81--91.

Digital Library

[9]

T. Carle and D. Potop-Butucaru. 2014. Predicate-aware, makespan-preserving software pipelining of scheduling tables. ACM Transactions on Architecture and Code Optimization 11, 1--26.

Digital Library

[10]

J. Chen and A. Burns. 1997. A Fully Asynchronous Reader/Writer Mechanism for Multiprocessor Real-Time Systems. Technical Report. Department of Computer Science, University of York.

[11]

H. Cho, B. Ravindran, and E. D. Jensen. 2007. Space-optimal, wait-free real-time synchronization. IEEE Transactions on Computers 56, 3, 373--384.

Digital Library

[12]

K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger. 1976. The notions of consistency and predicate locks in a database system. Communications of the ACM 19, 624--633.

Digital Library

[13]

P. Fatourou. 2013. Theory results in transactional memory. In Proceedings of the 1st Euro-TM School on Transactional Memory, Co-Located with the 6th School on Hot Topics in Distributed Computing.

[14]

J. Forget, F. Boniol, E. Grolleau, D. Lesens, and C. Pagetti. 2010. Scheduling dependent periodic tasks without synchronization mechanisms. In Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’10). 301--310.

Digital Library

[15]

K. Fraser. 2004. Practical Lock-Freedom. Technical Report. University of Cambridge.

[16]

T. Haerder and A. Reuter. 1983. Principles of transaction-oriented database recovery. ACM Computing Surveys, 15, 287--317.

Digital Library

[17]

T. Harris and K. Fraser. 2003. Language support for lightweight transactions. In Proceedings of the 18th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications. 388--402.

Digital Library

[18]

T. Harris, J. R. Larus, and R. Rajwar. 2010. Transactional Memory (2nd ed.). Morgan and Claypool.

Digital Library

[19]

M. Herlihy. 1991. Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13, 1, 124--149.

Digital Library

[20]

M. Herlihy. 1993. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems 15, 5, 745--770.

Digital Library

[21]

M. Herlihy, J. Eliot, and B. Moss. 1993. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the 20th Annual International Symposium on Computer Architecture. 289--300.

Digital Library

[22]

M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer III. 2003. Software transactional memory for dynamic-sized data structures. In Proceedings of the Annual Symposium on Principles of Distributed Computing (PODC’03). 92--101.

Digital Library

[23]

G. J. Holzmann. 1997. The model checker SPIN. IEEE Transactions on Software Engineering: Special Issue on Formal Methods in Software Practice 23, 5, 279--295.

Digital Library

[24]

J. M. Lopez, J. L. Diaz, and D. F. Garcia. 2004. Utilization bounds for EDF scheduling on real-time multiprocessor systems. Journal of Real-Time Systems 28, 1, 39--68.

Digital Library

[25]

A. K. Mok. 1983. Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment. Technical Report. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA.

Digital Library

[26]

R. Rajkumar. 1991. Synchronization in Real-Time Systems: A Priority Inheritance Approach. Kluwer Academic.

Digital Library

[27]

W. N. Scherer III and M. L. Scott. 2004. Contention management in dynamic software transactional memory. In Proceedings of the Principles of Distributed Computing Workshop on Concurrency and Synchronization in Java Programs.

[28]

T. Sarni, A. Queudet, and P. Valduriez. 2009a. Real-time support for software transactional memory. In Proceedings of the 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 477--485.

Digital Library

[29]

T. Sarni, A. Queudet, and P. Valduriez. 2009b. Transactional memory: Worst case execution time analysis. In Proceedings of the 17th IEEE International Conference on Real-Time and Network Systems.

[30]

L. Sha, R. Rajkumar, and J. P. Lehoczky. 1990. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers 39, 9, 1175--1185.

Digital Library

[31]

N. Shavit and D. Touitou. 1995. Software transactional memory. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing. 204--213.

Digital Library

[32]

A. Shriraman and S. Dwarkadas. 2009. Refereeing conflicts in hardware transactional memory. In Proceedings of the 23rd International Conference on Supercomputing. 136--146.

Digital Library

[33]

O. Song and C. H. Choi. 2003. Wait-free data sharing between periodic tasks in multiprocessor control systems. Control Engineering Practice 11, 6, 601--611.

[34]

H. Zeng and M. Di Natale. 2011. Mechanisms for guaranteeing data consistency and flow preservation in AUTOSAR software on multi-core platforms. In Proceedings of the Symposium on Industrial Embedded Systems. 140--149.

Cited By

Nord CCaspin SNemitz CShrobe HOkhravi HAnderson JBurow NWard B(2021)TORTIS: Retry-Free Software Transactional Memory for Real-Time Systems2021 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS52674.2021.00049(469-481)Online publication date: Dec-2021
https://doi.org/10.1109/RTSS52674.2021.00049
Quillet AQueudet ALime DCucu-Grosjean LMedina RAltmeyer SScharbarg J(2020)Analysis of Polka Contention Manager for use in Multicore Hard Real-Time SystemsProceedings of the 28th International Conference on Real-Time Networks and Systems10.1145/3394810.3394825(11-21)Online publication date: 9-Jun-2020
https://dl.acm.org/doi/10.1145/3394810.3394825
Peterson CCook VDechev D(2019)Practical Progress Verification of Descriptor-Based Non-Blocking Data Structures2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS.2019.00019(83-93)Online publication date: Oct-2019
https://doi.org/10.1109/MASCOTS.2019.00019

Index Terms

STM-HRT: A Robust and Wait-Free STM for Hard Real-Time Multicore Embedded Systems
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management

Recommendations

McRT-STM: a high performance software transactional memory system for a multi-core runtime
PPoPP '06: Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming

Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed this concurrency using locks (mutex based synchronization). Unfortunately, ...
Hybrid STM/HTM for nested transactions on OpenJDK
OOPSLA '16

Transactional memory (TM) has long been advocated as a promising pathway to more automated concurrency control for scaling concurrent programs running on parallel hardware. Software TM (STM) has the benefit of being able to run general transactional ...
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness
OPODIS '08: Proceedings of the 12th International Conference on Principles of Distributed Systems

The aim of a software transactional memory (STM) system is to facilitate the delicate problem of low-level concurrency management, i.e. the design of programs made up of processes/threads that concurrently access shared objects. To that end, a STM ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 14, Issue 4

December 2015

604 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/2821757

Editor:
Sandeep K. Shukla
Virginia Tech, USA

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 09 September 2015

Accepted: 01 May 2015

Revised: 01 February 2015

Received: 01 September 2014

Published in TECS Volume 14, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
178
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Nord CCaspin SNemitz CShrobe HOkhravi HAnderson JBurow NWard B(2021)TORTIS: Retry-Free Software Transactional Memory for Real-Time Systems2021 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS52674.2021.00049(469-481)Online publication date: Dec-2021
https://doi.org/10.1109/RTSS52674.2021.00049
Quillet AQueudet ALime DCucu-Grosjean LMedina RAltmeyer SScharbarg J(2020)Analysis of Polka Contention Manager for use in Multicore Hard Real-Time SystemsProceedings of the 28th International Conference on Real-Time Networks and Systems10.1145/3394810.3394825(11-21)Online publication date: 9-Jun-2020
https://dl.acm.org/doi/10.1145/3394810.3394825
Peterson CCook VDechev D(2019)Practical Progress Verification of Descriptor-Based Non-Blocking Data Structures2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS.2019.00019(83-93)Online publication date: Oct-2019
https://doi.org/10.1109/MASCOTS.2019.00019

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents