<--- Back to Details
First PageDocument Content
Computer programming / Software engineering / Concurrency control / Computing / Recursion / Spinlock / Compare-and-swap / Synchronization / Thread / Null / Non-blocking algorithm / Lock
Date: 2012-11-10 09:59:34
Computer programming
Software engineering
Concurrency control
Computing
Recursion
Spinlock
Compare-and-swap
Synchronization
Thread
Null
Non-blocking algorithm
Lock

Logical Relations for Fine-Grained Concurrency Aaron Turon Jacob Thamsborg Amal Ahmed

Add to Reading List

Source URL: www.ccs.neu.edu

Download Document from Source Website

File Size: 643,07 KB

Share Document on Facebook

Similar Documents

Administrivia  Design of Parallel and High-Performance Computing

Administrivia  Design of Parallel and High-Performance Computing

DocID: 1rqkH - View Document

Administrivia  Design of Parallel and High-Performance Computing

Administrivia  Design of Parallel and High-Performance Computing

DocID: 1rnNM - View Document

Aaron Turon  Research Statement My research lies broadly in the areas of programming languages and verification, with the goal of building reliable software systems. I am drawn to software components that are usually cha

Aaron Turon Research Statement My research lies broadly in the areas of programming languages and verification, with the goal of building reliable software systems. I am drawn to software components that are usually cha

DocID: 1rnbf - View Document

Reagents: Expressing and Composing Fine-grained Concurrency Aaron Turon Northeastern University

Reagents: Expressing and Composing Fine-grained Concurrency Aaron Turon Northeastern University

DocID: 1rk2P - View Document

Brief Announcement: Selfishness in Transactional Memory Raphael Eidenbenz Roger Wattenhofer  Computer Engineering and Networks Lab

Brief Announcement: Selfishness in Transactional Memory Raphael Eidenbenz Roger Wattenhofer Computer Engineering and Networks Lab

DocID: 1qKkF - View Document