Recursion in Distributed Computing

The benefits of developing algorithms via recursion are well known. However, little use of recursion has been done in distributed algorithms, in spite of the fact that recursive structuring principles for distributed systems have been advocated since the beginning of the field. We present several distributed algorithms in a recursive form, which makes them easier to understand and analyze. Also, we expose several interesting issues arising in recursive distributed algorithms. Our goal is to promote the use and study of recursion in distributed algorithms.

[1]  Amaury Lambert,et al.  Proof(s) of the Lamperti representation of Continuous-State Branching Processes , 2008, 0802.2693.

[2]  Camino Balbuena,et al.  Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages , 2010, Discret. Math..

[3]  Maurice Herlihy,et al.  Subconsensus Tasks: Renaming Is Weaker Than Set Agreement , 2006, DISC.

[4]  Mexico.  On the asymptotic behaviour of increasing self-similar Markov processes , 2009 .

[5]  Eli Gafni,et al.  A simple algorithmically reasoned characterization of wait-free computation (extended abstract) , 1997, PODC '97.

[6]  Danny Dolev,et al.  Shifting gears: changing algorithms on the fly to expedite Byzantine agreement , 1987, PODC '87.

[7]  Jorge Alberto Achcar,et al.  Non-homogeneous Poisson models with a change-point: an application to ozone peaks in Mexico city , 2010, Environmental and Ecological Statistics.

[8]  Sergio Rajsbaum,et al.  New combinatorial topology bounds for renaming: The upper bound , 2012, JACM.

[9]  Michel Raynal,et al.  An impossibility about failure detectors in the iterated immediate snapshot model , 2008, Inf. Process. Lett..

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

[11]  Jos'e Luis P'erez Garmendia.  On Weighted Tempered Moving Averages Processes , 2008 .

[12]  Ivan Stojmenovic.  Recursive algorithms in computer science courses: Fibonacci numbers and binomial coefficients , 2000, IEEE Trans. Educ..

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

[14]  S. M. Voronin,et al.  On camacho-sad's theorem about the existence of a separatrix , 2010 .

[15]  Eli Gafni,et al.  Understanding and verifying distributed algorithms using stratified decomposition , 1988, PODC '88.

[16]  Hagit Attiya,et al.  Renaming in an asynchronous environment , 1990, JACM.

[17]  Eli Gafni,et al.  Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony , 1998, PODC '98.

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

[19]  Juan José Montellano-Ballesteros,et al.  Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes , 2012, Ars Comb..

[20]  Victor Hernandez-Urbina,et al.  Applying DNA computing to diagnose-and-interfere hepatic fibrosis , 2010, 2010 Sixth International Conference on Natural Computation.

[21]  Juan José Montellano-Ballesteros,et al.  Absorbent sets and kernels by monochromatic directed paths in m-colored tournaments , 2008, Australas. J Comb..

[22]  Michel Raynal,et al.  The Iterated Restricted Immediate Snapshot Model , 2008, COCOON.

[23]  Eli Gafni.  The 0-1-Exclusion Families of Tasks , 2008, OPODIS.

[24]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[25]  Eli Gafni,et al.  Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). , 1998, PODC 1998.

[26]  Danny Dolev,et al.  Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement , 1992, Inf. Comput..

[27]  Juan José Montellano-Ballesteros,et al.  On the Pseudoachromatic Index of the Complete Graph III , 2011, Graphs and Combinatorics.

[28]  Eli Gafni,et al.  The concurrency hierarchy, and algorithms for unbounded concurrency , 2001, PODC '01.

[29]  John E. Dobson,et al.  Building Reliable Secure Computing Systems out of Unreliable Insecure Components , 1986, IEEE Symposium on Security and Privacy.

[30]  Mika Olsen,et al.  Kernels by monochromatic paths in digraphs with covering number 2 , 2011, Discret. Math..

[31]  Piermarco Cannarsa,et al.  Controllability results for 1-d coupled degenerate parabolic equations , 2008 .

[32]  Hortensia Galeana-Sánchez,et al.  Directed hypergraphs: A tool for researching digraphs and hypergraphs , 2009, Discuss. Math. Graph Theory.

[33]  Sergio Rajsbaum,et al.  New combinatorial topology bounds for renaming: the lower bound , 2010, Distributed Computing.

[34]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

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

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

[37]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[38]  Brian Randell.  Recursively Structured Distributed Computing Systems , 1983, Symposium on Reliability in Distributed Software and Database Systems.

[39]  Brian A. Coan,et al.  Modular construction of an efficient 1-bit Byzantine agreement protocol , 2005, Mathematical systems theory.

[40]  H. Galeana-Sánchez,et al.  Independent domination by monochromatic paths in arc coloured bipartite tournaments , 2009 .

[41]  Sorin Micu,et al.  A spectral study of the boundary controllability of the linear 2-D wave equation in a rectangle , 2010, Asymptot. Anal..

[42]  Hortensia Galeana-Sánchez,et al.  Monochromatic paths and monochromatic sets of arcs in bipartite tournaments , 2009, Discuss. Math. Graph Theory.

[43]  S. M. Voronin,et al.  Extended Holonomy and Topological Invariance of Vanishing Holonomy Group , 2008 .

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

[45]  Eli Gafni,et al.  Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). , 1993, PODC 1993.

[46]  John E. Dobson,et al.  Introduction to "building reliable secure computing systems out of unreliable insecure components" , 2001, Seventeenth Annual Computer Security Applications Conference.

[47]  Hagit Attiya,et al.  Sharing memory robustly in message-passing systems , 1990, PODC '90.

[48]  Maurice Herlihy,et al.  The topology of shared-memory adversaries , 2010, PODC '10.

[49]  Sergio Rajsbaum,et al.  New combinatorial topology upper and lower bounds for renaming , 2008, PODC '08.

[50]  Jorge Alberto Achcar,et al.  Some non-homogeneous Poisson models with multiple change-points to study the behaviour of the number of ozone exceedances in Mexico City , 2007 .

[51]  Nissim Francez,et al.  Decomposition of Distributed Programs into Communication-Closed Layers , 1982, Sci. Comput. Program..

[52]  Hortensia Galeana-Sánchez,et al.  On the structure of strong 3-quasi-transitive digraphs , 2010, Discret. Math..

[53]  Hortensia Galeana-Sánchez,et al.  A classification of arc-locally semicomplete digraphs , 2009, Electron. Notes Discret. Math..

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

[55]  Hortensia Galeana-Sánchez,et al.  Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs , 2009, Discuss. Math. Graph Theory.

[56]  Eli Gafni,et al.  Immediate atomic snapshots and fast renaming , 1993, PODC '93.

[57]  Nancy A. Lynch,et al.  The BG distributed simulation algorithm , 2001, Distributed Computing.

[58]  Enrique Zuazua,et al.  Identification of the class of initial data for the insensitizing control of the heat equation , 2008 .

[59]  Jorge Alberto Achcar,et al.  Analysing weekly ozone averages in Mexico City using stochastic volatility models , 2007 .

[60]  Hortensia Galeana-Sánchez,et al.  Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs , 2010, Discuss. Math. Graph Theory.