Article

The synergy between non-blocking synchronization and operating system structure

Authors:

Michael Greenwald,

David CheritonAuthors Info & Claims

OSDI '96: Proceedings of the second USENIX symposium on Operating systems design and implementation

Pages 123 - 136

https://doi.org/10.1145/238721.238767

Published: 28 October 1996 Publication History

Abstract

No abstract available.

Cited By

View all

Bencivenga DGiakkoupis GWoelfel PKuznetsov PGelles ROlivetti D(2024)Faster Randomized Repeated Choice and DCASProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662828(454-464)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662828
Giakkoupis GGiv MWoelfel PKhuller SVassilevska Williams V(2021)Efficient randomized DCASProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451133(1221-1234)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451133
Qian JLi XJung TFan YWang YTang S(2019)Social Network De-anonymizationACM Transactions on Internet Technology10.1145/331036319:3(1-22)Online publication date: 16-May-2019
https://dl.acm.org/doi/10.1145/3310363
Show More Cited By

Index Terms

The synergy between non-blocking synchronization and operating system structure

Recommendations

Operating System Transactions
SOSP '09: Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles

Applications must be able to synchronize accesses to operating system resources in order to ensure correctness in the face of concurrency and system failures. System transactions allow the programmer to specify updates to heterogeneous system resources ...
Grasping the gap between blocking and non-blocking transactional memories

Transactional memory (TM) is an inherently optimistic abstraction: it allows concurrent processes to execute sequences of shared-data accesses (transactions) speculatively, with an option of aborting them in the future. Early TM designs avoided using ...
Safe Non-blocking Synchronization in Ada2x
Reliable Software Technologies – Ada-Europe 2018
Abstract
The mutual-exclusion property of locks stands in the way to scalability of parallel programs on many-core architectures. Locks do not allow progress guarantees, because a task may fail inside a critical section and keep holding a lock that blocks ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

OSDI '96: Proceedings of the second USENIX symposium on Operating systems design and implementation

October 1996

291 pages

ISBN:1880446820

DOI:10.1145/238721

ACM SIGOPS Operating Systems Review Volume 30, Issue SI
Oct. 1996
274 pages
ISSN:0163-5980
DOI:10.1145/248155
Editor:
William M. Waite
Univ. of Colorado, Boulder
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 October 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

OSDI96

Sponsor:

SIGOPS
IEEE-CS
USENIX Assoc

OSDI96: Second Symposium on Operating Systems Design and Implementation

October 29 - November 1, 1996

Washington, Seattle, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

78
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bencivenga DGiakkoupis GWoelfel PKuznetsov PGelles ROlivetti D(2024)Faster Randomized Repeated Choice and DCASProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662828(454-464)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662828
Giakkoupis GGiv MWoelfel PKhuller SVassilevska Williams V(2021)Efficient randomized DCASProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451133(1221-1234)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451133
Qian JLi XJung TFan YWang YTang S(2019)Social Network De-anonymizationACM Transactions on Internet Technology10.1145/331036319:3(1-22)Online publication date: 16-May-2019
https://dl.acm.org/doi/10.1145/3310363
Ning XYao LBenatallah BZhang YSheng QKanhere S(2019)Source-Aware Crisis-Relevant Tweet Identification and Key Information SummarizationACM Transactions on Internet Technology10.1145/330022919:3(1-20)Online publication date: 27-Aug-2019
https://dl.acm.org/doi/10.1145/3300229
Patil RModi C(2019)An Exhaustive Survey on Security Concerns and Solutions at Different Components of VirtualizationACM Computing Surveys10.1145/328730652:1(1-38)Online publication date: 13-Feb-2019
https://dl.acm.org/doi/10.1145/3287306
Ugawa TRitson CJones R(2018)Transactional SapphireACM Transactions on Programming Languages and Systems10.1145/322622540:4(1-56)Online publication date: 10-Dec-2018
https://dl.acm.org/doi/10.1145/3226225
Patel SKalayappan RMahajan ISarangi S(2017)A hardware implementation of the MCAS synchronization primitiveProceedings of the Conference on Design, Automation & Test in Europe10.5555/3130379.3130598(918-921)Online publication date: 27-Mar-2017
https://dl.acm.org/doi/10.5555/3130379.3130598
Patel SKalayappan RMahajan ISarangi S(2017)A hardware implementation of the MCAS synchronization primitiveDesign, Automation & Test in Europe Conference & Exhibition (DATE), 201710.23919/DATE.2017.7927120(918-921)Online publication date: Mar-2017
https://doi.org/10.23919/DATE.2017.7927120
Negele FFriedrich FOh SEgger B(2017)On the Design and Implementation of an Efficient Lock-Free SchedulerJob Scheduling Strategies for Parallel Processing10.1007/978-3-319-61756-5_2(22-45)Online publication date: 12-Jul-2017
https://doi.org/10.1007/978-3-319-61756-5_2
Cederman DGidenstam AHa PSundell HPapatriantafilou MTsigas P(2017)Lock‐Free Concurrent Data StructuresProgramming multi‐core and many‐core computing systems10.1002/9781119332015.ch3(59-79)Online publication date: 27-Jan-2017
https://doi.org/10.1002/9781119332015.ch3
Show More Cited By

View Options

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.

Cited By

Index Terms

Recommendations

Operating System Transactions

Grasping the gap between blocking and non-blocking transactional memories

Safe Non-blocking Synchronization in Ada2x

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

Abstract

Cited By

Index Terms

Recommendations

Operating System Transactions

Grasping the gap between blocking and non-blocking transactional memories

Safe Non-blocking Synchronization in Ada2x

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations