Robust Concurrent Computing

[1]  C. A. R. Hoare,et al.  Monitors: an operating system structuring concept , 1974, CACM.

[2]  Jennifer L. Welch,et al.  Bounds on the Costs of Multivalued Register Implementations , 1994, SIAM J. Comput..

[3]  Prasad Jayanti,et al.  Almost Optimal Single Reader, Single Writer Atomic Register , 2000, J. Parallel Distributed Comput..

[4]  Paul M. B. Vitányi.  Simple Wait-Free Multireader Registers , 2002, DISC.

[5]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[6]  Ambuj K. Singh,et al.  The elusive atomic register , 1994, JACM.

[7]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

[8]  Ming Li,et al.  How to share concurrent wait-free variables , 1996, JACM.

[9]  Yehuda Afek,et al.  A completeness theorem for a class of synchronization objects , 1993, PODC '93.

[10]  Jennifer L. Welch,et al.  One-write algorithms for multivalued regular and atomic registers , 2000, Acta Informatica.

[11]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[12]  Atomic snapshots of shared memory , 1993, JACM.

[13]  Guy Louchard,et al.  Using Auxiliary Variables in Parallel Programs Verification , 1977, International Computing Symposium.

[14]  On the space complexity of randomized synchronization , 1998, JACM.

[15]  Maurice Herlihy,et al.  The art of multiprocessor programming , 2020, PODC '06.

[16]  Krishnamurthy Vidyasankar,et al.  Constructing 1-writer multireader multivalued atomic variables from regular variables , 1995, JACM.

[17]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[18]  Krishnamurthy Vidyasankar.  A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable , 1991, Inf. Process. Lett..

[19]  Baruch Awerbuch,et al.  Atomic shared register access by asynchronous hardware , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[20]  Krishnamurthy Vidyasankar.  Converting Lamport's Regular Register to Atomic Register , 1988, Inf. Process. Lett..

[21]  Maurice Herlihy,et al.  Obstruction-free synchronization: double-ended queues as an example , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[22]  Gadi Taubenfeld.  Synchronization Algorithms and Concurrent Programming , 2006 .

[23]  Krishnamurthy Vidyasankar,et al.  An Elegant 1-Writer Multireader Multivalued Atomic Register , 1989, Inf. Process. Lett..

[24]  Mark Moir,et al.  Obstruction-Free Algorithms Can Be Practically Wait-Free , 2005, DISC.

[25]  Michel Raynal.  Token-based sequential consistency , 2002, Comput. Syst. Sci. Eng..

[26]  Rachid Guerraoui,et al.  Computing with Reads and Writes in the Absence of Step Contention , 2005, DISC.

[27]  David Lorge Parnas,et al.  A technique for software module specification with examples , 1972, CACM.

[28]  Hagit Attiya,et al.  Sequential consistency versus linearizability , 1994, TOCS.

[29]  D. L. Parnas,et al.  On the criteria to be used in decomposing systems into modules , 1972, Software Pioneers.

[30]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

[31]  Jayadev Misra.  Axioms for memory access in asynchronous hardware systems , 1986, TOPL.

[32]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[33]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

[34]  Edsger W. Dijkstra,et al.  Structured programming , 1972, A.P.I.C. Studies in data processing.

[35]  Christos H. Papadimitriou,et al.  The Theory of Database Concurrency Control , 1986 .

[36]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[37]  Sam Toueg,et al.  Fault-tolerant wait-free shared objects , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[38]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

[39]  Stephen N. Zilles,et al.  Specification techniques for data abstractions , 1975 .

[40]  Per Brinch Hansen.  The Origin of Concurrent Programming , 2002, Springer New York.

[41]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[42]  Gary L. Peterson,et al.  Concurrent Reading While Writing , 1983, TOPL.

[43]  Yehuda Afek,et al.  Lazy caching , 1993, TOPL.

[44]  Michel Raynal,et al.  Sequential consistency as lazy linearizability , 2002, SPAA '02.

[45]  Michel Raynal,et al.  Algorithms for mutual exclusion , 1986 .

[46]  Gary L. Peterson,et al.  Constructing multi-reader atomic values from non-atomic values , 1987, PODC '87.

[47]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[48]  Leslie Lamport,et al.  Concurrent reading and writing , 1977, Commun. ACM.

[49]  Bard Bloom.  Constructing Two-Writer Atomic Registers , 1988, IEEE Trans. Computers.

[50]  Anthony S. Wojcik.  Afips Conference Proceedings , 1985 .