Abstract
No abstract available.
Cited By
- Pandurangan G, Robinson P and Scquizzato M (2019). A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees, ACM Transactions on Algorithms, 16:1, (1-27), Online publication date: 31-Jan-2020.
- Pandurangan G, Robinson P and Scquizzato M A time- and message-optimal distributed algorithm for minimum spanning trees Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, (743-756)
- Gafni E and Malkhi D Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution Proceedings of the 29th International Symposium on Distributed Computing - Volume 9363, (140-153)
- Ma Z (2015). Towards computational models of animal communications, an introduction for computer scientists, Cognitive Systems Research, 33:C, (70-99), Online publication date: 1-Mar-2015.
- Alistarh D, Aspnes J, Censor-Hillel K, Gilbert S and Guerraoui R (2014). Tight Bounds for Asynchronous Renaming, Journal of the ACM, 61:3, (1-51), Online publication date: 1-May-2014.
- Delporte-Gallet C, Fauconnier H, Gafni E and Lamport L Adaptive Register Allocation with a Linear Number of Registers Proceedings of the 27th International Symposium on Distributed Computing - Volume 8205, (269-283)
- Maurer A and Tixeuil S On byzantine broadcast in loosely connected networks Proceedings of the 26th international conference on Distributed Computing, (253-266)
- Castañeda A and Rajsbaum S (2012). New combinatorial topology bounds for renaming, Journal of the ACM, 59:1, (1-49), Online publication date: 1-Feb-2012.
- Attiya H and Castañeda A A non-topological proof for the impossibility of k-set agreement Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems, (108-119)
- Dobre D, Guerraoui R, Majuntke M, Suri N and Vukolić M The complexity of robust atomic storage Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (59-68)
- Hong G and Srimani P A self-stabilizing algorithm for two disjoint minimal dominating sets in an arbitrary graph Proceedings of the 49th Annual Southeast Regional Conference, (306-307)
- Junqueira F, Marzullo K, Herlihy M and Penso L (2010). Threshold protocols in survivor set systems, Distributed Computing, 23:2, (135-149), Online publication date: 1-Oct-2010.
- Friedman R, Kliot G and Avin C (2008). Probabilistic quorum systems in wireless Ad Hoc networks, ACM Transactions on Computer Systems (TOCS), 28:3, (1-50), Online publication date: 1-Sep-2010.
- Okun M (2010). Strong order-preserving renaming in the synchronous message passing model, Theoretical Computer Science, 411:40-42, (3787-3794), Online publication date: 1-Sep-2010.
- Castañeda A and Rajsbaum S (2010). New combinatorial topology bounds for renaming, Distributed Computing, 22:5-6, (287-301), Online publication date: 1-Aug-2010.
- Delporte-Gallet C, Fauconnier H and Guerraoui R (2010). Tight failure detection bounds on atomic object implementations, Journal of the ACM (JACM), 57:4, (1-32), Online publication date: 1-Apr-2010.
- Juan Marín R, Cholvi V, Jiménez E and Muñoz-Escoí F Parallel Interconnection of Broadcast Systems with Multiple FIFO Channels Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I, (449-466)
- Vojdani M and Taj Y DR Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing, (90-99)
- Attiya H and Censor K Lower bounds for randomized consensus under a weak adversary Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (315-324)
- Castañeda A and Rajsbaum S New combinatorial topology upper and lower bounds for renaming Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (295-304)
- Delporte-Gallet C, Fauconnier H and Guerraoui R Sharing is harder than agreeing Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (85-94)
- Wang X, Teo Y and Cao J (2008). Message and time efficient consensus protocols for synchronous distributed systems, Journal of Parallel and Distributed Computing, 68:5, (641-654), Online publication date: 1-May-2008.
- Guerraoui R, Levy R, Pochon B and Pugh J (2008). The collective memory of amnesic processes, ACM Transactions on Algorithms, 4:1, (1-31), Online publication date: 1-Mar-2008.
- Dinitz Y, Moran S and Rajsbaum S (2008). Bit complexity of breaking and achieving symmetry in chains and rings, Journal of the ACM, 55:1, (1-28), Online publication date: 1-Feb-2008.
- Vaidya N and Das S (2008). RFID-based networks, ACM SIGMOBILE Mobile Computing and Communications Review, 12:1, (2-14), Online publication date: 1-Jan-2008.
- Gramoli V and Raynal M Timed quorum systems for large-scale and dynamic environments Proceedings of the 11th international conference on Principles of distributed systems, (429-442)
- Gramoli V and Raynal M Timed Quorum Systems for Large-Scale and Dynamic Environments Principles of Distributed Systems, (429-442)
- Viswanathan S, Veeravalli B and Robertazzi T (2007). Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems, IEEE Transactions on Parallel and Distributed Systems, 18:10, (1450-1461), Online publication date: 1-Oct-2007.
- Guerraoui R and Raynal M From unreliable objects to reliable objects Proceedings of the 9th international conference on Parallel Computing Technologies, (47-61)
- Hamid B, Le Saëc B and Mosbah M Distributed local 2-connectivity test of graphs and applications Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications, (195-207)
- Chalopin J, Godard E, Métivier Y and Ossamy R Mobile agent algorithms versus message passing algorithms Proceedings of the 10th international conference on Principles of Distributed Systems, (187-201)
- Beauquier J, Delaët, S and Haddad S A 1-strong self-stabilizing transformer Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems, (95-109)
- Chalopin J, Métivier Y and Zielonka W (2019). Local Computations in Graphs: The Case of Cellular Edge Local Computations, Fundamenta Informaticae, 74:1, (85-114), Online publication date: 31-Oct-2006.
- Okun M and Barak A Renaming in message passing systems with byzantine failures Proceedings of the 20th international conference on Distributed Computing, (16-30)
- Keidar I and Shraer A Timeliness, failure-detectors, and consensus performance Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, (169-178)
- Nesterenko M and Tixeuil S Discovering network topology in the presence of byzantine faults Proceedings of the 13th international conference on Structural Information and Communication Complexity, (212-226)
- Beauquier J, Delaët S and Haddad S Necessary and sufficient conditions for 1-adaptivity Proceedings of the 20th international conference on Parallel and distributed processing, (96-96)
- Higham L and Johnen C Relationships between communication models in networks using atomic registers Proceedings of the 20th international conference on Parallel and distributed processing, (92-92)
- Gafni E, Rajsbaum S, Raynal M and Travers C The committee decision problem Proceedings of the 7th Latin American conference on Theoretical Informatics, (502-514)
- Chalopin J, Métivier Y and Zielonka W (2006). Local Computations in Graphs: The Case of Cellular Edge Local Computations, Fundamenta Informaticae, 74:1, (85-114), Online publication date: 1-Jan-2006.
- Cohen R, Fraigniaud P, Ilcinkas D, Korman A and Peleg D Labeling schemes for tree representation Proceedings of the 7th international conference on Distributed Computing, (13-24)
- Chockler G, Lynch N, Mitra S and Tauber J Proving atomicity Proceedings of the 19th international conference on Distributed Computing, (152-168)
- Parvedy P, Raynal M and Travers C Early-stopping k-set agreement in synchronous systems prone to any number of process crashes Proceedings of the 8th international conference on Parallel Computing Technologies, (49-58)
- Dinitz Y and Solomon N Two absolute bounds for distributed bit complexity Proceedings of the 12th international conference on Structural Information and Communication Complexity, (115-126)
- Reynal M (2005). A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, 36:1, (53-70), Online publication date: 1-Mar-2005.
- Ioannidou K (2018). Transformations of self-stabilizing algorithms, Journal of High Speed Networks, 14:1, (85-105), Online publication date: 1-Jan-2005.
- Cachin C and Strobl R Asynchronous group key exchange with failures Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, (357-366)
- Delporte-Gallet C, Fauconnier H, Guerraoui R, Hadzilacos V, Kouznetsov P and Toueg S The weakest failure detectors to solve certain fundamental problems in distributed computing Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, (338-346)
- Dutta P, Guerraoui R, Levy R and Chakraborty A How fast can a distributed atomic read be? Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, (236-245)
- Nichitiu C, Papazian C and Rémila E (2019). Leader election in plane cellular automata, only with left-right global convention, Theoretical Computer Science, 319:1-3, (367-384), Online publication date: 10-Jun-2004.
- Teo Y and Onggo B Formalization and strictness of simulation event orderings Proceedings of the eighteenth workshop on Parallel and distributed simulation, (89-96)
- Guerraoui R and Raynal M (2004). The Information Structure of Indulgent Consensus, IEEE Transactions on Computers, 53:4, (453-466), Online publication date: 1-Apr-2004.
- Mostefaoui A, Rajsbaum S and Raynal M (2003). Conditions on input vectors for consensus solvability in asynchronous distributed systems, Journal of the ACM (JACM), 50:6, (922-954), Online publication date: 1-Nov-2003.
- Fich F and Ruppert E (2003). Hundreds of impossibility results for distributed computing, Distributed Computing, 16:2-3, (121-163), Online publication date: 1-Sep-2003.
- Aspnes J (2003). Randomized protocols for asynchronous consensus, Distributed Computing, 16:2-3, (165-175), Online publication date: 1-Sep-2003.
- Dolev S and Rajsbaum S (2019). Stability of long-lived consensus, Journal of Computer and System Sciences, 67:1, (26-45), Online publication date: 1-Aug-2003.
- Takamura M and Igarashi Y Group mutual exclusion algorithms based on ticket orders Proceedings of the 9th annual international conference on Computing and combinatorics, (232-241)
- Fatourou P, Fich F and Ruppert E A tight time lower bound for space-optimal implementations of multi-writer snapshots Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (259-268)
- Junqueira F and Marzullo K Synchronous Consensus for Dependent Process Failures Proceedings of the 23rd International Conference on Distributed Computing Systems
- Dinitz Y, Moran S and Rajsbaum S (2018). Exact communication costs for consensus and leader in a tree, Journal of Discrete Algorithms, 1:2, (167-183), Online publication date: 1-Apr-2003.
- Friedman R, Mostéfaoui A, Rajsbaum S and Raynal M Using error-correcting codes to solve distributed agreement problems Future directions in distributed computing, (17-21)
- Greenwald M Two-handed emulation Proceedings of the twenty-first annual symposium on Principles of distributed computing, (260-269)
- Fatourou P, Fich F and Ruppert E Space-optimal multi-writer snapshot objects are slow Proceedings of the twenty-first annual symposium on Principles of distributed computing, (13-20)
- Peleg D (2019). Local majorities, coalitions and monopolies in graphs, Theoretical Computer Science, 282:2, (231-257), Online publication date: 10-Jun-2002.
- Spielmann M, Tyszkiewicz J and Van den Bussche J Distributed computation of web queries using automata Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (97-108)
- Pascoe J, Loader R and Sunderam V (2019). Collaborative Group Membership, The Journal of Supercomputing, 22:1, (55-68), Online publication date: 1-May-2002.
- Mostefaoui A, Mourgaya E and Raynal M (2018). An introduction to oracles for asynchronous distributed systems, Future Generation Computer Systems, 18:6, (757-767), Online publication date: 1-May-2002.
- Abraham U, Dolev S, Herman T and Koll I (2001). Self-stabilizing l-exclusion, Theoretical Computer Science, 266:1-2, (653-692), Online publication date: 6-Sep-2001.
- Mostefaoui A, Rajsbaum S, Raynal M and Roy M A hierarchy of conditions for consensus solvability Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, (151-160)
- Mostefaoui A, Rajsbaum S and Raynal M Conditions on input vectors for consensus solvability in asynchronous distributed systems Proceedings of the thirty-third annual ACM symposium on Theory of computing, (153-162)
- Herman T (2000). Phase Clocks for Transient Fault Repair, IEEE Transactions on Parallel and Distributed Systems, 11:10, (1048-1057), Online publication date: 1-Oct-2000.
- Malpani N, Welch J and Vaidya N Leader election algorithms for mobile ad hoc networks Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, (96-103)
- Dolev S and Rajsbaum S Stability of long-lived consensus (extended abstract) Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, (309-318)
- Barak B, Herzberg A, Naor D and Shai E The proactive security toolkit and applications Proceedings of the 6th ACM conference on Computer and communications security, (18-27)
- Dinitz Y, Moran S and Rajsbaum S Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (265-274)
Index Terms
- Distributed computing: fundamentals, simulations and advanced topics
Recommendations
Distributed Cloud Computing: Applications, Status Quo, and Challenges
A distributed cloud connecting multiple, geographically distributed and smaller datacenters, can be an attractive alternative to today's massive, centralized datacenters. A distributed cloud can reduce communication overheads, costs, and latencies by o ...