M. Herlihy, S. Rajsbaum. Algebraic topology and distributed computing. A primer. Computer Science Today: Recent Trends and Developments, LNCS 1000, pp. 203-- 217, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Investigation of Concurrent Processes By Means of Homotopy.. - Sokolowski (1999) (2 citations) (Correct)
....and Rajsbaum [9] have used chain homotopies and acyclic carrier theorem to derive some lower bounds and impossibility results for distributed computing. Hoest and Shavit [12] have studied asynchronous complexity by the way of chromatic subdivisions of complexes. Tutorial papers in this area are [10] by Herlihy and Rajsbaum, and [8] by Herlihy. In another line of research, Gunawardena [7] has given an intuitively appealing proof, based on investigations of homotopy properties of certain simple topological spaces, that two phase locking is safe an important theorem on database ....
....The situation is better in homologies, since their group structure is derived from combinatorial properties of respective simplicial complexes rather than from process executions. Homology groups for task solvability problems are therefore defined (Herlihy and Shavit [11] Herlihy and Rajsbaum [10], Herlihy [8] Goubault and Jensen [6] etc. But still, in most considerations important for computer science, either the conclusions are drawn from the combinatorial arguments that precede the construction of these groups, or the homologies are used only marginally, the only issue of importance ....
M. Herlihy, S. Rajsbaum. Algebraic topology and distributed computing. A primer. Computer Science Today: Recent Trends and Developments, LNCS 1000, pp. 203-- 217, 1995.
Homotopy in Concurrent Processes - Sokolowski (1998) (3 citations) (Correct)
....and Rajsbaum [6] have used chain homotopies and acyclic carrier theorem to derive some lower bounds and impossibility results for distributed computing. Hoest and Shavit [9] have studied asynchronous complexity by the way of chromatic subdivisions of complexes. Tutorial papers in this area are [7] by Herlihy and Rajsbaum, and [5] by Herlihy. In another line of research, Gunawardena [4] has given an intuitively appealing proof, based on investigations of homotopy properties of certain simple topological spaces, that two phase locking is safe an important theorem on database ....
M. Herlihy, S. Rajsbaum. Algebraic topology and distributed computing. A primer. Computer Science Today: Recent Trends and Developments, LNCS 1000, pp. 203-- 217, 1995.
Investigation of Concurrent Processes By Means of Homotopy.. - Sokolowski (1998) (2 citations) (Correct)
....and Rajsbaum [6] have used chain homotopies and acyclic carrier theorem to derive some lower bounds and impossibility results for distributed computing. Hoest and Shavit [9] have studied asynchronous complexity by the way of chromatic subdivisions of complexes. Tutorial papers in this area are [7] by Herlihy and Rajsbaum, and [5] by Herlihy. In another line of research, Gunawardena [4] has given an intuitively appealing proof, based on investigations of homotopy properties of certain simple topological spaces, that two phase locking is safe an important theorem on database ....
....The situation is better in homologies, since their group structure is derived from combinatorial properties of respective simplicial complexes rather than from process executions. Homology groups for task solvability problems are therefore defined (Herlihy and Shavit [8] Herlihy and Rajsbaum [7], Herlihy [5] Goubault and Jensen [3] etc. But still, in most considerations important for computer science, either the conclusions are drawn from the combinatorial arguments that precede the construction of these groups, or the homologies are used only marginally, the only issue of importance ....
M. Herlihy, S. Rajsbaum. Algebraic topology and distributed computing. A primer. Computer Science Today: Recent Trends and Developments, LNCS 1000, pp. 203-- 217, 1995.
Implementing the Recursive Definition of Abelian Group-Based.. - Giavitto, Michel (Correct)
....structure to the computation dependencies: they can be interpreted as paths in well handled spaces. Another direction of work is then the use of tools from algebraic topology to characterize the domain of computation (homotopy theory, etc. Such mathematical tools have already be proved useful [19, 43, 22]. Acknowledgments. We are grateful to the members of the Parallel Architectures team in LRI for many fruitful discussions, and we thank especially Jean Paul Sansonnet, Julien Soula (who has developed the Mathematica package for abelian fields) and Dominique De Vito (who implements currently the ....
Herlihy, M., and Rajsbaum, S. Computer Science Today - Recent Trends and Developments. No. 1000 in Lecture Notes in Computer Sciences. Springer-Verlag, 1995, ch. Algebraic Topology and Distributed Computing: A Primer, pp. 203-- 217.
Design and Implementation of 8½, a Declarative.. - Michel (1995) (Correct)
....to the computation dependencies: they can be interpreted as paths in well handled spaces. Another direction of work is then the use of tools from algebraic topology to characterise the domain of computation (homotopy theory, etc. Such mathematical tools have already be proved useful [GJ92, SK94, HR95] Acknowledgments. The author wishes to thank the member of the 81 2 team: Jean Louis Giavitto, Jean Paul Sansonnet, Dominique De Vito, Abderrahmane Mahiout for many stimulating discussions. He also thanks Dan Truong, Laurence Cathala for their constructive comments. ....
M. Herlihy and S. Rajsbaum. Computer Science Today - Recent Trends and Developments, chapter Algebraic Topology and Distributed Computing: A Primer, pages 203--217. Number 1000 in Lecture Notes in Computer Sciences. Springer-Verlag, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC