The Experts below are selected from a list of 36 Experts worldwide ranked by ideXlab platform

Michel Raynal - One of the best experts on this subject based on the ideXlab platform.

  • A Simple Object that Spans the Whole Consensus Hierarchy
    Parallel Processing Letters, 2018
    Co-Authors: Achour Mostefaoui, Matthieu Perrin, Michel Raynal
    Abstract:

    This paper presents a simple generalization of the basic atomic read/write Register Object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This Object, whose definition is natural, is a sliding window Register of size k. Its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy. Hence, this short article should be seen as a simple pedagogical introduction to Herlihy’s consensus hierarchy. The paper also shows that the consensus number of a ledger Object is [Formula: see text].

  • A Simple Object that Spans the Whole Consensus Hierarchy
    Parallel Processing Letters, 2018
    Co-Authors: Achour Mostefaoui, Matthieu Perrin, Michel Raynal
    Abstract:

    This paper presents a simple generalization of the basic atomic read/write Register Object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This Object, whose definition is natural, is a sliding window Register of size k. Its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy. Hence, this short article should be seen as a simple pedagogical introduction to Herlihy's consensus hierarchy.

  • A Simple Object that Spans the Whole Consensus Hierarchy
    arXiv: Distributed Parallel and Cluster Computing, 2018
    Co-Authors: Achour Mostefaoui, Matthieu Perrin, Michel Raynal
    Abstract:

    This paper presents a simple generalization of the basic atomic read/write Register Object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This Object, whose definition is pretty natural, is a sliding window Register of size k. Its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy. Hence, this short article must be seen as a simple pedagogical introduction to Herlihy's consensus hierarchy.

  • Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn
    IEEE Transactions on Parallel and Distributed Systems, 2012
    Co-Authors: Roberto Baldoni, Silvia Bonomi, Michel Raynal
    Abstract:

    Due to their capability to hide the complexity generated by the messages exchanged between processes, shared Objects are one of the main abstractions provided to developers of distributed applications. Implementations of such Objects, in modern distributed systems, have to take into account the fact that almost all services, implemented on top of distributed infrastructures, are no longer fully managed due to either their size or their maintenance cost. Therefore, these infrastructures exhibit several autonomic behaviors in order to, for example, tolerate failures and continuous arrival and departure of nodes (churn phenomenon). Among all the shared Objects, the Register Object is a fundamental one. Several protocols have been proposed to build fault resilient Registers on top of message-passing system, but, unfortunately, failures are not the only challenge in modern distributed systems and new issues arise in the presence of churn. This paper addresses the construction of a multiwriter/multireader regular Register in an eventually synchronous distributed system affected by the continuous arrival/departure of participants. In particular, a general protocol implementing a regular Register is proposed and feasibility conditions associated with the arrival and departure of the processes are given. The protocol is proved correct under the assumption that a constraint on the churn is satisfied.

  • SIROCCO - Regular Register: an implementation in a churn prone environment
    Structural Information and Communication Complexity, 2009
    Co-Authors: Roberto Baldoni, Silvia Bonomi, Michel Raynal
    Abstract:

    Due to their capability to hide the complexity generated by the messages exchanged between processes, shared Objects are one of the main abstractions provided to the developers of distributed applications. Among all the shared Objects, the Register Object is fundamental. Several protocols have been proposed to build fault resilient Registers on top of message-passing system, but, unfortunately, failure are not the only challenge in modern distributed systems. New issues arise from the dynamicity introduced in the system by the continuous arrival and departure of nodes (churn phenomenon). This paper addresses the construction of a single writer/multiple readers regular Register in a distributed system affected by the continuous arrival/departure of participants. In particular, a general protocol implementing a regular Register is proposed and feasibility conditions on the arrival and departure of the processes are given. Interestingly, the protocol is proved correct under the assumption that the constraint on the churn is satisfied.

