Time, clocks, and the ordering of events in a distributed system

L Lamport - Concurrency: the Works of Leslie Lamport, 2019 - dl.acm.org
The concept of one event happening before another in a distributed system is examined,
and is shown to define a partial ordering of the events. A distributed algorithm is given for …

The Byzantine generals problem

L Lamport, R Shostak, M Pease - Concurrency: the works of leslie …, 2019 - dl.acm.org
Reliable computer systems must handle malfunctioning components that give conflicting
information to different parts of the system. This situation can be expressed abstractly in …

The part-time parliament

L Lamport - Concurrency: the Works of Leslie Lamport, 2019 - dl.acm.org
Recent archaeological discoveries on the island of Paxos reveal that the parliament
functioned despite the peripatetic propensity of its part-time legislators. The legislators …

Adding concurrency to smart contracts

T Dickerson, P Gazzillo, M Herlihy… - Proceedings of the ACM …, 2017 - dl.acm.org
Modern cryptocurrency systems, such as Ethereum, permit complex financial transactions
through scripts called smart contracts. These smart contracts are executed many, many …

A new solution of Dijkstra's concurrent programming problem

L Lamport - Concurrency: the works of leslie lamport, 2019 - dl.acm.org
Knuth [1], deBruijn [2], and Eisenberg and McGuire [3] have given solutions to a concurrent
programming problem originally proposed and solved by Dijkstra [4]. A simpler solution …

Kendo: efficient deterministic multithreading in software

M Olszewski, J Ansel, S Amarasinghe - Proceedings of the 14th …, 2009 - dl.acm.org
Although chip-multiprocessors have become the industry standard, developing parallel
applications that target them remains a daunting task. Non-determinism, inherent in …

A type and effect system for deterministic parallel Java

RL Bocchino Jr, VS Adve, D Dig, SV Adve… - Proceedings of the 24th …, 2009 - dl.acm.org
Today's shared-memory parallel programming models are complex and error-prone. While
many parallel programs are intended to be deterministic, unanticipated thread interleavings …

Swift/t: Large-scale application composition via distributed-memory dataflow processing

JM Wozniak, TG Armstrong, M Wilde… - 2013 13th IEEE/ACM …, 2013 - ieeexplore.ieee.org
Many scientific applications are conceptually built up from independent component tasks as
a parameter study, optimization, or other search. Large batches of these tasks may be …

Efficient system-enforced deterministic parallelism

A Aviram, SC Weng, S Hu, B Ford - Communications of the ACM, 2012 - dl.acm.org
Deterministic execution offers many benefits for debugging, fault tolerance, and security.
Current methods of executing parallel programs deterministically, however, often incur high …

Internally deterministic parallel algorithms can be fast

GE Blelloch, JT Fineman, PB Gibbons… - Proceedings of the 17th …, 2012 - dl.acm.org
The virtues of deterministic parallelism have been argued for decades and many forms of
deterministic parallelism have been described and analyzed. Here we are concerned with …