Geometric and combinatorial views on asynchronous computability

We show that the protocol complex formalization of fault-tolerant protocols can be directly derived from a suitable semantics of the underlying synchronization and communication primitives, based on a geometrization of the state space. By constructing a one-to-one relationship between simplices of the protocol complex and (di)homotopy classes of (di)paths in the latter semantics, we describe a connection between these two geometric approaches to distributed computing: protocol complexes and directed algebraic topology. This is exemplified on atomic snapshot, iterated snapshot and layered immediate snapshot protocols, where a well-known combinatorial structure, interval orders, plays a key role. We believe that this correspondence between models will extend to proving impossibility results for much more intricate fault-tolerant distributed architectures.

[1]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[2]  Michel Raynal,et al.  Specifying Concurrent Problems: Beyond Linearizability and up to Tasks - (Extended Abstract) , 2015, DISC.

[3]  Eric Goubault,et al.  Homology of Higher Dimensional Automata , 1992, CONCUR.

[4]  M. Grandis.  Directed Algebraic Topology: Models of Non-Reversible Worlds , 2009 .

[5]  Eric Goubault.  Domains of Higher-Dimensional Automata , 1993, CONCUR.

[6]  Eric Goubault,et al.  Rigorous Evidence of Freedom from Concurrency Faults in Industrial Control Software , 2011, SAFECOMP.

[7]  Eric Goubault,et al.  Trace Spaces: An Efficient New Technique for State-Space Reduction , 2012, ESOP.

[8]  Lisbeth Fajstrup,et al.  Detecting Deadlocks in Concurrent Systems , 1996 .

[9]  Eric Goubault,et al.  A Geometric View of Partial Order Reduction , 2013, MFPS.

[10]  Sergio Rajsbaum,et al.  The Read/Write Protocol Complex Is Collapsible , 2016, LATIN.

[11]  Dmitry N. Kozlov,et al.  Topology of the view complex , 2013, ArXiv.

[12]  James H. Anderson,et al.  Composite registers , 1990, PODC '90.

[13]  Eli Gafni,et al.  Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[14]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[15]  Eric Goubault,et al.  SOME GEOMETRIC PERSPECTIVES IN CONCURRENCY THEORY , 2003 .

[16]  Dmitry N. Kozlov,et al.  Chromatic subdivision of a simplicial complex , 2012 .

[17]  L. Nachbin.  Topology and order , 1965 .

[18]  Eric Goubault,et al.  Directed Algebraic Topology and Concurrency , 2016, Cambridge International Law Journal.

[19]  Maurice Herlihy,et al.  Distributed Computing Through Combinatorial Topology , 2013 .

[20]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[21]  Nir Shavit,et al.  Atomic snapshots of shared memory , 1990, JACM.

[22]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[23]  Jeremy Gunawardena,et al.  Homotopy and Concurrency , 2001, Bull. EATCS.

[24]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[25]  Eric Goubault,et al.  Iterated Chromatic Subdivisions are Collapsible , 2015, Appl. Categorical Struct..

[26]  K. Hofmann,et al.  A Compendium of Continuous Lattices , 1980 .

[27]  Vaughan R. Pratt,et al.  Modeling concurrency with geometry , 1991, POPL '91.

[28]  Eli Gafni.  Snapshot for Time: The One-Shot Case , 2014, ArXiv.

[29]  Shmuel Zaks,et al.  A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor , 1988, PODC '88.

[30]  P. Fishburn.  Intransitive indifference with unequal indifference intervals , 1970 .

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

[32]  Maurice Herlihy,et al.  The asynchronous computability theorem for t-resilient tasks , 1993, STOC.

[33]  Eric Goubault,et al.  Algebraic topology and concurrency , 2006, Theor. Comput. Sci..

[34]  Eric Goubault,et al.  A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs , 2005, CONCUR.