MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Hugues Fauconnier" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 13 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Fault-Tolerant Genuine Atomic Multicast  
  • by Carole Delporte-Gallet, Hugues Fauconnier — 2000 — In Proceedings of the 4th International Conference on Principles of Distributed Computing
  • …We present a very simple fault-tolerant atomic multicast algorithm. We suppose that we have disjoint process groups such that in each group we can realize the consensus. It is the case, for example, if, in each group, there is a majority of correct processes and if we dispose of a failure detecto…
  • Add To MetaCart
  • When birds die: Making population protocols fault-tolerant  
  • by Carole Delporte-gallet, Hugues Fauconnier, Rachid Guerraoui — 2006 — In Proc. 2nd IEEE International Conference on Distributed Computing in Sensor Systems, volume 4026 of LNCS
  • …At vobis male sit, malae tenebrae Orci, quae omnia bella devoratis: tam bellum mihi passerem abstulistis. [6] Abstract. In the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise …
  • Cited by 5 (2 self) – Add To MetaCart
  • Fault-Tolerant Genuine Atomic Multicast To Multiple Groups  
  • by Carole Delporte-Gallet, Hugues Fauconnier — 2000 — In Proceedings of the 4th International Conference on Principles of Distributed Computing
  • …We present a simple fault-tolerant algorithm that ensures total order delivery of messages sent to multiple groups of processes. It is based on one underlying block, namely, uniform consensus. Our algorithm is a multiple group "genuine and local " multicast algorithm in the sense that any proce…
  • Cited by 1 (0 self) – Add To MetaCart
  • almost) all objects are universal in message passing systems  
  • by Carole Delporte-gallet, Hugues Fauconnier, Rachid Guerraoui — 2005 — In International Symposium on Distributed Computing
  • …Abstract. This paper shows that all shared atomic object types that can solve consensus among k>1 processes have the same weakest failure detector in a message passing system with process crash failures. In such a system, object types such as test-and-set, fetch-and-add, andqueue, known to have weak…
  • Cited by 1 (1 self) – Add To MetaCart
  • From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors  
  • by Carole Delporte-gallet, Hugues Fauconnier, Felix Freiling, Lucia Draque, Andreas Tielmann
  • …Abstract. This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms, failure detectors, and problem specifications, one of which is weakest failure detector preserving. We prove that our tr…
  • Add To MetaCart
  • Revisiting failure detection and consensus in omission failure environments  
  • by Carole Delporte-gallet, Hugues Fauconnier, Felix C. Freiling — 2005 — In Proceedings of the International Colloquium on Theoretical Aspects of Computing (ICTAC05), Hanoi
  • …Abstract. It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensus. The reduction uses the concept of security modules which reduce the type and nature of adversarial behavior…
  • Cited by 5 (5 self) – Add To MetaCart
  • Mutual Exclusion in Asynchronous Systems with Failure Detectors  
  • by Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Petr Kouznetsov — 2002 — J. Parallel Distrib. Comput
  • …This paper defines the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem. This failure detector, which we call the trusting failure detector, and which we denote by , is strictly weaker than the pe…
  • Cited by 6 (1 self) – Add To MetaCart
  • Shared Memory vs Message Passing  
  • by Carole Delporte-Gallet Hugues, Hugues Fauconnier, Rachid Guerraoui — 2003
  • …This paper determines the computational strength of the shared memory abstraction (a register) emulated over a message passing system, and compares it with fundamental message passing abstractions like consensus and various forms of reliable broadcast.…
  • Add To MetaCart
  • Thrifty Generic Broadcast  
  • by Marcos Kawazoe Aguilera, Carole Delporte-gallet, Hugues Fauconnier, Sam Toueg — 2000 — In Proceedings of the 14th International Symposium on Distributed Computing (DISC’2000
  • …. We consider the problem of generic broadcast in asynchronous systems with crashes, a problem that was first studied in [12]. Roughly speaking, given a "conflict" relation on the set of messages, generic broadcast ensures that anytwo messages that conflict are delivered in the same order# messa…
  • Cited by 19 (1 self) – Add To MetaCart
  • Stable leader election (extended abstract  
  • by Marcos K. Aguilera, Carole Delporte-gallet, Hugues Fauconnier, Sam Toueg — 2001 — In Proceedings of the 15th International Symposium on Distributed Computing, LNCS 2180
  • …Abstract. We introduce the notion of stable leader election and derive several algorithms for this problem. Roughly speaking, a leader election algorithm is stable if it ensures that once a leader is elected, it remains the leader for as long as it does not crash and its links have been behaving wel…
  • Cited by 3 (2 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB