André Schiper
EPFL IC-DO
BC 407 (Bâtiment BC)
Station 14
1015 Lausanne
Expertise
Systèmes distribués, Tolerance aux fautes, Replication, Transactions, Middleware, MANETs
Travail en cours
HO (Heard-Of) model: Model for solving agreement problems
SAMOA: Protocol framework
GrPerf: Performance evaluation of group communication
GrMANET: Group communication for MANETs
Les recherches d'André Schiper sont sponsorisées par le Fonds National Suisse et la Fondation Hasler.
Mission
Recherche en systèmes distribués
Enseignement:
- Concurrence
- Operating systems
- Systèmes distribués
- Distributed algorithms
André Schiper obtenu un diplôme en physiques de l'ETHZ en 1973 et un doctorat en informatique de l'EPFL en 1980. Il est professeur en informatique à l'EPFL depuis 1985, à la tête du Laboratoire de systèmes distribués. Durant l'année académique 1992-1993, il fut en congé sabbatique à l'Université de Cornell, Ithaca, New York (travaillant avec Ken Birman and Aleta Ricciardi), et en 2004-2005 à l'Ecole Polytechnique à Palaiseau, France (travaillant avec Bernadette Charron-Bost).
Ses domaines de recherches sont dans le secteur de la dépendance des systèmes distribués, support middleware pour systèmes dépendants, techniques de réplication (incluant bases de données), communication de groupe, transactions distribuées et MANETs (réseaux mobiles ad-hoc).
Prof. Schiper est membre du comité editorial de
Distributed Computing (DC), Springer Verlag - ACM,
Transactions on Dependable and Secure Computing (TDSC), IEEE,
International Journal of Security and Networks (Inderscience).
Publications
2021
Journal Articles
Recovery Algorithms for Paxos-Based State Machine Replication
Ieee Transactions On Dependable And Secure Computing. 2021. DOI : 10.1109/TDSC.2019.2926723.2016
Book Chapters
Consensus with Partial Synchrony
Encyclopedia of Algorithms, Second Edition; Springer New York, 2016. p. 436 - 441.2015
Conference Papers
On the Performance of Delegation over Cache-Coherent Shared Memory
2015. 16th International Conference on Distributed Computing and Networking (ICDCN), Goa, India, January 4-7, 2015. DOI : 10.1145/2684464.2684476.Theses
Efficient Communication and Synchronization on Manycore Processors
Lausanne, EPFL, 2015. DOI : 10.5075/epfl-thesis-6552.2014
Journal Articles
Tolerating permanent and transient value faults
Distributed Computing. 2014. DOI : 10.1007/s00446-013-0199-7.Conference Papers
Leveraging Hardware Message Passing for Efficient Thread Synchronization
2014. p. 143 - 154. DOI : 10.1145/2555243.2555251.Leveraging Hardware Message Passing for Efficient Thread Synchronization
2014. 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Orlando, Florida, USA, February 15-19, 2014. p. 143 - 154. DOI : 10.1145/2555243.2555251.High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning versus Replication
2014. 20th International European Conference on Parallel Processing, Porto, Portugal, August 25-29, 2014. p. 536 - 547. DOI : 10.1007/978-3-319-09873-9_45.Theses
High-Performance Communication Primitives and Data Structures on Message-Passing Manycores : Broadcast and Map
Lausanne, EPFL, 2014. DOI : 10.5075/epfl-thesis-6328.Reports
High-Throughput Maps on Message-Passing Manycore Architectures: Partitioning versus Replication
20142013
Journal Articles
Optimizing Paxos with batching and pipelining
Theoretical Computer Science. 2013. DOI : 10.1016/j.tcs.2012.10.002.Conference Papers
Replication for Send-Deterministic MPI HPC Applications
2013. 3rd Workshop on Fault-Tolerance for HPC at Extreme Scale, New-York City, USA, June, 2013. p. 33 - 40. DOI : 10.1145/2465813.2465819.Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms
2013. 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Budapest, Hungary, June 24-27, 2013. DOI : 10.1109/DSN.2013.6575306.SPBC: Leveraging the Characteristics of MPI HPC Applications for Scalable Checkpointing
2013. International Conference for High Performance Computing, Networking, Storage and Analysis (SC'13), Denver, Colorado, USA, November, 2013. DOI : 10.1145/2503210.2503271.Achieving high-throughput State Machine Replication in multi-core systems
2013. 33rd IEEE International Conference on Distributed Computing Systems (ICDCS). p. 266 - 275. DOI : 10.1109/Icdcs.2013.11.Theses
Abstractions for Solving Consensus and Related Problems with Byzantine Faults
Lausanne, EPFL, 2013. DOI : 10.5075/epfl-thesis-5975.Reports
Bounded Delay in Byzantine Tolerant State Machine Replication
20132012
Journal Articles
Quantitative Analysis of Consensus Algorithms
Ieee Transactions On Dependable And Secure Computing. 2012. DOI : 10.1109/TDSC.2011.48.Conference Papers
Tuning Paxos for high-throughput with batching and pipelining
2012. 13th International Conference on Distributed Computing and Networking (ICDCN 2012), Hong Kong, China, January 3-6, 2012.S-Paxos: Offloading the Leader for High Throughput State Machine Replication
2012. 31st International Symposium on Reliable Distributed Systems, Irvine, California, USA, October 8-11, 2012.Implementing Virtual Machine Replication: A Case Study using Xen and KVM
2012. 26th IEEE International Conference on Advanced Information Networking and Applications (AINA-2012), Fukuoka Institute of Technology (FIT), Fukuoka, Japan, March 26-29, 2012. p. 73 - 80. DOI : 10.1109/Aina.2012.50.Asynchronous Broadcast on the Intel SCC using Interrupts
2012. 5th Many-core Applications Research Community (MARC) Symposium, Toulouse, France, July 19-20, 2012.High-Performance RMA-Based Broadcast on the Intel SCC
2012. 24th ACM Symposium on Parallelism in Algorithms and Architectures, Pittsburgh, Pennsylvania, USA, June 25-27, 2012. p. 121 - 130. DOI : 10.1145/2312005.2312029.Theses
State Machine Replication : from Analytical Evaluation to High-Performance Paxos
Lausanne, EPFL, 2012. DOI : 10.5075/epfl-thesis-5410.Reports
Tolerating Permanent and Transient Value Faults
2012On the Core Mechanisms of Consensus Algorithms for Benign and Byzantine Faults
2012Addressing the ZooKeeper Synchronization Inefficiency
2012Student Projects
DISTAL: Domain-specific Language for Implementing Distributed Algorithms
20122011
Journal Articles
Verification of consensus algorithms using satisfiability solving
Distributed Computing. 2011. DOI : 10.1007/s00446-010-0123-3.Stabilization, Safety and Security Preface
Theoretical Computer Science. 2011. DOI : 10.1016/j.tcs.2011.07.023.Student mini-kernel project based on an FPGA board
ACM SIGOPS Operating Systems Review. 2011. DOI : 10.1145/2007183.2007190.The impact of mobility on the time complexity for deterministic broadcasting in radio networks
International Journal Of Ad Hoc And Ubiquitous Computing. 2011. DOI : 10.1504/IJAHUC.2011.042351.A Fault-Tolerant Token-Based Atomic Broadcast Algorithm
Ieee Transactions On Dependable And Secure Computing. 2011. DOI : 10.1109/TDSC.2010.24.Conference Papers
Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms
2011. 2011 5th Latin-American Symposium on Dependable Computing (LADC), Sao Jose dos Campos, Brazil, 25-29 04 2011. p. 166 - 175. DOI : 10.1109/LADC.2011.12.On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults
2011. 30th International Symposium on Reliable Distributed Systems. DOI : 10.1109/SRDS.2011.36.On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults
2011. 30th IEEE International Symposium on Reliable Distributed Systems (SRDS), Madrid, SPAIN, Oct 04-07, 2011. p. 235 - 244. DOI : 10.1109/SRDS.2011.36.Structured Derivation of Semi-Synchronous Algorithms
2011. 25th International Symposium on DIStributed Computing, Rome, Italy, September 20-22. DOI : 10.1007/978-3-642-24100-0_37.Theses
Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis
Lausanne, EPFL, 2011. DOI : 10.5075/epfl-thesis-4839.Reports
Quantitative Analysis of Consensus Algorithms
2011Tuning Paxos for high-throughput with batching and pipelining
2011On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults
2011JPaxos: State machine replication based on the Paxos protocol
2011Achieving high-throughput State Machine Replication in multi-core systems
20112010
Conference Papers
A Leader-Free Byzantine Consensus Algorithm
2010. 11th International Conference on Distributed Computing and Networking, Kolkata, INDIA, Jan 03-06, 2010. p. 67 - 78. DOI : 10.1007/978-3-642-11322-2_11.Swift Algorithms for Repeated Consensus
2010. 29th IEEE International Symposium on Reliable Distributed Systems, New Delhi, India, October 31 – November 3. DOI : 10.1109/SRDS.2010.18.Generic construction of consensus algorithms for benign and Byzantine faults
2010. p. 343 - 352. DOI : 10.1109/DSN.2010.5544299.A Leader-Free Byzantine Consensus Algorithm
2010. 11th International Conference on Distributed Computing and Networking (ICDCN), Kolkata, India, January 03-06. p. 67 - 78. DOI : 10.1007/978-3-642-11322-2_11.Reports
Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms
2010A Fault-Tolerant Token based Atomic Broadcast Algorithm
2010Swift Algorithms for Repeated Consensus
20102009
Journal Articles
The Heard-Of model: computing in distributed systems with benign faults
Distributed Computing. 2009. DOI : 10.1007/s00446-009-0084-6.Conference Papers
Brief Announcement: A Leader-free Byzantine Consensus Algorithm
2009. 23rd International Symposium on Distributed Computing (DISC), Elche/Elx, Spain, September 23-25, 2009. p. 477 - 478. DOI : 10.1007/978-3-642-04355-0_48.Latency-aware Leader Election
2009. SAC 2009 - Dependable and Adaptive Distributed Systems (DADS 09) track, Honolulu, Hawaii, March 10, 2009. p. 1056 - 1061. DOI : 10.1145/1529282.1529513.Brief Announcement: A Leader-free Byzantine Consensus Algorithm
2009. 23rd International Symposium on Distributed Computing, Elche, SPAIN, Sep 23-25, 2009. p. 479 - 480. DOI : 10.1007/978-3-642-04355-0_48.Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency
2009. 13th International Conference on Principles of Distributed Systems. p. 300 - 314. DOI : 10.1007/978-3-642-10877-8_24.Relaxed Atomic Broadcast: State-Machine Replication Using Bounded Memory
2009. 28th IEEE International Symposium on Reliable Distributed Systems, Niagara Falls, NY, Sep 27-30, 2009. p. 3 - 11. DOI : 10.1109/SRDS.2009.25.Theses
Concurrency and dynamic protocol update for group communication middleware
Lausanne, EPFL, 2009. DOI : 10.5075/epfl-thesis-4244.Reports
A Leader-free Byzantine Consensus Algorithm
2009Generic construction of consensus algorithms for benign and Byzantine faults
2009Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency
2009Relaxed Atomic Broadcast: State-Machine Replication Using Bounded Memory
20092008
Conference Papers
Extending Paxos/LastVoting with an Adequate Communication Layer for Wireless Ad Hoc Networks
2008. 2008 IEEE 27th International Symposium on Reliable Distributed Systems (SRDS), Naples, Italy, 6-8 October 2008. p. 227 - 236. DOI : 10.1109/SRDS.2008.21.A Predicate-Based Approach to Dynamic Protocol Update in Group Communication
2008. 22nd IEEE International Parallel and Distributed Processing Symposium, Miami, Florida USA, April 14-18, 2008. DOI : 10.1109/IPDPS.2008.4536238.On the Specification of Partitionable Group Membership
2008. 7th European Dependable Computing Conference, Kaunas, Lithuania, May 7-9, 2008. p. 37 - 45. DOI : 10.1109/EDCC-7.2008.23.Theses
A formal approach to fault tolerant distributed consensus
Lausanne, EPFL, 2008. DOI : 10.5075/epfl-thesis-3980.Reports
Using Bounded Model Checking to Verify Consensus Algorithms
2008Consensus in Wireless Ad hoc Networks
20082007
Journal Articles
Harmful dogmas in fault tolerant distributed computing
Sigact news. 2007. DOI : 10.1145/1233481.1233496.Conference Papers
On the Cost of Modularity in Atomic Broadcast
2007. 2007 IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2007), Edinburgh, United Kingdom, June 25 - June 28, 2007. p. 635 - 644. DOI : 10.1109/DSN.2007.69.Model Checking of Consensus Algorithms
2007. 26th IEEE International Symposium on Reliable Distributed Systems. p. 137 - 148. DOI : 10.1109/SRDS.2007.20.Modeling and validating the performance of atomic broadcast algorithms in high-latency networks
2007. Euro-Par 2007, Rennes, France, August 2007. p. 574 - 586. DOI : 10.1007/978-3-540-74466-5_61.Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults
2007. DSN 2007, Edinburg, UK, June 25-28 2007. p. 92 - 101. DOI : 10.1109/DSN.2007.25.Tolerating Corrupted Communication
2007. PODC'07, Portland, USA, August 12-15, 2007. p. 244 - 253. DOI : 10.1145/1281100.1281136.An Automatic Real-Time Analysis of the Time to Reach Consensus
2007. 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007). p. 53 - 60. DOI : 10.1109/PRDC.2007.10.Theses
On broadcast and agreement in mobile ad hoc networks
Lausanne, EPFL, 2007. DOI : 10.5075/epfl-thesis-3881.Atomic broadcast : a fault-tolerant token based algorithm and performance evaluations
Lausanne, EPFL, 2007. DOI : 10.5075/epfl-thesis-3811.Reports
The Heard-Of Model: Computing in Distributed Systems with Benign Failures
2007Consensus Problem in Wireless Ad hoc Networks: Addressing the Right Issues
20072006
Journal Articles
Dynamic group communication
Distributed Computing. 2006. DOI : 10.1007/s00446-005-0129-4.From Set Membership to Group Membership: A Separation of Concerns
IEEE Transactions on Dependable and Secure Computing. 2006. DOI : 10.1109/TDSC.2006.13.Conference Papers
Solving Atomic Broadcast with Indirect Consensus
2006. 2006 IEEE International Conference on Dependable Systems and Networks (DSN 2006), Philadelphia, PA, USA, June 2006. p. 156 - 165. DOI : 10.1109/DSN.2006.65.Group Communication: From Practice to Theory
2006. SOFSEM 2006, Merin, Czech Republic, January 2006. p. 117 - 136. DOI : 10.1007/11611257_10.Improving Fast Paxos: being optimistic with no overhead
2006. p. 287 - 295. DOI : 10.1109/PRDC.2006.39.Reliable Broadcast in Wireless Mobile Ad Hoc Networks
2006. Hawaii International Conference on System Sciences, Kauai-Hawai, 4-7 january. DOI : 10.1109/HICSS.2006.413.DRIFT: Efficient Message Ordering in Ad Hoc networks Using Virtual Flooding
2006. SRDS '06, University of Leeds, October 2-4, 2006. p. 119 - 131. DOI : 10.1109/SRDS.2006.18.Service Interface: A New Abstraction for Implementing and Composing Protocols
2006. The 21st Annual ACM Symposium on Applied Computing (SAC 2006), Dijon, April 23 -27, 2006. p. 691 - 696. DOI : 10.1145/1141277.1141436.Structural and Algorithmic Issues of Dynamic Protocol Update
2006. 20th IEEE International Parallel and Distributed Processing Symposium, Rhodes Island, Greece., 25-29 April, 2006. DOI : 10.1109/IPDPS.2006.1639369.Theses
Towards reliable communication and agreement in mobile ad-hoc networks : algorithms, simulation and testbed
Lausanne, EPFL, 2006. DOI : 10.5075/epfl-thesis-3639.Protocol composition frameworks and modular group communication : models, algorithms and architectures
Lausanne, EPFL, 2006. DOI : 10.5075/epfl-thesis-3633.Book Chapters
Dependable Systems
Dependable Systems: Software, Computing, Networks; Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. p. 34 - 54.Advances in the Design and Implementation of Group Communication Middleware
Dependable Systems: Software, Computing, Networks; Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. p. 172 - 194.Reports
Solving Atomic Broadcast with Indirect Consensus
2006Communication Predicates: A high-level abstraction for coping with transient and dynamic faults
2006Model Checking of Consensus Algorithms
2006The Heard-Of Model: Unifying all Benign Failures
2006DRIFT: Efficient message ordering in ad hoc networks using virtual flooding
2006Comparing Atomic Broadcast Algorithms in High Latency Networks
20062005
Journal Articles
Comparison of Database Replication Techniques Based on Total Order Broadcast
IEEE Transactions on Knowledge and Data Engineering. 2005. DOI : 10.1109/TKDE.2005.54.Replication: Understanding the Advantage of Atomic Broadcast over Quorum Systems
Journal of Universal Computer Science. 2005. DOI : 10.3217/jucs-011-05-0703.Conference Papers
A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks
2005. 38th Annual Hawaii International Conference on System Sciences (HICSS'05), Big Island, Hawaii, 3-6 January 2005. p. 321b - 321b. DOI : 10.1109/HICSS.2005.20.Assessing the Crash-Failure Assumption of Group Communication Protocols
2005. 16th IEEE International Symposium on Software Reliability Engineering, Chicago, USA, November 8-11, 2005. DOI : 10.1109/ISSRE.2005.9.A new look at atomic broadcast in the asynchronous crash-recovery model
2005. 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05), Orlando, USA, October 26-28, 2005. p. 202 - 211. DOI : 10.1109/RELDIS.2005.6.Theses
JMSGroups : JMS compliant group communication
Lausanne, EPFL, 2005. DOI : 10.5075/epfl-thesis-3341.Reports
Reaching Agreement with Unknown Participants in Mobile Self-Organized Networks in Spite of Process Crashes
2005Dynamic Update of Distributed Agreement Protocols
20052004
Journal Articles
Uniform consensus is harder than consensus
Journal of Algorithms. 2004. DOI : 10.1016/j.jalgor.2003.11.001.Total Order Broadcast and Multicast Algorithms: Taxonomy and Survey
ACM Computing Surveys. 2004. DOI : 10.1145/1041680.1041682.Approaches to Fault-Tolerant and Transactional Mobile Agent Execution -- An Algorithmic View
ACM Computing Surveys. 2004. DOI : 10.1145/1035570.1035571.Semi-passive replication and Lazy Consensus
Journal of Parallel and Distributed Computing. 2004. DOI : 10.1016/j.jpdc.2004.08.006.Conference Papers
Towards JMS Compliant Group Communication - a Semantic Mapping
2004. International Symposium on Network Computing and Applications (IEEE NCA04), Cambridge, MA, USA, July 2004. p. 131 - 140. DOI : 10.1109/NCA.2004.1347770.Towards Flexible Finite-State-Machine-Based Protocol Composition
2004. International Symposium on Network Computing and Applications (IEEE NCA04), Cambridge, MA, USA, July 2004. p. 281 - 286. DOI : 10.1109/NCA.2004.1347787.Token-based Atomic Broadcast using Unreliable Failure Detectors
2004.Comparing Distributed Consensus Algorithms
2004.Beyond 1-Safety and 2-Safety for replicated databases: Group-Safety
2004.Implementing Group Communication Protocols using SDL
2004. p. 333 - 340.SAMOA: A Framework for a Synchronisation-Augmented Microprotocol Approach
2004. IPDPS '04: the 18th IEEE Parallel and Distributed Processing Symposium, Santa Fe, New Mexico, USA, April 26 – 30, 2005. DOI : 10.1109/IPDPS.2004.1302992.Consensus with Unknown Participants or Fundamental Self-Organization
2004. Third International Conference on Ad hoc Networks and Wireless (ADHOC-NOW 2004), Vancouver, CA, 22-24 July 2004. p. 135 - 148. DOI : 10.1007/978-3-540-28634-9_11.Reports
A Lower Bound for Broadcasting in Mobile Ad Hoc Networks
2004A new look at atomic broadcast in the asynchronous crash-recovery model
2004Performance Comparison of a Rotating Coordinator and a Leader Based Consensus Algorithm
2004Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes
2004Towards Flexible Finite-State Machine Based Protocol Composition
2004Token-based Atomic Broadcast using Unreliable Failure Detectors
2004Lower Bounds on Generic Broadcast Algorithms
2004Approaches to Fault-Tolerant and Transactional Mobile Agent Execution -- An Algorithmic View
20042003
Journal Articles
Optimistic atomic broadcast: a pragmatic viewpoint
Theoretical Computer Science. 2003. DOI : 10.1016/S0304-3975(01)00397-8.Robust TCP Connections for Fault Tolerant Computing
Journal of Information Science and Engineering. 2003.Fault-Tolerant Mobile Agent Execution
IEEE Transactions on Computers. 2003. DOI : 10.1109/TC.2003.1176987.Comparative performance analysis of ordering strategies in atomic broadcast algorithms
IEICE Trans. on Information and Systems. 2003.The Database State Machine Approach
Distributed and Parallel Databases. 2003. DOI : 10.1023/A:1022887812188.Using Optimistic Atomic Broadcast in Transaction Processing Systems
IEEE Transactions on Knowledge and Data Engineering. 2003. DOI : 10.1109/TKDE.2003.1209016.Conference Papers
Group communication based on standard interfaces
2003. p. 140 - 147. DOI : 10.1109/NCA.2003.1201148.Probabilistic Broadcast for Flooding in Wireless Mobile Ad hoc Networks
2003. IEEE Wireless Communications and Networking Conference (WCNC), New Orleans, Louisiana, USA, 16-20 March 2003. p. 1124 - 1130. DOI : 10.1109/WCNC.2003.1200529.A Step towards a New Generation of Group Communication Systems
2003. Middleware '03: the 4th ACM / IFIP / USENIX Middleware Conference, Rio de Janeiro, Brazil, June 16-20, 2003. p. 414 - 432. DOI : 10.1007/3-540-44892-6_21.Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms
2003. p. 645 - 654. DOI : 10.1109/DSN.2003.1209974.Appia vs. Cactus: Comparing Protocol Composition Frameworks
2003. Symposium on Reliable Distributed Systems, Florence, Italy. p. 189 - 198. DOI : 10.1109/RELDIS.2003.1238068.Practical impact of group communication theory
2003. p. 1 - 10. DOI : 10.1007/3-540-37795-6_1.Theses
Evaluating the performance of distributed agreement algorithms : tools, methodology and case studies
Lausanne, EPFL, 2003. DOI : 10.5075/epfl-thesis-2824.Reports
Towards JMS-Compliant Group Communication
2003Replicated Invocation
2003Dynamic Group Communication
2003Beyond 1-Safety and 2-Safety for Replicated Databases: Group-Safety
2003From a Location Service to a Multicast Service for Wireless Mobile Adhoc Networks
2003A Step Towards a New Generation of Group Communication Systems
2003Revisiting Token-based Atomic Broadcast Algorithms
2003Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms
2003Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms (extended version)
2003Total Order Broadcast and Multicast Algorithms: Taxonomy and Survey
2003From Set Membership to Group Membership: A Separation of Concerns
2003FRANC: A Lightweight Java Framework for Wireless Multihop Communication
2003Total Order Broadcast and Multicast Algorithms: Taxonomy and Survey
20032002
Journal Articles
Neko: A Single Environment to Simulate and Prototype Distributed Algorithms
Journal of Information Science and Engineering. 2002.Handling message semantics with Generic Broadcast protocols
Distributed Computing. 2002. DOI : 10.1007/s004460100061.Conference Papers
Broadcasting Messages in Fault-Tolerant Distributed Systems: the benefit of handling input-triggered and output-triggered suspicions differently
2002. p. 244 - 249. DOI : 10.1109/RELDIS.2002.1180193.Weak Ordering Oracles for Failure Detection-Free Systems
2002. p. B - 32.Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements
2002. p. 551 - 560. DOI : 10.1109/DSN.2002.1028980.Robust TCP Connections for Fault Tolerant Computing
2002. p. 501 - 508. DOI : 10.1109/ICPADS.2002.1183448.Semantics of Protocol Modules Composition and Interaction
2002. 5th International Conference, COORDINATION 2002, York, UK, April 8–11, 2002. p. 389 - 404. DOI : 10.1007/3-540-46000-4_35.On the Accuracy of MANET Simulators
2002. ACM Principles of Mobile Computing (POMC 2002), Toulouse, France, 30-31 October 2002. p. 38 - 43. DOI : 10.1145/584490.584499.Performance comparison between the Paxos and Chandra-Toueg consensus algorithms
2002. p. 526 - 533.Failure Detection vs. Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs
2002. Second Joint International Workshop PAPM-PROBMIV 2002, Copenhagen, Denmark, July 25–26, 2002. p. 1 - 15. DOI : 10.1007/3-540-45605-8_1.Solving Agreement Problems with Weak Ordering Oracles
2002. 4th European Dependable Computing Conference, Toulouse, France, 23-25 October 2002. p. 44 - 61. DOI : 10.1007/3-540-36080-8_5.Theses
Group communications and database replication : techniques, issues and performance
Lausanne, EPFL, 2002. DOI : 10.5075/epfl-thesis-2577.Fault-tolerant and transactional mobile agent execution
Lausanne, EPFL, 2002. DOI : 10.5075/epfl-thesis-2654.Reports
Solving Agreement Problems with Weak Ordering Oracles
2002Semantics of Protocol Modules Composition and Interaction
2002Specification of Replication Techniques, Semi-Passive Replication and Lazyt Consensus
2002Performance Comparison Between the Paxos and Chandra-Toueg Consensus Algorithms
2002Broadcasting Messages in Fault-Tolerant Distributed Systems: the benefit of handling input-triggered and output-triggered suspicions differently
2002Specification of Replication Techniques, Semi-Passive Replication, and Lazy consensus*
2002Probabilistic Broadcast for Flooding in Wireless Mobile Ad hoc Networks
2002On the Accuracy of MANET Simulators
20022001
Journal Articles
Genuine atomic multicast in asynchronous distributed systems
Theoretical Computer Science. 2001. DOI : 10.1016/S0304-3975(99)00161-9.The Generic Consensus Service
IEEE Transactions on Software Engineering. 2001. DOI : 10.1109/32.895986.Conference Papers
Primary-backup replication: From a time-free protocol to a time-based implementation
2001. 20th IEEE Symposium on Reliable Distributed Systems, New Orleans, LA, USA, USA, 31-31 Oct. 2001. p. 14 - 23. DOI : 10.1109/RELDIS.2001.969730.Impact of a Failure Detection Mechanism on the Performance of Consensus
2001. p. 137 - 145. DOI : 10.1109/PRDC.2001.992690.FATOMAS - A Fault-Tolerant Mobile Agent System Based on the Agent-Dependent Approach
2001. p. 215 - 224. DOI : 10.1109/DSN.2001.941407.Optimistic Active Replication
2001. p. 333 - 341. DOI : 10.1109/ICDSC.2001.918963.Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?
2001. p. 190 - 193. DOI : 10.1109/RELDIS.2001.970767.Optimistic active replication
2001. 21st International Conference on Distributed Computing Systems, Mesa, AZ, USA, 16-19 April 2001. p. 333 - 341. DOI : 10.1109/ICDSC.2001.918963.Neko: A Single Environment to Simulate and Prototype Distributed Algorithms
2001.Time vs. Space in Fault-Tolerant Distributed Systems
2001. p. 21 - 27. DOI : 10.1109/WORDS.2001.945109.Primary-backup replication: From a time-free protocol to a time-based implementation
2001. p. 14 - 23. DOI : 10.1109/RELDIS.2001.969730.Reports
Using Optimistic Atomic Broadcast in Transaction Processing Systems
2001Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?
2001Primary-backup replication: From a time-free protocol to a time-based implementation
20012000
Conference Papers
Synchronous System and Perfect Failure Detector: solvability and efficiency issues
2000. p. 523 - 532. DOI : 10.1109/ICDSN.2000.857585.Database Replication Techniques: a three parameter classification
2000. p. 206 - 215. DOI : 10.1109/RELDI.2000.885408.Modeling Fault-Tolerant Mobile Agent Execution as a Sequence of Agreement Problems
2000. p. 11 - 20. DOI : 10.1109/RELDI.2000.885388.Understanding replication in databases and distributed systems
2000. p. 264 - 274. DOI : 10.1109/ICDCS.2000.840959.Contention-Aware Metrics for Distributed Algorithms: Comparison of Atomic Broadcast Algorithms
2000. p. 582 - 589. DOI : 10.1109/ICCCN.2000.885548.Theses
Solving consensus : from fair-lossy channels to crash-recovery of processes
Lausanne, EPFL, 2000. DOI : 10.5075/epfl-thesis-2139.Agreement-related problems : from semi-passive replication to totally ordered broadcast
Lausanne, EPFL, 2000. DOI : 10.5075/epfl-thesis-2229.Book Chapters
Replication of CORBA Objects
Advances in Distributed Systems; Springer, 2000. p. 254 - 276.Reports
Optimistic Active Replication
2000Totally Ordered Broadcast and Multicast Algorithms: A Comprehensive Survey
2000Contention-aware metrics: analysis of distributed algorithms
2000Semi-Passive Replication and Lazy Consensus
2000Uniform Consensus Harder than Consensus
2000Totally Ordered Broadcast and Multicast Algorithms: A Comprehensive Survey
20001999
Conference Papers
Muteness Failure Detectors: Specification and Implementation
1999. p. 71 - 87.Generic Broadcast
1999.Processing Transactions over Optimistic Atomic Broadcast Protocols
1999.Replicating CORBA Objects: a marriage between active and passive replication
1999. p. 375 - 387.A Systematic Classification of Replicated Database Protocols based on Atomic Broadcast
1999.Optimization Techniques for Replicating CORBA Objects
1999. p. 2 - 8. DOI : 10.1109/WORDS.1999.806554.Theses
The database state machine and group communication issues
Lausanne, EPFL, 1999. DOI : 10.5075/epfl-thesis-2090.A technical approach to privacy based on mobile agents protected by tamper-resistant hardware
Lausanne, EPFL, 1999. DOI : 10.5075/epfl-thesis-1961.Book Chapters
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems; Springer, 1999. p. 33 - 47.Reports
Muteness Failure Detectors, Specification and Implementation
1999Using Optimistic Atomic Broadcast in Transaction Processing Systems
1999Failure Detectors: implementation issues and impact on consensus performance
1999Understanding Replication in Databases and Distributed Systems
1999The Database State Machine Approach
1999Generic Broadcast
1999The Database State Machine Approach
19991998
Journal Articles
The Implementation of a CORBA Object Group Service
Theory and Practice of Object Systems. 1998. DOI : 10.1002/(SICI)1096-9942(1998)4:2<93::AID-TAPO4>3.0.CO;2-8.Validation atomique et consensus: une approche systématique
Technique et science informatiques (TSI). 1998.Conference Papers
Optimistic Atomic Broadcast
1998.Evaluating CORBA Portability: The Case of an Object Group Service
1998.Highly Available Trading System: Experiments with CORBA
1998. Middleware'98: IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing. p. 91 - 104. DOI : 10.1007/978-1-4471-1283-9_6.Exploiting Atomic Broadcast in Replicated Databases
1998.Muteness Detectors for Consensus with Byzantine Processes (Brief Announcement)
1998. DOI : 10.1145/277697.277772.Semi-Passive Replication
1998. p. 43 - 50. DOI : 10.1109/RELDIS.1998.740473.Le consensus vectoriel: une nouvelle spécification du problème du consensus dans un modèle Byzantin
1998.Scalable Atomic Multicast
1998. p. 840 - 847. DOI : 10.1109/ICCCN.1998.998851.Theses
Protocol objects and patterns for structuring reliable distributed systems
Lausanne, EPFL, 1998. DOI : 10.5075/epfl-thesis-1801.The CORBA object group service : a service approach to object groups in CORBA
Lausanne, EPFL, 1998. DOI : 10.5075/epfl-thesis-1867.Soft real-time analysis of asynchronous agreement algorithms using Petri nets
Lausanne, EPFL, 1998. DOI : 10.5075/epfl-thesis-1808.Reports
Evaluating CORBA Portability: The Case of an Object Group Service
1998Stubborn Communication Channels
1998Scalable Atomic Multicast
1998The Generic Consensus Service
1998The Implementation of CORBA Object Group Service
1998Exploiting Atomic Broadcast in Replicated Databases
1998Semi-Passive Replication
1998Optimistic Atomic Broadcast
1998Genuine Atomic Multicast in Asynchronous Systems
19981997
Journal Articles
Early Consensus in an Asynchronous System with a Weak Failure Detector
Distributed Computing. 1997. DOI : 10.1007/s004460050032.Software-Based Replication for Fault Tolerance
IEEE Computer. 1997. DOI : 10.1109/2.585156.A suite of definitions for consistency criteria in distributed shared memories
Annales des telecommunications. 1997.Conference Papers
Consensus: the Big Misunderstanding
1997. p. 183 - 188. DOI : 10.1109/FTDCS.1997.644722.Total order multicast to multiple groups
1997. p. 578 - 585.Transaction Reordering in Replicated Databases
1997.Genuine Atomic Multicast
1997. p. 141 - 154. DOI : 10.1007/BFb0030681.Security in the Telecommunications Information Networking Architecture - the CrySTINA Approach
1997. p. 164 - 171. DOI : 10.1109/TINA.1997.660721.Replicating Objects using the CORBA Event Service
1997. p. 14 - 19. DOI : 10.1109/FTDCS.1997.644697.Reports
Transaction Reordering in Replicated Databases
1997Consensus: the Big Misunderstanding
1997Consensus in the Crash-Recover Model
1997Security in the Telecommunications Information Networking Architecture - the CrySTINA Approach
1997Muteness Failure Detectors for Consensus with Byzantine Processes
1997A CORBA Object Group Service
19971996
Journal Articles
From Group Communication to Transactions in Distributed Systems
Communications of the ACM. 1996. DOI : 10.1145/227210.227230.Conference Papers
Consensus Service: A Modular Approach For Building Fault-Tolerant Agreement Protocols in Distributed Systems
1996. p. 168 - 177.A Suite of Formal Definitions for Consistency Criteria in Distributed Shared Memories
1996. p. 125 - 130.Reducing the Cost for Non-Blocking in Atomic Commitment
1996. p. 692 - 697.Atomic Updates of Replicated Data
1996. Second European Dependable Computing Conference (EDCC-2), Taormina, Italy, October 2–4, 1996. p. 365 - 381. DOI : 10.1007/3-540-61772-8_49.Fault-Tolerance by Replication in Distributed Systems
1996. p. 38 - 57. DOI : 10.1007/BFb0013477.Gamma-Accurate Failure Detectors
1996. 10th International Workshop on Distributed Algorithms (WDAG-10), Bologna, Italy, October 9–11, 1996. p. 269 - 286. DOI : 10.1007/3-540-61769-8_18.Theses
Étude de l'invocation entre objets dupliqués dans un système réparti tolérant aux fautes
Lausanne, EPFL, 1996. DOI : 10.5075/epfl-thesis-1578.Conception and implementation of a toolkit for building fault-tolerant distributed applications in large scale networks
Lausanne, EPFL, 1996. DOI : 10.5075/epfl-thesis-1557.Reports
Consensus Service: a modular approach for building agreement protocols in distributed systems
1996Atomic Multicast harder than Atomic Broadcast
1996Reducing the Cost for Non-Blocking in Atomic Commitment
1996``$Gamma$-Accurate'' Failure Detectors
1996Atomic Updates of Replicated Data
1996Fault-Tolerance by Replication in Distributed Systems
1996Time Cost Analysis of a Consensus Algorithm
1996Early consensus in an asynchronous system with a weak failure detector
1996Total Order Multicast to Multiple Groups
19961995
Journal Articles
On Group Communication in Large-Scale Distributed Systems
ACM Operating Systems Review. 1995. DOI : 10.1145/202453.202468.Conference Papers
Non Blocking Atomic Commitment with an Unreliable Failure Detector
1995. p. 41 - 50.Phoenix: A Toolkit for Building Fault-Tolerant Distributed Applications in Large Scale
1995.Transaction model vs Virtual Synchrony model: bridging the gap
1995. p. 121 - 132. DOI : 10.1007/3-540-60042-6_9.A Generic Multicast Primitive to Support Transactions on Replicated Objects in Distributed Systems
1995. p. 334 - 342. DOI : 10.1109/FTDCS.1995.525002.From Causal Consistency to Sequential Consistency in Shared Memory Systems
1995. 15th Conference on Foundations of Software Technologies and Theoretical Computer Science, Bangalore, India, December 18–20, 1995. p. 180 - 194. DOI : 10.1007/3-540-60692-0_48.A Hierarchy of Totally Ordered Multicasts
1995. p. 106 - 115. DOI : 10.1109/RELDIS.1995.526218.View Synchronous Communication in Large Scale Distributed Systems
1995.The Decentralized Non-Blocking Atomic Commitment Protocol
1995. p. 2 - 9. DOI : 10.1109/SPDP.1995.530658.Theses
Concepts et mécanismes pour la mise en oeuvre d'un environnement d'édition coopérative sur un réseau à grande échelle
Lausanne, EPFL, 1995. DOI : 10.5075/epfl-thesis-1335.Reports
Non Blocking Atomic Commitment with an Unreliable Failure Detector
1995The Decentralized Non-Blocking Atomic Commitment Protocol
1995From Causal Consistency to Sequential Consistency in Shared Memory Systems
19951994
Journal Articles
Strong Stable Properties in Distributed Systems
Distributed Computing. 1994. DOI : 10.1007/BF02280831.Conference Papers
On Group Communication in Large-Scale Distributed Systems
1994. p. 17 - 22. DOI : 10.1145/504390.504396.Uniform Actions in Asynchronous Distributed Systems
1994. p. 274 - 283.Édition Coopérative et Large Échelle dans Duplex
1994.Duplex: A Distributed Collaborative Editing Environment in Large Scale
1994. p. 165 - 173. DOI : 10.1145/192844.192900.Primary Partition "Virtually-Synchronous Communication'' harder than Consensus
1994. 8th International Workshop, WDAG '1994, Terschelling, The Netherlands, September 29 – October 1, 1994. p. 39 - 52. DOI : 10.1007/BFb0020423.Reports
View Synchronous Communication in the Internet
1994Primary Partition "Virtually-Synchronous Communication" harder than Consensus
1994Transaction model vs Virtual Synchrony model: bridging the gap
1994Duplex: A Distributed Collaborative Editing Environment in Large Scale
19941993
Conference Papers
Uniform Reliable Multicast in a Virtually Synchronous Environment
1993. p. 561 - 568. DOI : 10.1109/ICDCS.1993.287667.Understanding the Power of the Virtually-Synchronous Model
1993.On the Granularity of Events when Modeling Program Executions
1993. p. 422 - 429. DOI : 10.1109/SPDP.1993.395502.Virtually-Synchronous Communication Based on a Weak Failure Suspector
1993. p. 534 - 543.Understanding Partitions and the "No Partition'' Assumption
1993. p. 354 - 360. DOI : 10.1109/FTDCS.1993.344134.1992
Theses
La réexécution, pierre angulaire de la mise au point des programmes parallèles
Lausanne, EPFL, 1992. DOI : 10.5075/epfl-thesis-1049.Causal approaches to concurrency control in distributed and replicated database systems
Lausanne, EPFL, 1992. DOI : 10.5075/epfl-thesis-1036.1991
Journal Articles
Techniques de déverminage pour programmes parallèles
Technique et Science Informatiques (TSI). 1991.Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems. 1991. DOI : 10.1145/128738.128742.The causal ordering abstraction and a simple way to implement it
Information Processing Letter. 1991. DOI : 10.1016/0020-0190(91)90008-6.Theses
Expériences de parallélisation d'un compilateur basée sur le découpage du programme source
Lausanne, EPFL, 1991. DOI : 10.5075/epfl-thesis-919.1989
Journal Articles
A Protected Mode Modula-2 Environment
Journal of Pascal, Ada & Modula-2. 1989.Efficient Implementation of Rendezvous
The Computer Journal. 1989. DOI : 10.1093/comjnl/32.3.267.Conference Papers
A new algorithm to implement causal ordering
1989. Distributed Algorithms, 3rd International Workshop, Nice, France, September 26–28, 1989. p. 219 - 232. DOI : 10.1007/3-540-51687-5_45.Theses
Portanim, un environnement de visualisation de l'exécution de programmes en temps réel
Lausanne, EPFL, 1989. DOI : 10.5075/epfl-thesis-805.1984
Journal Articles
Une structure de contrôle à deux niveaux pour la programmation heuristique parallèle
Technique et Science Informatiques (TSI). 1984.Enseignement et PhD
A dirigé les thèses EPFL de
François Pacull, Jean-Claude Lugeon, Christoph Malloth, Karim Mazouni, Nicoleta Sergent, Pascal Felber, Benoît Garbinato, Uwe Wilhelm, Fernando Pedone, Rui Oliveira, Xavier Défago, Stefan Pleisch, Matthias Wiesmann, Peter Urban, Arnas Kupsys, David Cavin, Sergio Mena, Yoav Sasson, Nils Richard Ekwall, Olivier Rütti, Fatemeh Borran, Nuno Filipe de Sousa Santos, Zarko Milosevic, Omid Shahmirzadi, Darko Petrovic