Roberto Baldoni - One of the best experts on this subject based on the ideXlab platform.

  • Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn
    IEEE Transactions on Parallel and Distributed Systems, 2012
    Co-Authors: Roberto Baldoni, Silvia Bonomi, Michel Raynal
    Abstract:

    Due to their capability to hide the complexity generated by the messages exchanged between processes, shared Objects are one of the main abstractions provided to developers of distributed applications. Implementations of such Objects, in modern distributed systems, have to take into account the fact that almost all services, implemented on top of distributed infrastructures, are no longer fully managed due to either their size or their maintenance cost. Therefore, these infrastructures exhibit several autonomic behaviors in order to, for example, tolerate failures and continuous arrival and departure of nodes (churn phenomenon). Among all the shared Objects, the Register Object is a fundamental one. Several protocols have been proposed to build fault resilient Registers on top of message-passing system, but, unfortunately, failures are not the only challenge in modern distributed systems and new issues arise in the presence of churn. This paper addresses the construction of a multiwriter/multireader regular Register in an eventually synchronous distributed system affected by the continuous arrival/departure of participants. In particular, a general protocol implementing a regular Register is proposed and feasibility conditions associated with the arrival and departure of the processes are given. The protocol is proved correct under the assumption that a constraint on the churn is satisfied.

  • SIROCCO - Regular Register: an implementation in a churn prone environment
    Structural Information and Communication Complexity, 2009
    Co-Authors: Roberto Baldoni, Silvia Bonomi, Michel Raynal
    Abstract:

    Due to their capability to hide the complexity generated by the messages exchanged between processes, shared Objects are one of the main abstractions provided to the developers of distributed applications. Among all the shared Objects, the Register Object is fundamental. Several protocols have been proposed to build fault resilient Registers on top of message-passing system, but, unfortunately, failure are not the only challenge in modern distributed systems. New issues arise from the dynamicity introduced in the system by the continuous arrival and departure of nodes (churn phenomenon). This paper addresses the construction of a single writer/multiple readers regular Register in a distributed system affected by the continuous arrival/departure of participants. In particular, a general protocol implementing a regular Register is proposed and feasibility conditions on the arrival and departure of the processes are given. Interestingly, the protocol is proved correct under the assumption that the constraint on the churn is satisfied.

Silvia Bonomi - One of the best experts on this subject based on the ideXlab platform.

  • Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn
    IEEE Transactions on Parallel and Distributed Systems, 2012
    Co-Authors: Roberto Baldoni, Silvia Bonomi, Michel Raynal
    Abstract:

    Due to their capability to hide the complexity generated by the messages exchanged between processes, shared Objects are one of the main abstractions provided to developers of distributed applications. Implementations of such Objects, in modern distributed systems, have to take into account the fact that almost all services, implemented on top of distributed infrastructures, are no longer fully managed due to either their size or their maintenance cost. Therefore, these infrastructures exhibit several autonomic behaviors in order to, for example, tolerate failures and continuous arrival and departure of nodes (churn phenomenon). Among all the shared Objects, the Register Object is a fundamental one. Several protocols have been proposed to build fault resilient Registers on top of message-passing system, but, unfortunately, failures are not the only challenge in modern distributed systems and new issues arise in the presence of churn. This paper addresses the construction of a multiwriter/multireader regular Register in an eventually synchronous distributed system affected by the continuous arrival/departure of participants. In particular, a general protocol implementing a regular Register is proposed and feasibility conditions associated with the arrival and departure of the processes are given. The protocol is proved correct under the assumption that a constraint on the churn is satisfied.

  • SIROCCO - Regular Register: an implementation in a churn prone environment
    Structural Information and Communication Complexity, 2009
    Co-Authors: Roberto Baldoni, Silvia Bonomi, Michel Raynal
    Abstract:

    Due to their capability to hide the complexity generated by the messages exchanged between processes, shared Objects are one of the main abstractions provided to the developers of distributed applications. Among all the shared Objects, the Register Object is fundamental. Several protocols have been proposed to build fault resilient Registers on top of message-passing system, but, unfortunately, failure are not the only challenge in modern distributed systems. New issues arise from the dynamicity introduced in the system by the continuous arrival and departure of nodes (churn phenomenon). This paper addresses the construction of a single writer/multiple readers regular Register in a distributed system affected by the continuous arrival/departure of participants. In particular, a general protocol implementing a regular Register is proposed and feasibility conditions on the arrival and departure of the processes are given. Interestingly, the protocol is proved correct under the assumption that the constraint on the churn is satisfied.

