Mechanisms for store-wait-free multiprocessors

No abstract is available for this paper.

• Publication year

  2007

• Venue

  International Symposium on Computer Architecture

• Publication date

  2007-06-09

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1250662.1250696
• 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
• Transactional Memory

  2007cited by this paper
• BulkSC: bulk enforcement of sequential consistency

  2007cited by this paper
• SimFlex: Statistical Sampling of Computer System Simulation

  2006influential reference
• CAVA: Using checkpoint-assisted value prediction to hide L2 misses

  2006cited by this paper
• Conditional Memory Ordering

  2006influential reference
• Fire-and-Forget: Load/Store Scheduling with No Store Queue at All

  2006cited by this paper
• NoSQ: Store-Load Communication without a Store Queue

  2006cited by this paper
• Scalable Load and Store Processing in Latency-Tolerant Processors

  2005influential reference
• Store memory-level parallelism optimizations for commercial applications

  2005influential reference
• Store vulnerability window (SVW): re-execution filtering for enhanced load optimization

  2005cited by this paper
• DBmbench: fast and accurate database workload representation on modern microarchitecture

  2005cited by this paper
• Store buffer design in first-level multibanked data caches

  2005cited by this paper
• Increasing processor performance through early register release

  2004cited by this paper
• Microarchitecture optimizations for exploiting memory-level parallelism

  2004cited by this paper
• Reducing design complexity of the load/store queue

  2003cited by this paper
• SMARTS: accelerating microarchitecture simulation via rigorous statistical sampling

  2003cited by this paper
• Checkpoint processing and recovery: towards scalable large instruction window processors

  2003influential reference
• Speculative sequential consistency with little custom storage

  2002cited by this paper
• Cherry: Checkpointed early resource recycling in out-of-order microprocessors

  2002influential reference
• Transactional lock-free execution of lock-based programs

  2002cited by this paper
• Speculative synchronization: applying thread-level speculation to explicitly parallel applications

  2002influential reference
• Speculative lock elision: enabling highly concurrent multithreaded execution

  2001influential reference
• Issues in the design of store buffers in dynamically scheduled processors

  2000cited by this paper
• A scalable approach to thread-level speculation

  2000cited by this paper
• Is SC+ILP=RC?

  1999cited by this paper
• A Chip-Multiprocessor Architecture with Speculative Multithreading

  1999cited by this paper
• Retrospective: multiscalar processors

  1998cited by this paper
• Performance of database workloads on shared-memory systems with out-of-order processors

  1998influential reference
• Multiprocessors Should Support Simple Memory-Consistency Models

  1998cited by this paper
• Data speculation support for a chip multiprocessor

  1998cited by this paper
• The Interaction Of Software Prefetching With Ilp Processors In Shared-memory Systems

  1997influential reference
• Using speculative retirement and larger instruction windows to narrow the performance gap between memory consistency models

  1997influential reference
• Shared Memory Consistency Models: A Tutorial

  1996cited by this paper
• Transactional Memory: Architectural Support For Lock-free Data Structures

  1993cited by this paper
• Two Techniques to Enhance the Performance of Memory Consistency Models

  1991cited by this paper
• Performance evaluation of memory consistency models for shared-memory multiprocessors

  1991cited by this paper
• Relocation: Flexible Contexts for Multithreading

  year unknowncited by this paper

• PhasedStore: Supporting High-Performance Write-Through Cache-Coherence Protocols Under TSO

  2026influential citation
• Temporarily Unauthorized Stores: Write First, Ask for Permission Later

  2024cites this paper
• Imprecise Store Exceptions

  2023cites this paper
• AstriFlash A Flash-Based System for Online Services

  2023influential citation
• CELLO: Compiler-Assisted Efficient Load-Load Ordering in Data-Race-Free Regions

  2023cites this paper
• Rebooting Virtual Memory with Midgard

  2021cites this paper
• Systems-on-Chip with Strong Ordering

  2021cites this paper
