000128429 001__ 128429
000128429 005__ 20190509132212.0
000128429 0247_ $$2doi$$a10.5075/epfl-thesis-4244
000128429 02470 $$2urn$$aurn:nbn:ch:bel-epfl-thesis4244-6
000128429 02471 $$2nebis$$a5669650
000128429 037__ $$aTHESIS
000128429 041__ $$aeng
000128429 088__ $$a4244
000128429 245__ $$aConcurrency and dynamic protocol update for group communication middleware
000128429 269__ $$a2009
000128429 260__ $$bEPFL$$c2009$$aLausanne
000128429 300__ $$a139
000128429 336__ $$aTheses
000128429 520__ $$aThe last three decades have seen computers invading our society: computers are now present at work to improve productivity and at home to enlarge the scope of our hobbies and to communicate. Furthermore, computers have been involved in many critical systems such as anti-locking braking systems (ABS) in our cars, airplane control systems, space rockets, nuclear power plants, banking and trading systems, medical care systems, and so on. The importance of these systems requires a high level of trust in computer-based systems. For example, a failure in a trading system (even if it is temporary) may result in severe economical losses. Hence coping with failures is a key aspect of computer systems. A common approach to tolerate failures is to replicate a system that provides a critical service, so that once a failure occurs on a given replica, the requests to the critical service are still executed by other replicas. This approach has the advantage of masking failures, i.e., requests to the service are continuously executed even in the presence of failures. However, replication introduces a performance cost, mainly because the execution of the service requests must be coordinated among all replicas. Furthermore, despite its apparent simplicity, replication is rather complex to implement. Replication is made easier by group communication which defines several abstractions that can be used by the designer of replicated systems. The group communication abstractions are implemented by distributed protocols that compose a group communication middleware. The aim of the thesis is to study two techniques to improve the performance of group communication middleware, and thus, reduce the cost of replication. First, we study dynamic protocol update, which allows group communication middleware to adapt to environment changes. More particularly, dynamic protocol update consists in replacing at runtime a given protocol composing the group communication middleware with a similar but more efficient protocol. The thesis provides several solutions to dynamic protocol update. For instance, we describe two algorithms to dynamically replace consensus and atomic broadcast, two essential protocols of a group communication middleware. Second, we propose solutions to introduce concurrency within a group communication middleware in order to benefit from the advantages offered by multiprocessor (or multicore) computers.
000128429 6531_ $$afault tolerance
000128429 6531_ $$areplication
000128429 6531_ $$agroup communication
000128429 6531_ $$amiddleware
000128429 6531_ $$aadaptive systems
000128429 6531_ $$adistributed algorithms
000128429 6531_ $$aconsensus
000128429 6531_ $$aatomic broadcast
000128429 6531_ $$adynamic protocol update
000128429 6531_ $$aconcurrency
000128429 6531_ $$aSAMOA
000128429 6531_ $$atolérance aux fautes
000128429 6531_ $$areplication
000128429 6531_ $$acommunication de groupes
000128429 6531_ $$aintergiciels
000128429 6531_ $$asystèmes adaptifs
000128429 6531_ $$aalgorithmes distribués
000128429 6531_ $$aconsensus
000128429 6531_ $$adiffusion atomique
000128429 6531_ $$aremplacement dynamique de protocoles
000128429 6531_ $$aconcurrence
000128429 6531_ $$aSAMOA
000128429 700__ $$aRütti, Olivier
000128429 720_2 $$aSchiper, André$$edir.$$g106377$$0241767
000128429 8564_ $$uhttps://infoscience.epfl.ch/record/128429/files/EPFL_TH4244.pdf$$zTexte intégral / Full text$$s966830$$yTexte intégral / Full text
000128429 909C0 $$xU10411$$0252206$$pLSR
000128429 909CO $$pthesis-bn2018$$pDOI$$pIC$$ooai:infoscience.tind.io:128429$$qDOI2$$qGLOBAL_SET$$pthesis
000128429 918__ $$dEDIC2005-2015$$cIIF$$aIC
000128429 919__ $$aLSR
000128429 920__ $$b2009
000128429 970__ $$a4244/THESES
000128429 973__ $$sPUBLISHED$$aEPFL
000128429 980__ $$aTHESIS