Highly-Efficient Wait-Free Synchronization

Fatourou, Panagiota; Kallimanis, Nikolaos D.

doi:10.1007/s00224-013-9491-y

Cited by 31 publications

(54 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Synch framework has been extensively used for implementing and evaluating concurrent data-structures and synchronization techniques in papers, such as Fatourou & Kallimanis (2011), Fatourou & Kallimanis (2012, Agathos et al (2012), Fatourou & Kallimanis (2014, .…”

Section: Statement Of Needmentioning

confidence: 99%

“…stacks, queues, atomic counters, barriers. The Synch framework provides the PSim wait-free combining object (Fatourou & Kallimanis, 2011;Fatourou & Kallimanis, 2014), the blocking combining objects CC-Synch, DSM-Synch and H-Synch (Fatourou & Kallimanis, 2012), and the blocking combining object based on the technique presented in (Oyama et al, 1999). Moreover, the Synch framework provides the Osci blocking, combining technique ) that achieves good performance using user-level threads.…”

Section: Provided Concurrent Data-structuresmentioning

confidence: 99%

“…In terms of concurrent queues, the Synch framework provides the SimQueue (Fatourou & Kallimanis, 2011;Fatourou & Kallimanis, 2014) wait-free queue implementation that is based on the PSim combining object, and the CC-Queue, DSM-Queue and H-Queue (Fatourou & Kallimanis, 2012) blocking queue implementations based on the CC-Synch, DSM-Synch and H-Synch combining objects. A blocking queue implementation based on the CLH locks (Craig, 1993;Magnusson et al, 1994) and the lock-free implementation presented in Michael & Scott (1996) are also provided.…”

Section: Provided Concurrent Data-structuresmentioning

confidence: 99%

See 2 more Smart Citations

Synch: A framework for concurrent data-structures and benchmarks

Kallimanis¹

2021

JOSS

View full text Add to dashboard Cite

Section: Statement Of Needmentioning

confidence: 99%

Section: Provided Concurrent Data-structuresmentioning

confidence: 99%

Section: Provided Concurrent Data-structuresmentioning

confidence: 99%

See 1 more Smart Citation

Synch: A framework for concurrent data-structures and benchmarks

Kallimanis¹

2021

JOSS

View full text Add to dashboard Cite

“…A direct universal construction Algorithm 7 (based on an algorithm introduced in [32], simplified in [80]) is a direct universal construction (does not use an intermediate layer of TO-broadcast) of an object O with transition function δ, for n processes.…”

Section: Failsmentioning

confidence: 99%

60 Years of Mastering Concurrent Computing through Sequential Thinking

Rajsbaum¹,

Raynal

2020

SIGACT News

View full text Add to dashboard Cite

Modern computing systems are highly concurrent. Threads run concurrently in shared-memory multi-core systems, and programs run in different servers communicating by sending messages to each other. Concurrent programming is hard because it requires to cope with many possible, unpredictable behaviors of the processes, and the communication media. The article argues that right from the start in 1960's, the main way of dealing with concurrency has been by reduction to sequential reasoning. It traces this history, and illustrates it through several examples, from early ideas based on mutual exclusion (which was initially introduced to access shared physical resources), passing through consensus and concurrent objects (which are immaterial data), until today distributed ledgers. A discussion is also presented, which addresses the limits that this approach encounters, related to fault-tolerance, performance, and inherently concurrent problems.

show abstract

“…A direct universal construction Algorithm 7 (based on an algorithm introduced in [21], simplified in [60]) is a direct universal construction (does not use an intermediate layer of TO-broadcast) of an object O with transition function δ, for n processes.…”

Section: When Are Universal Constructions Possible?mentioning

confidence: 99%

Mastering concurrent computing through sequential thinking

Rajsbaum

Raynal

2019

Commun. ACM

View full text Add to dashboard Cite

Concurrency, the art of doing many things at the same time is slowly becoming a science. It is very difficult to master, yet it arises all over modern computing systems, both when the communication medium is shared memory and when it is by message passing. Concurrent programming is hard because it requires to cope with many possible, unpredictable behaviors of communicating processes interacting with each other. Right from the start in the 1960s, the main way of dealing with concurrency has been by reduction to sequential reasoning. We trace this history, and illustrate it through several examples, from early ideas based on mutual exclusion, passing through consensus and concurrent objects, until today ledgers and blockchains. We conclude with a discussion on the limits that this approach encounters, related to fault-tolerance, performance, and inherently concurrent problems..

show abstract

Highly-Efficient Wait-Free Synchronization

Cited by 31 publications

References 13 publications

Synch: A framework for concurrent data-structures and benchmarks

Synch: A framework for concurrent data-structures and benchmarks

60 Years of Mastering Concurrent Computing through Sequential Thinking

Mastering concurrent computing through sequential thinking

Contact Info

Product

Resources

About