• Regional Out-of-Order Writes in Total Store Order

  2020influential citation
• Boosting Store Buffer Efficiency with Store-Prefetch Bursts

  2020cites this paper
• Informed Prefetching for Indirect Memory Accesses

  2020cites this paper
• A Primer on Memory Consistency and Cache Coherence, Second Edition

  2020cites this paper
• Relaxed Persist Ordering Using Strand Persistency

  2020cites this paper
• A Workload and Programming Ease Driven Perspective of Processing-in-Memory

  2019cites this paper
• CoNDA: Efficient Cache Coherence Support for Near-Data Accelerators

  2019cites this paper
• Concurrency and Security Verification in Heterogeneous Parallel Systems

  2019cites this paper
• Processing-in-memory: A workload-driven perspective

  2019cites this paper
• SOFTWARE SUPPORT FOR HARDWARE PREDICTORS

  2019cites this paper
• Non-Speculative Store Coalescing in Total Store Order

  2018cites this paper
• SOFRITAS: Serializable Ordering-Free Regions for Increasing Thread Atomicity Scalably

  2018cites this paper
• Dynamic Memory Dependence Predication

  2018cites this paper
• Constructing a Weak Memory Model

  2018cites this paper
• Strong Memory Consistency For Parallel Programming

  2018cites this paper
• A FIFO spin-based resource control framework for symmetric multiprocessing

  2018cites this paper
• Louvre: Light-weight Ordering Using Versioning for Release Consistency

  2017cites this paper
• Flexible Support for Fast Parallel Commutative Updates

  2017cites this paper
• Efficient Sequential Consistency in GPUs via Relativistic Cache Coherence

  2017cites this paper
• An Operational Framework for Specifying Memory Models using Instantaneous Instruction Execution

  2017cites this paper
• Serializable Ordering-Free Regions for Increasing Thread

  2017cites this paper
• Weak Memory Models: Balancing Definitional Simplicity and Implementation Flexibility

  2017cites this paper
• Hiding the long latency of persist barriers using speculative execution

  2017cites this paper
• Hardware-Based Sequential Consistency Violation Detection Made Simpler

  2016cites this paper
• TriCheck: Memory Model Verification at the Trisection of Software, Hardware, and ISA

  2016cites this paper
• Taming Weak Memory Models

  2016cites this paper
• SABRes: Atomic object reads for in-memory rack-scale computing

  2016cites this paper
• Racer: TSO consistency via race detection

  2016cites this paper
• Delegated persist ordering

  2016cites this paper
• SCsafe: Logging sequential consistency violations continuously and precisely

  2016cites this paper
• WMM : a resilient Weak Memory Model

  2016cites this paper
• Exploring the Trisection of Software, Hardware, and ISA in Memory Model Design

  2016cites this paper
• Use of Symmetric Multiprocessor Architecture to achieve high performance computing

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

  2016cites this paper
• DRFx

  2016cites this paper
• Detecting, Exposing, and Classifying Sequential Consistency Violations

  2016cites this paper
• Efficiently enforcing strong memory ordering in GPUs

  2015cites this paper
• zFENCE: Data-less Coherence for Efficient Fences

  2015cites this paper
• OSPREY: Implementation of Memory Consistency Models for Cache Coherence Protocols involving Invalidation-Free Data Access

  2015cites this paper
• Temporally Bounding TSO for Fence-Free Asymmetric Synchronization

  2015cites this paper
• Memory persistency

  2014cites this paper
• On the exploration of the DRISC architecture

  2014cites this paper
• Database and System Design for Emerging Storage Technologies

  2014cites this paper
• Techniques for low overhead fences and sequential consistency violation recording

  2014cites this paper
• OmniOrder: Directory-based conflict serialization of transactions

  2014cites this paper
• Atomic SC for simple in-order processors

  2014cites this paper
• SAMO: store aware memory optimizations

  2014cites this paper
• An analysis of address and branch patterns with PatternFinder

  2014cites this paper
• Fence-free work stealing on bounded TSO processors

  2014cites this paper
