Characterization of Consistent Global Checkpoints in Large-Scale Distributed Systems ∗ (2008)
R. Baldoni, J. Brzeziński, J. M. Helary, A. Mostefaoui, M. Raynal
Backward error recovery is one of the most used schemes to ensure fault-tolerance in distributed systems. It consists, upon the occurrence of a failure, in restoring a distributed computation in an...
Piergiovanni. Looking for a Definition of Dynamic Distributed Systems (2008)
R. Baldoni, M. Bertier, M. Raynal, S. Tucci-piergiovanni
Abstract. This paper is a position paper on the nature of dynamic systems. While there is an agreement on the definition of what a static distributed system is, there is no agreed definition on what...
Cycles Prevention in Distributed Checkpointing Invited Paper (2008)
A useless checkpoint isalocalcheckpoint that cannot be part of a consistent global checkpoint. Given a set of processes that take (basic) local checkpoints in an independent and unknown way, this...
M. Raynal, A. Mostefaoui, E. Fabre, Asap Team
Summary of last time Unfoldings and their properties Next time Download the lecture slides from my web-page: http://www.irisa.fr/distribcom/Personal Pages/fabre/fabre.html Summary of last time...
The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses (2008)
D. Agrawal, A. El Abbadi, A. Mostefaoui, M. Raynal, M. Roy
Data warehouses have become extremely important to support online analytical processing (OLAP) queries in databases. Since the data view that is obtained at a data warehouse is derived from multiple...
Consistent State Restoration In Shared Memory Systems (2007)
R. Baldoni, J.M. Hélary, A. Mostefaoui, M. Raynal, Projet Adp
: In many systems, backward recovery constitutes a classical technique to ensure faulttolerance. It consists in restoring a computation in a consistent global state, saved in a global checkpoint,...
C. Delporte-gallet, H. Fauconnier, M. Raynal
The Global Data Computation problem consists in providing each process with the same vector (with one entry per process) such that each entry is filled by a value provided by the corresponding...
The Alpha of Indulgent Consensus (2006)
This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus...
A Necessary and Sufficient Condition for Transforming Limited Accuracy Failure Detectors (2004)
E. Anceaume, A. Fernández, A. Mostefaoui, G. Neiger, M. Raynal
Unreliable failure detectors are oracles that give information about process failures. Chandra and Toueg were first to study such failure detectors for distributed systems, and they identified a...
Anonymous publish/subscribe in p2p networks (2003)
A. K. Dattaz, M. Gradinariu, M. Raynal, G. Simon
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information dissemination...
Distributed agreement and its relation with error-correcting codes (2002)
R. Friedman, A. Mostéfaoui, S. Rajsbaum, M. Raynal
Abstract. The condition based approach identifies sets of input vectors, called conditions, for which it is possible to design a protocol solving a distributed problem despite process crashes. This...
Consensus in Byzantine asynchronous systems (2000)
R. Baldoni, M. Raynal, L. Tanguy
This paper presents a consensus protocol resilient to Byzantine failures. It uses signed and certified messages and is based on two underlying failure detection modules. The first is an unreliable...
Deadline-Constrained Causal Order (2000)
L. Rodrigues, R. Baldoni, E. Anceaume, M. Raynal
A causal ordering protocol ensures that if two messages are causally related and have the same destination, they are delivered to the application in their sending order. Causal order strongly...
Shared State Consistency for Time-sensitive Distributed Applications (2000)
Krishnaswamy, Vijaykumar, Ahamad, Mustaque, Bakken, David E., Raynal, M. (Michel)
Distributed applications that share dynamically changing state are increasingly being deployed in wide-area environments. Such applications must access the state in a consistent manner, but the...
Consistent Checkpointing in Distributed Databases: Towards a Formal Approach (1999)
Baldoni, R., Quaglia, F., Raynal, M.
Whether it is for audit or for recovery purposes, data checkpointing is an important problem of distributed database systems. Actually, transactions establish dependence relations on data checkpoints...
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour (1999)
Guerraoui, R., Hurfin, M., Mostefaoui, A., Oliveira, R., Raynal, M., Schiper, A., ...
It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is on the Consensus problem. It...
Consensus in Asynchronous Distributed Systems: a Concise Guided Tour (1999)
R. Guerraoui, M. Hurfin, A. Mostefaoui, R. Oliveira, M. Raynal, A. Schiper
It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is on the Consensus problem. It...
From Serializable to Causal Transactions for Collaborative Applications (1996)
G. Thia-kime, M. Raynal, M. Raynal, M. Ahamad, M. Ahamad, ...
: Serializability is the traditional consistency criterion when shared objects are accessed concurrently. Its main drawback lies in the strong synchronization constraints it imposes on execution of...
M. Raynal, G. Thia-kime, M. Ahamad, Projet Adp
: Serializability is the traditional consistency criterion when shared objects are accessed concurrently. Its main drawback lies in the strong synchronization constraints it imposes on execution of...
R. Baldoni, R. Prakash, M. Raynal, M. Singhal, Projet Adp
: \Delta-causal ordering is a communication abstraction designed for distributed applications whose messages (i) have to be delivered according to causal ordering and (ii) have a limited lifetime...
A Suite Of Formal Definitions For Consistency Criteria In Distributed Shared Memories (1996)
A. Schiper, M. Raynal, M. Raynal
: A shared memory built on top of a distributed system constitutes a Distributed Shared Memory (DSM). If a lot of protocols implementing DSMs in various contexts have been proposed, no set of...
M. Mizuno, M. Raynal, M. Singhal, M. Hurfin, M. Hurfin, Projet Adp
: Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs. This paper presents two...
From Causal Consistency to Sequential Consistency in Shared Memory Systems (1995)
Sequential consistency and causal consistency constitute two of the main consistency criteria used to define the semantics of accesses in the shared memory model. An execution is sequentially...
From Causal Consistency to Sequential Consistency in Shared Memory Systems (1995)
M. Raynal, M. Raynal, A. Schiper, A. Schiper
apport de recherche
Sequential Consistency in Distributed Systems: Theory and Implementation (1995)
M. Raynal, J. Z. Zhou, M. Mizuno, M. Mizuno, Projet Adp
: Recently, distributed shared memory (DSM) systems have received much attention because such an abstraction simplifies programming. It has been shown that many practical applications using DSMs...
Logical Time: A Way to Capture Causality in Distributed Systems (1995)
Raynal Singhal Mars, M. Raynal, M. Raynal, M. Singhal, M. Singhal
: The concept of causality between events is fundamental to the design and analysis of parallel and distributed computing and operating systems. Usually causality is tracked using physical time, but...
M. Hurfin, M. Mizuno, M. Raynal, M. Singhal
Global predicate detection is a fundamental problem...
Logical Time: A Way to Capture Causality in Distributed Systems (1995)
M. Singhal, M. Raynal, M. Raynal
: The concept of causality between events is fundamental to the design and analysis of parallel and distributed computing and operating systems. Usually causality is tracked using physical time, but...
An Implementation of Global Flush Primitives Using Counters (1994)
M. Ahuja, M. Ahuja, M. Raynal, M. Raynal
: We present an implementation of Global-Flush Primitives using counters. This implementation costs comparable to the most lightweight implementation of causal ordering. Thus, at a comparable cost,...
: We present an implementation of Global-Flush Primitives using counters. This implementation costs comparable to the most lightweight implementation of causal ordering. Thus, at a comparable cost,...
On-the-Fly Replay: A Practical Paradigm and Its Implementation for Distributed Debugging (1994)
O. Gerstel, O. Gerstel, M. Hurfin, M. Hurfin, N. Plouzeau, N. Plouzeau, ...
: This paper presents a practical paradigm, called on-the-fly replay. This paradigm consists of running a distributed program twice at the same time: an original computation driving a twin execution...
Causal Deliveries In Unreliable Networks With Real-Time Delivery Constraints (1994)
R. Baldoni, A. Mostefaoui, M. Raynal, Projet Adp
: Causal order states that for any process the order in which it is delivered messages cannot violate the happened-before relation of the corresponding sendings. The aim of this communication...
Saez Vasquez, J., Raynal, M., Meza-Basso, L., Delseny, M.
Luis Meza-Basso. Departamento de Ciencias Biologicas, Programa de Biología vegetal, Universidad de Talca, 2 Norte 685, Casilla 747, Talca, Chile.
On-the-Fly Replay: A Practical Paradigm and Its Implementation for Distributed Debugging (1993)
O. Gerstel, M. Hurfin, N. Plouzeau, M. Raynal, S. Zaks
: This paper presents a practical paradigm, called on-the-fly replay. This paradigm consists of running a distributed program twice at the same time: an original computation driving a twin execution...
An Efficient Implementation of Sequentially Consistent Distributed Shared Memories (1993)
M. Mizuno, M. Mizuno, M. Raynal, M. Raynal, G. Singh, G. Singh, ...
: Recently, distributed shared memory systems have received much attention because such an abstraction simplifies programming. In this paper, we present a data consistency protocol for a distributed...
An Efficient Implementation Of Sequentially Consistent Distributed Shared Memories (1993)
M. Mizuno, M. Raynal, G. Singh, M.l. Neilsen, Projet Adp
: Recently, distributed shared memory systems have received much attention because such an abstraction simplifies programming. In this paper, we present a data consistency protocol for a distributed...
Termination Detection in a very General Distributed Computing Model (1993)
Termination detection constitutes one of the basic problems of distributed computing and many distributed algorithms have been proposed to solve it. But all these algorithms consider a very simple...
A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network (1988)
Helary, J. M., Plouzeau, N., Raynal, M.
A distributed algorithm for mutual exclusion is presented. No particular assumptions on the network topology are required, except connectivity; the communication graph may be arbitrary. The processes...
A rapeseed cold-inducible transcript encodes a phosphoenolpyruvate carboxykinase.
Sáez-Vásquez, J, Raynal, M, Delseny, M
We have isolated a clone corresponding to a new cold-regulated gene from a cDNA library made from rapeseed (Brassica napus cv Samourai) cold-acclimated etiolated seedlings. Sequence analysis and...
cDNA encoding a putative 10-kilodalton chaperonin from Arabidopsis thaliana.
Grellet, F, Raynal, M, Laudié, M, Cooke, R, Giraudat, J, Delseny, M
Parcy, F, Valon, C, Raynal, M, Gaubier-Comella, P, Delseny, M, Giraudat, J
The accumulation kinetics of 18 mRNAs were characterized during Arabidopsis silique development. These marker mRNAs could be grouped in distinct classes according to their coordinate temporal...
From Causal Consistency To Sequential Consistency In Shared Memory Systems
A. Schiper, M. Raynal, M. Raynal, Projet Adp
: Sequential consistency and causal consistency constitute two of the main consistency criteria used to define the semantics of accesses in the shared memory model. An execution is sequentially...
Broadcast with Time and Causality Constraints for Multimedia Applications
R. Baldoni, R. Baldoni, R. Prakash, R. Prakash, M. Raynal, M. Raynal, ...
: \Delta-causal ordering is a communication abstraction designed for distributed applications whose messages (i) have to be delivered according to causal ordering and (ii) have a limited lifetime...