Achour Mostefaoui - One of the best experts on this subject based on the ideXlab platform.

  • A Simple Object that Spans the Whole Consensus Hierarchy
    Parallel Processing Letters, 2018
    Co-Authors: Achour Mostefaoui, Matthieu Perrin, Michel Raynal
    Abstract:

    This paper presents a simple generalization of the basic atomic read/write Register Object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This Object, whose definition is natural, is a sliding window Register of size k. Its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy. Hence, this short article should be seen as a simple pedagogical introduction to Herlihy’s consensus hierarchy. The paper also shows that the consensus number of a ledger Object is [Formula: see text].

  • A Simple Object that Spans the Whole Consensus Hierarchy
    Parallel Processing Letters, 2018
    Co-Authors: Achour Mostefaoui, Matthieu Perrin, Michel Raynal
    Abstract:

    This paper presents a simple generalization of the basic atomic read/write Register Object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This Object, whose definition is natural, is a sliding window Register of size k. Its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy. Hence, this short article should be seen as a simple pedagogical introduction to Herlihy's consensus hierarchy.

  • A Simple Object that Spans the Whole Consensus Hierarchy
    arXiv: Distributed Parallel and Cluster Computing, 2018
    Co-Authors: Achour Mostefaoui, Matthieu Perrin, Michel Raynal
    Abstract:

    This paper presents a simple generalization of the basic atomic read/write Register Object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This Object, whose definition is pretty natural, is a sliding window Register of size k. Its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy. Hence, this short article must be seen as a simple pedagogical introduction to Herlihy's consensus hierarchy.

Matthieu Perrin - One of the best experts on this subject based on the ideXlab platform.

  • A Simple Object that Spans the Whole Consensus Hierarchy
    Parallel Processing Letters, 2018
    Co-Authors: Achour Mostefaoui, Matthieu Perrin, Michel Raynal
    Abstract:

    This paper presents a simple generalization of the basic atomic read/write Register Object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This Object, whose definition is natural, is a sliding window Register of size k. Its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy. Hence, this short article should be seen as a simple pedagogical introduction to Herlihy’s consensus hierarchy. The paper also shows that the consensus number of a ledger Object is [Formula: see text].

  • A Simple Object that Spans the Whole Consensus Hierarchy
    Parallel Processing Letters, 2018
    Co-Authors: Achour Mostefaoui, Matthieu Perrin, Michel Raynal
    Abstract:

    This paper presents a simple generalization of the basic atomic read/write Register Object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This Object, whose definition is natural, is a sliding window Register of size k. Its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy. Hence, this short article should be seen as a simple pedagogical introduction to Herlihy's consensus hierarchy.

  • A Simple Object that Spans the Whole Consensus Hierarchy
    arXiv: Distributed Parallel and Cluster Computing, 2018
    Co-Authors: Achour Mostefaoui, Matthieu Perrin, Michel Raynal
    Abstract:

    This paper presents a simple generalization of the basic atomic read/write Register Object, whose genericity parameter spans the whole set of integers and is such that its k-parameterized instance has exactly consensus number k. This Object, whose definition is pretty natural, is a sliding window Register of size k. Its interest lies in its simplicity and its genericity dimension which provides a global view capturing the whole consensus hierarchy. Hence, this short article must be seen as a simple pedagogical introduction to Herlihy's consensus hierarchy.