Concurrent data structure

Known as: Parallel data structure, Shared, Shared data structure

In computer science, a concurrent data structure is aparticular way of storing and organizing data for access bymultiple computing threads (or…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2012

Abstract In recent years, the computational fluid dynamics has been widely used in the aviation, weather, chemical industry and…

2010

In this paper, we evaluate and compare the parallel scalability of three commodity operating systems (Linux, Solaris and FreeBSD…

2008

Abstract The goals of ATF2 are to test a novel compact final focus optics design with local chromaticity correction intended for…

2007

The proliferation of applications dealing with shared data radically increases the need to identify and discover the semantically…

2004

Smart environments are often populated by resource-restricted devices that need to cooperate with each other in order to access…

1995

Given a shared, atomic read-modify-write register r with deterministic operations, Herlihy (1991) has defined an interference…

Review

1992

Review

1992

The specification and implementation of current telecommunication services tend to be intimately bound to a specific network…

1990

In Peterson [1981], Peterson suggested a mutual exclusion algorithm. The algorithm, though simple in structure, seems quite…

1986

A design for a highly parallel data structure store for the prototype Manchester Dataflow Computer is presented. The main design…