How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
By Leslie Lamport. IEEE transactions on computers, 2016
2,815 citations recorded by the source corpus.
Many large sequential computers execute operations in a different order than is specified by the program. A correct execution is achieved if the results produced are the same as would be produced by executing the program steps in order. For a multiprocessor computer, such a correct execution by each processor does not guarantee the correct execution of the entire program. Additional conditions are given which do guarantee that a computer correctly executes multiprocess programs.
Subfields: Computer Networks and Communications, Hardware and Architecture
View Paper: https://www.semanticscholar.org/paper/bdacc240ee817e6565f27f40f8658c037a457a13
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Hardware and Architecture
- Håkan Grahn
- T. Harris
- J. Larus
- Ravi Rajwar
- Keir Fraser
- Nir Shavit
- Armando Solar-Lezama
- Rastislav Bodík
Citations in the corpus
- Sourcebook of parallel computing (2003, background): “Weaker forms of consistency would not be needed, and Lamport’s title [590] would reflect real machines.”
- Flat combining and the synchronization-parallelism tradeoff (2010, background): “The log-synchronization technique, however, is only sequentially consistent [13], not linearizable, and is limited to data structures to which effective prediction can be applied.”
- Plutus: Scalable Secure File Sharing on Untrusted Storage (2003, positive): “In the state machine approach [ 26 , 44], clients read and write data to each replica.”
- Transactional Memory, 2nd edition (2010, background): “One way to define TM is to build on the idea of how sequential consistency (SC) provides an ideal semantics for ordinary shared memory [187].”
- Program synthesis by sketching (2008, background): “The queue benchmarks were resolved with respect to the conjunction of the following correctness conditions: • Sequential consistency of each individual operation [44].”
- X10: an object-oriented approach to non-uniform cluster computing (2005, background): “Within a place, activities operate on memory in a sequentially consistent fashion [38], that is, the implementation ensures that each activity reads and writes a location in one indivisible step, without interference with any other activity.”
- The Java memory model (2005, background): “The model that is easiest to understand, sequential consistency [26], specifies that memory actions must appear to execute one at a time in a single total order; actions of a given thread must appear in this total order in the same order in which they appear in the program (called program order).”