A Wait-Free NCAS Library for Parallel Applications with Timing Constraints

Stellwag P, Scheler F, Krainz J, Schröder-Preikschat W (2011)


Publication Language: English

Publication Type: Conference contribution, Original article

Publication year: 2011

Journal

Publisher: Association for Computing Machinary, Inc.

Edited Volumes: ACM SIGPLAN Notices

Pages Range: 301-302

Conference Proceedings Title: Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming 2011 (PPoPP 2011)

Event location: San Antonio, TX US

ISBN: 978-1-4503-0119-0

URI: http://www4.informatik.uni-erlangen.de/Publications/2011/stellwag_ppopp2011_rtncas.pdf

DOI: 10.1145/2038037.1941599

Abstract

We introduce our major ideas of a wait-free, linearizable, and disjoint-access parallel NCAS library, called RTNCAS. It focuses the construction of wait-free data structure operations (DSO) in real-time circumstances. RTNCAS is able to conditionally swap multiple independent words (NCAS) in an atomic manner. It allows us, furthermore, to implement arbitrary DSO by means of their sequential specification. Copyright © 2011 ACM.

Authors with CRIS profile

How to cite

APA:

Stellwag, P., Scheler, F., Krainz, J., & Schröder-Preikschat, W. (2011). A Wait-Free NCAS Library for Parallel Applications with Timing Constraints. In Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming 2011 (PPoPP 2011) (pp. 301-302). San Antonio, TX, US: Association for Computing Machinary, Inc..

MLA:

Stellwag, Philippe, et al. "A Wait-Free NCAS Library for Parallel Applications with Timing Constraints." Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming (PPoPP'11), San Antonio, TX Association for Computing Machinary, Inc., 2011. 301-302.

BibTeX: Download