A. Alvarez

Universidad de Las Palmas de Gran Canaria, Las Palmas, Canary Islands, Spain

Are you A. Alvarez?

Claim your profile

Publications (4)0 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: Drago is an experimental Ada extension designed to facilitate the implementation of fault-tolerant and cooperative distributed applications. It is the result of an effort to impose discipline and give linguistic support to the main concepts of the group communication paradigm. In this paper we focus our attention on the Drago linguistic support for the implementation of distributed cooperative applications. We introduce Drago and give some simple examples of its use
    Parallel and Distributed Processing, 2001. Proceedings. Ninth Euromicro Workshop on; 02/2001
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper describes a library written in Ada which facilitates the construction of fault-tolerant distributed applications based on the active replication paradigm [18]. The library, called Group_IO [10], offers a simple interface to the implementation of reliable, atomic, causal, and uniform multicast. The work on Group_IO has been motivated by our experience with Isis [3] and similar reliable multicast frameworks. The library allows also client-server interactions where the client may be a group — this interaction is not supported by ISIS- and relies on an own consensus protocol [8, 9] to implement the uniform broadcast protocols. Group_IO is the base on which the programming language Drago [2, 15, 16] has been implemented, however it does not require Drago for its use.
    06/1997: pages 230-243;
  • Cabernet'94 Workshop. 03/1994;
  • [Show abstract] [Hide abstract]
    ABSTRACT: A number of current distributed applications require the use of consensus protocols. Two well known examples are fault-tolerant applications built with process replicas in need to agree on their external behavior, and systems of replicated data where consistency has to be maintained.In this paper we first present an already known consensus protocol which has a cost of O(n2) in the number of exchanged messages, and O(n) in terms of time needed to arrive at an agreement. We then present several refinements to this protocol which make it linear-in the absence of failures-both in terms of exchanged messages and in time spent, and conclude with some remarks on current and future work.
    Microprocessing and Microprogramming 12/1993; 39(2-5):111-114.