skip to main content
poster

A predictable synchronisation algorithm

Published:10 February 2018Publication History
Skip Abstract Section

Abstract

Interaction with physical objects often imposes latency requirements to multi-core embedded systems. One consequence is the need for synchronisation algorithms that provide predictable latency, in addition to high throughput. We present a synchronisation algorithm that needs at most 7 atomic memory operations per asynchronous critical section. The performance is competitive, at least, to locks.

References

  1. G. Drescher and W. Schröder-Preikschat. 2015. Guarded Sections: Structuring Aid for Wait-Free Synchronisation. In IEEE ISORC '15. 280--283. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J.-P. Lozi, F. David, G. Thomas, J. Lawall, and G. Muller. 2012. Remote Core Locking: Migrating Critical-Section Execution to Improve the Performance of Multithreaded Applications. In USENIX ATC '12. 65--76. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Reif, T. Hönig, and W. Schröder-Preikschat. 2017. In the Heat of Conflict: On the Synchronisation of Critical Sections. In IEEE ISORC '17. 42--51.Google ScholarGoogle Scholar
  4. S. Reif and W. Schröder-Preikschat. 2017. Predictable Synchronisation Algorithms for Asynchronous Critical Sections. Technical Report.Google ScholarGoogle Scholar

Index Terms

  1. A predictable synchronisation algorithm

      Recommendations

      Comments

      Login options

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

      Sign in

      Full Access

      • Published in

        cover image ACM SIGPLAN Notices
        ACM SIGPLAN Notices  Volume 53, Issue 1
        PPoPP '18
        January 2018
        426 pages
        ISSN:0362-1340
        EISSN:1558-1160
        DOI:10.1145/3200691
        Issue’s Table of Contents
        • cover image ACM Conferences
          PPoPP '18: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
          February 2018
          442 pages
          ISBN:9781450349826
          DOI:10.1145/3178487

        Copyright © 2018 Owner/Author

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 10 February 2018

        Check for updates

        Qualifiers

        • poster

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!