NDLI: Lightweight annotations for controlling sharing in concurrent data structures

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

Dynamic software updates: a VM-centric approach

Staged information flow for javascript

Lightweight annotations for controlling sharing in concurrent data structures

Progress guarantee for parallel programs via bounded lock-freedom

A decision procedure for subset constraints over regular languages

GC assertions: using the garbage collector to check heap properties

Sharing classes between families

Verified validation of lazy code motion

Automatic generation of library bindings using static analysis

A study of memory management for web-based applications on multicore processors

Programming model for a heterogeneous x86 platform

Safe and timely updates to multi-threaded programs

Laminar: practical fine-grained decentralized information flow control

A randomized dynamic program analysis technique for detecting real deadlocks

Stretching transactional memory

Verifiable composition of deterministic grammars

SoftBound: highly compatible and complete spatial memory safety for c

Typed self-representation

Proving optimizations correct using parameterized program equivalence

Snugglebug: a powerful approach to weakest preconditions

Efficiently and precisely locating memory leaks and bloat

Binary analysis for measurement and attribution of program performance

CEAL: a C-based language for self-adjusting computation

Merlin: specification inference for explicit information flow problems

FastTrack: efficient and precise dynamic race detection

Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory

Analyzing recursive programs using a fixed-point calculus

Implementation of the memory-safe full ANSI-C compiler

Type-based data structure verification

An integrated proof language for imperative programs

Control-flow refinement and progress invariants for bound analysis

Chameleon: adaptive selection of collections

Semantics-aware trace analysis

PetaBricks: a language and compiler for algorithmic choice

TAJ: effective taint analysis of web applications

LiteRace: effective sampling for lightweight data-race detection

Towards a holistic approach to auto-parallelization: integrating profile-driven parallelism detection and machine-learning based mapping

Program verification using templates over predicate abstraction

Error propagation analysis for file systems

Go with the flow: profiling copies to find runtime bloat

Trace-based just-in-time type specialization for dynamic languages

Lightweight annotations for controlling sharing in concurrent data structures

Content Provider	ACM Digital Library
Author	Gay, David Naik, Mayur Anderson, Zachary R.
Abstract	SharC is a recently developed system for checking data-sharing in multithreaded programs. Programmers specify sharing rules (read-only, protected by a lock, etc.) for individual objects, and the SharC compiler enforces these rules using static and dynamic checks. Violations of these rules indicate unintended data sharing, which is the underlying cause of harmful data-races. Additionally, SharC allows programmers to change the sharing rules for a specific object using a sharing cast, to capture the fact that sharing rules for an object often change during the object's lifetime. SharC was successfully applied to a number of multi-threaded C programs. However, many programs are not readily checkable using SharC because their sharing rules, and changes to sharing rules, effectively apply to whole data structures rather than to individual objects. We have developed a system called Shoal to address this shortcoming. In addition to the sharing rules and sharing cast of SharC, our system includes a new concept that we call groups. A group is a collection of objects all having the same sharing mode. Each group has a distinguished member called the group leader. When the sharing mode of the group leader changes by way of a sharing cast, the sharing mode of all members of the group also changes. This operation is made sound by maintaining the invariant that at the point of a sharing cast, the only external pointer into the group is the pointer to the group leader. The addition of groups allows checking safe concurrency at the level of data structures rather than at the level of individual objects. We demonstrate the necessity and practicality of groups by applying Shoal to a wide range of concurrent C programs (the largest approaching a million lines of code). In all benchmarks groups entail low annotation burden and no significant additional performance overhead.
Starting Page	98
Ending Page	109
Page Count	12
File Format	PDF
ISBN	9781605583921
DOI	10.1145/1542476.1542488
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-06-15
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Multithreaded programming Data races Concurrent programming
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

Lightweight annotations for controlling sharing in concurrent data structures

Lightweight annotations for controlling sharing in concurrent data structures (2009)

A scalable cache design for I-structures in multithreaded architectures

A Java dialect free of data races and without annotations

Exploiting the locality of data structures in multithreaded architecture

Concurrency control for multithreaded reactive programming

Drop the anchor: lightweight memory management for non-blocking data structures

A Hierarchical Load-Balancing Framework for Dynamic Multithreaded Computations

Gossamer: A Lightweight Approach to Using Multicore Machines

Lightweight annotations for controlling sharing in concurrent data structures

Similar Documents

Lightweight annotations for controlling sharing in concurrent data structures

Lightweight annotations for controlling sharing in concurrent data structures (2009)

A scalable cache design for I-structures in multithreaded architectures

A Java dialect free of data races and without annotations

Exploiting the locality of data structures in multithreaded architecture

Concurrency control for multithreaded reactive programming

Drop the anchor: lightweight memory management for non-blocking data structures

A Hierarchical Load-Balancing Framework for Dynamic Multithreaded Computations

Gossamer: A Lightweight Approach to Using Multicore Machines

Lightweight annotations for controlling sharing in concurrent data structures