NDLI: Efficient sequential consistency using conditional fences

Please wait, while we are loading the content...

Build Watson: an overview of DeepQA for the Jeopardy! challenge

Towards a science of parallel programming

Raising the level of many-core programming with compiler technology: meeting a grand challenge

Power and thermal characterization of POWER6 system

Accelerating multicore reuse distance analysis with sampling and parallelization

WAYPOINT: scaling coherence to thousand-core architectures

Feedback-directed pipeline parallelism

An OpenCL framework for heterogeneous multicores with local memory

On mitigating memory bandwidth contention through bandwidth-aware scheduling

Discovering and understanding performance bottlenecks in transactional applications

Design and implementation of the PLUG architecture for programmable and efficient network lookups

Semi-automatic extraction and exploitation of hierarchical pipeline parallelism using profiling information

Speculative-aware execution: a simple and efficient technique for utilizing multi-cores to improve single-thread performance

SWEL: hardware cache coherence protocols to map shared data onto shared caches

Compiler-assisted data distribution for chip multiprocessors

On-chip network design considerations for compute accelerators

System-level max power (SYMPO): a systematic approach for escalating system-level power consumption using synthetic benchmarks

Simple and fast biased locks

Subspace snooping: filtering snoops with operating system support

Scalable hardware support for conditional parallelization

Twin peaks: a software platform for heterogeneous computing on general-purpose and graphics processors

AKULA: a toolset for experimenting and developing thread placement algorithms on multicore systems

Efficient sequential consistency using conditional fences

A model for fusion and code motion in an automatic parallelizing compiler

The Paralax infrastructure: automatic parallelization with a helping hand

The potential of using dynamic information flow analysis in data value prediction

ATAC: a 1000-core cache-coherent processor with on-chip optical network

Data layout transformation exploiting memory-level parallelism in structured grid many-core applications

Believe it or not!: mult-core CPUs can match GPU performance for a FLOP-intensive application!

Scalable thread scheduling and global power management for heterogeneous many-core architectures

Avoiding deadlock avoidance

Proximity coherence for chip multiprocessors

Reducing task creation and termination overhead in explicitly parallel programs

MapCG: writing parallel program portable between CPU and GPU

Criticality-driven superscalar design space exploration

Partitioning streaming parallelism for multi-cores: a machine learning based approach

Ocelot: a dynamic optimization framework for bulk-synchronous applications in heterogeneous systems

AM++: a generalized active message framework

Efficient runahead threads

Using dead blocks as a virtual victim cache

Tiled-MapReduce: optimizing resource usages of data-parallel applications on multicore with tiling

Ordered and unordered algorithms for parallel breadth first search

Dynamically managed multithreaded reconfigurable architectures for chip multiprocessors

DAFT: decoupled acyclic fault tolerance

SPACE: sharing pattern-based directory coherence for multicore scalability

MEDICS: ultra-portable processing for medical image reconstruction

Adaptive spatiotemporal node selection in dynamic networks

A programmable parallel accelerator for learning and classification

Handling the problems and opportunities posed by multiple on-chip memory controllers

An empirical characterization of stream programs and its implications for language and compiler design

Using memory mapping to support cactus stacks in work-stealing runtime systems

Energy efficient speculative threads: dynamic thread allocation in Same-ISA heterogeneous multicore systems

Moths: mobile threads for on-chip networks

Improving speculative loop parallelization via selective squash and speculation reuse

Revisiting sorting for GPGPU stream architectures

Analyzing cache performance bottlenecks of STM applications and addressing them with compiler's help

An intra-tile cache set balancing scheme

StatCC: a statistical cache contention model

An integer programming framework for optimizing shared memory use on GPUs

Exploiting subtrace-level parallelism in clustered processors

A case for NUMA-aware contention management on multicore systems

DMATiler: revisiting loop tiling for direct memory access

Scaling of the PARSEC benchmark inputs

Online cache modeling for commodity multicore processors

NoC-aware cache design for chip multiprocessors

A software-SVM-based transactional memory for multicore accelerator architectures with local memory

NUcache: a multicore cache organization based on next-use distance

CoreGenesis: erasing core boundaries for robust and configurable performance

Automatic vector instruction selection for dynamic compilation

Approximating age-based arbitration in on-chip networks

Efficient sequential consistency using conditional fences

Content Provider	ACM Digital Library
Author	Nagarajan, Vijay Lin, Changhui Gupta, Rajiv
Abstract	Among the various memory consistency models, the sequential consistency (SC) model, in which memory operations appear to take place in the order specified by the program, is the most intuitive and enables programmers to reason about their parallel programs the best. Nevertheless, processor designers often choose to support relaxed memory consistency models because the weaker ordering constraints imposed by such models allow for more instructions to be reordered and enable higher performance. Programs running on machines supporting weaker consistency models, can be transformed into ones in which SC is enforced. The compiler does this by computing a minimal set of memory access pairs whose ordering automatically guarantees SC. To ensure that these memory access pairs are not reordered, memory fences are inserted. Unfortunately, insertion of such memory fences can significantly slowdown the program. We observe that the ordering of the minimal set of memory accesses that the compiler strives to enforce, is typically already enforced in the normal course of program execution. A study we conducted on programs with compiler inserted memory fences shows that only 8% of the executed instances of the memory fences are really necessary to ensure SC. Motivated by this study we propose the conditional fence mechanism (C-Fence) that utilizes compiler information to decide dynamically if there is a need to stall at each fence. Our experiments with SPLASH-2 benchmarks show that, with C-Fences, programs can be transformed to enforce SC incurring only 12% slowdown, as opposed to 43% slowdown using normal fence instructions. Our approach requires very little hardware support (<300 bytes of on-chip-storage) and it avoids the use of speculation and its associated costs.
Starting Page	295
Ending Page	306
Page Count	12
File Format	PDF
ISBN	9781450301787
DOI	10.1145/1854273.1854312
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-09-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Active table Conditional fences Associates Interprocessor delay Sequential consistency Memory consistency
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient Sequential Consistency Using Conditional Fences

Efficient sequential consistency using conditional fences

zFENCE: Data-less Coherence for Efficient Fences

WeeFence: toward making fences free in TSO

Asymmetric Memory Fences: Optimizing Both Performance and Implementability

DRFX: a simple and efficient memory model for concurrent programming languages

WeeFence:toward making fences free in TSO

Towards shared memory consistency models for GPUs

Efficient algorithms for verifying memory consistency

Efficient sequential consistency using conditional fences

Similar Documents

Efficient Sequential Consistency Using Conditional Fences

Efficient sequential consistency using conditional fences

zFENCE: Data-less Coherence for Efficient Fences

WeeFence: toward making fences free in TSO

Asymmetric Memory Fences: Optimizing Both Performance and Implementability

DRFX: a simple and efficient memory model for concurrent programming languages

WeeFence:toward making fences free in TSO

Towards shared memory consistency models for GPUs

Efficient algorithms for verifying memory consistency

Efficient sequential consistency using conditional fences