Catálogo de publicaciones - libros
Dependable Computing: Second Latin-American Symposium, LADC 2005, Salvador, Brazil, October 25-28, 2005, Proceedings
Carlos Alberto Maziero ; João Gabriel Silva ; Aline Maria Santos Andrade ; Flávio Morais de Assis Silva (eds.)
En conferencia: 2º Latin-American Symposium on Dependable Computing (LADC) . Salvador de Bahia, Brazil . October 25, 2005 - October 28, 2005
Resumen/Descripción – provisto por la editorial
No disponible.
Palabras clave – provistas por la editorial
Theory of Computation; Special Purpose and Application-Based Systems; System Performance and Evaluation; Software Engineering; Logic Design; Coding and Information Theory
Disponibilidad
Institución detectada | Año de publicación | Navegá | Descargá | Solicitá |
---|---|---|---|---|
No detectada | 2005 | SpringerLink |
Información
Tipo de recurso:
libros
ISBN impreso
978-3-540-29572-3
ISBN electrónico
978-3-540-32092-0
Editor responsable
Springer Nature
País de edición
Reino Unido
Fecha de publicación
2005
Información sobre derechos de publicación
© Springer-Verlag Berlin Heidelberg 2005
Cobertura temática
Tabla de contenidos
doi: 10.1007/11572329_21
Latin-American Workshop on Dependable Automation Systems
Herman Augusto Lepikson; Leandro Buss Becker
Automation systems play an important role in the economy of most industrialized countries. One prominent feature of such systems relates to dependability, as unexpected crashes can both put human-life in danger and cause massive money looses. The first Latin-American Workshop on Dependable Automation Systems (WDAS) aims to provide an opportunity for researchers and industrial partners to discuss problems related to the development of safe-critical automation systems.
- Workshops | Pp. 262-262
doi: 10.1007/11572329_22
Software Architectures for Dependable Systems
Rogério de Lemos; Paulo Asterio de Castro Guerra
Although there is a large body of research in dependability, architectural level reasoning about dependability is only just emerging as an important theme in software development. This is due to the fact that dependability concerns are often left until too late in the process of development. In addition, the complexity of emerging applications and the trend of building trustworthy systems from existing untrustworthy components are urging dependability concerns to be considered at the architectural level.
- Tutorials | Pp. 263-264
doi: 10.1007/11572329_23
Fault-Tolerant Techniques for Concurrent Objects
Rachid Guerraoui; Michel Raynal
Devising wait-free resilient implementations of concurrent objects from fault-prone base objects is a fundamental challenge of computer science. Wait-free means that any process that invokes an operation eventually receives a reply after executing a finite number of its own steps, even if other processes are arbitrarily slow or even failed. Resilience means that the implementation of the concurrent object behaves correctly despite the failure of up to t base objects (t being a threshold parameter a priori defined). The tutorial surveys different techniques to build wait-free resilient implementations of concurrent objects. Three complementary classes of techniques are presented: (1) fault-tolerance “by replication”, (2) fault-tolerance “by diversity”, and (3) fault-tolerance “by oracle”, respectively. The first is the well-known redundancy technique and its applicability depends on the kinds of faults that the objects can suffer. The second consists in combining the base objects with objects of other types (type refers here to a programming language notion: the type has to be powerful enough to allow implementing resilient objects). This technique basically relies on the universality of consensus objects. The third technique relies on the information we can obtain about the operational status of the processes.
- Tutorials | Pp. 265-265
doi: 10.1007/11572329_24
Agreement Protocols in Environments with Temporal Uncertainties
Fabíola Gonçalves Pereira Greve
Agreement protocols are fundamental for the design of dependable systems. They ensure consistent cooperation among distributed entities, helping both to keep the continuity of services in spite of failures and to enhance performance. Consensus is the greatest common denominator among all agreement problems. It allows a set of processes to agree on a common output value. Theoretical advances have been reached, thanks to the consensus problem solutions through the use of unreliable failure detectors, which have been proved to be essential in solving many other agreement problems in environments with temporal uncertainties. Such advances have been exploited in order to (i) find efficient solutions to agreement problems, (ii) identify minimal synchronous conditions for their solution and (iii) characterize more precisely their behavior (blocking or progression) in presence of network disturbs. From a software engineering view point, consensus-based protocols give rise to simple and modular solutions. Basic components () are identified in order to construct richer ones (). These components are in turn the fundamental pieces of middleware for reliable distributed programming.
- Tutorials | Pp. 266-266