Name: Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions (en Inglés)
Price: 332882.00 COP
Availability: InStock
Author: Raynal, Michel
ISBN: 9783031792014

portada Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions (en Inglés)

Formato

Libro Físico

Autor

Michel Raynal

Editorial

Springer

Idioma

Inglés

N° páginas

115

Encuadernación

Tapa Blanda

Dimensiones

23.5 x 19.1 x 0.8 cm

Peso

0.25 kg.

ISBN13

9783031792014

N° edición

Categorías

Teoría de la información
Bases de datos
Arquitectura de la información

Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions (en Inglés)

Michel Raynal (Autor) · Springer · Tapa Blanda

Libro Nuevo

$ 332.882

$ 554.804

Ahorras: $ 221.922

40% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Jueves 18 de Julio y el Jueves 01 de Agosto.

Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.

Reseña del libro "Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions (en Inglés)"

Theory is what remains true when technology is changing. So, it is important to know and master the basic concepts and the theoretical tools that underlie the design of the systems we are using today and the systems we will use tomorrow. This means that, given a computing model, we need to know what can be done and what cannot be done in that model. Considering systems built on top of an asynchronous read/write shared memory prone to process crashes, this monograph presents and develops the fundamental notions that are universal constructions, consensus numbers, distributed recursivity, power of the BG simulation, and what can be done when one has to cope with process anonymity and/or memory anonymity. Numerous distributed algorithms are presented, the aim of which is being to help the reader better understand the power and the subtleties of the notions that are presented. In addition, the reader can appreciate the simplicity and beauty of some of these algorithms.