Reordering constraints for pthread-style locks

No abstract is available for this paper.

• Publication year

  2007

• Venue

  ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming

• Publication date

  2007-03-14

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1229428.1229470
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs

  2016cited by this paper
• HP Laboratories

  2006cited by this paper
• Memory model for multithreaded C++: August 2005 status update

  2005influential reference
• The Java memory model

  2005cited by this paper
• Memory model for multithreaded C + + : Issues

  2005influential reference
• Exploiting deferred destruction: an analysis of read-copy-update techniques in operating system kernels

  2004cited by this paper
• JSR-133: Java Memory Model and Thread Specification

  2003cited by this paper
• Scalable queue-based spin locks with timeout

  2001cited by this paper
• Fast Multiprocessor Memory Allocation and Garbage Collection

  2000cited by this paper
• Basic compiler algorithms for parallel programs

  1999cited by this paper
• 25 Years of the International Symposia on Computer Architecture (Selected Papers)

  1998cited by this paper
• Thin locks: featherweight synchronization for Java

  1998cited by this paper
• Retrospective: memory consistency and event ordering in scalable shared-memory multiprocessors

  1998cited by this paper
• Shared Memory Consistency Models: A Tutorial

  1996cited by this paper
• Optimizing parallel programs with explicit synchronization

  1995cited by this paper
• Designing memory consistency models for shared-memory multiprocessors

  1993cited by this paper
• Weak ordering-a new definition

  1990cited by this paper
• Efficient and correct execution of parallel programs that share memory

  1988cited by this paper

• Weak Memory Model Formalisms: Introduction and Survey

  2025cites this paper
• A Study of Performance Programming of CPU, GPU accelerated Computers and SIMD Architecture

  2024cites this paper
• Subutai: Speeding Up Legacy Parallel Applications Through Data Synchronization

  2021cites this paper
• Towards Exploiting CPU Elasticity via Efficient Thread Oversubscription

  2020cites this paper
• Pinpoint Data Races via Testing and Classification

  2019cites this paper
• ORCA: Ordering-free Regions for Consistency and Atomicity

  2016cites this paper
• Formalizing and Checking Thread Refinement for Data-Race-Free Execution Models

  2015cites this paper
• Automated Classification of Data Races Under Both Strong and Weak Memory Models

  2015cites this paper
• Value-Passing CCS for Trees: A Theory for Concurrent Systems

  2015cites this paper
• Can seqlocks get along with programming language memory models?

  2012cites this paper
• Interference-Free Regions and Their Application to Compiler Optimization and Data-Race Detection

  2012cites this paper
• Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated

  2011cites this paper
• Performance implications of fence-based memory models

  2011cites this paper
• Stability in Weak Memory Models With Proofs

  2011cites this paper
• Stability in Weak Memory Models

  2011cites this paper
• A Comparison of Various Types of Extended Lexicon Models for Statistical Machine Translation

  2010cites this paper
• Memory models

  2010cites this paper
• Transactional memory should be an implementation technique, not a programming interface

  2009cites this paper
• Some resources for teaching concurrency

  2009cites this paper
• Memory models: a case for rethinking parallel languages and hardware

  2009cites this paper
• Foundations of the C++ concurrency memory model

  2008cites this paper
• Prism: A Principle-Based Sequential Memory Model for Microsoft Native Code Platforms

  2006cites this paper