• QuickRelease: A throughput-oriented approach to release consistency on GPUs

  2014cites this paper
• Performance Prediction for Dynamic Voltage and Frequency Scaling

  2014cites this paper
• Exploiting Parallelism in GPUs

  2014cites this paper
• Multiprocessor-safe wait-free queue in RTSJ

  2014cites this paper
• Scalable and flexible bulk architecture

  2013cites this paper
• FAst and Scalable Software Execution on Multicores/ Adam, Morrison

  2013cites this paper
• Imposing Minimal Memory Ordering on Multiprocessors

  2013influential citation
• Design of a distributed memory unit for clustered microarchitectures

  2013cites this paper
• WeeFence: toward making fences free in TSO

  2013cites this paper
• BulkCommit: Scalable and fast commit of atomic blocks in a lazy multiprocessor environment

  2013cites this paper
• TSO_ATOMICITY: efficient hardware primitive for TSO-preserving region optimizations

  2013cites this paper
• System Support for Concurrent Software Reliability

  2013influential citation
• Address-aware fences

  2013cites this paper
• A flexible multiprocessor resource sharing framework for Ada

  2013cites this paper
• Volition: scalable and precise sequential consistency violation detection

  2013cites this paper
• End-to-end sequential consistency

  2012influential citation
• BulkSMT: Designing SMT processors for atomic-block execution

  2012cites this paper
• When the ARM weakly consistent memory model meets speculation: is it necessary?

  2012influential citation
• Efficient sequential consistency via conflict ordering

  2012cites this paper
• AUTOMATIC CRITICAL SECTION DISCOVERY USING MEMORY USAGE PATTERNS.

  2012cites this paper
• Software and architecture support for the bulk multicore

  2012cites this paper
• A Primer on Memory Consistency and Cache Coherence

  2012cites this paper
• Vulcan: Hardware Support for Detecting Sequential Consistency Violations Dynamically

  2012cites this paper
• BlockChop: Dynamic squash elimination for hybrid processor architecture

  2012cites this paper
• Efficient processor support for DRFx, a memory model with exceptions

  2011cites this paper
• RCDC: a relaxed consistency deterministic computer

  2011cites this paper
• A fault-tolerant architecture for parallel applications in tiled-CMPs

  2011cites this paper
• TSO-Atomicity : Efficient TSO Enforcement for Aggressive Program Optimization

  2011cites this paper
• Efficient processor support for DRFx, a memory model with exceptions

  2011cites this paper
• FlexBulk: Intelligently forming atomic blocks in blocked-execution multiprocessors to minimize squashes

  2011influential citation
• Architectural techniques for memory oversight in multiprocessors

  2011cites this paper
• Conflict exceptions: simplifying concurrent language semantics with precise hardware exceptions for data-races

  2010cites this paper
• ColorSafe: architectural support for debugging and dynamically avoiding multi-variable atomicity violations

  2010cites this paper
• Energy Efficient Load Latency Tolerance: Single-Thread Performance for the Multi-Core Era

  2010cites this paper
• ScalableBulk: Scalable Cache Coherence for Atomic Blocks in a Lazy Environment

  2010cites this paper
• Mechanisms for unbounded, conflict-robust hardware transactional memory

  2010cites this paper
• Efficient Sequential Consistency Using Conditional Fences

  2010cites this paper
• R-NUCA: Data Placement in Distributed Shared Caches

  2009cites this paper
• Atom-Aid: Detecting and Surviving Atomicity Violations

  2009cites this paper
• Spatio-temporal memory streaming

  2009cites this paper
• Spatio-temporal memory streaming

  2009cites this paper
• Decoupled store completion/silent deterministic replay: enabling scalable data memory for CPR/CFP processors

  2009cites this paper
• InvisiFence: performance-transparent memory ordering in conventional multiprocessors

  2009cites this paper
• A System for Detecting, Preventing and Exposing Atomicity Violations in Multithreaded Programs

  2009cites this paper