Distributed Algorithms: 7th International Workshop, WDAG `93, Lausanne, Switzerland, September 27-29, 1993. Proceedings: Lecture Notes in Computer Science, cartea 725
Editat de Andre Schiperen Limba Engleză Paperback – 8 sep 1993
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 341.95 lei
- 20% Preț: 369.12 lei
- 20% Preț: 645.28 lei
- 20% Preț: 591.51 lei
- 15% Preț: 580.46 lei
- Preț: 410.88 lei
- 20% Preț: 504.57 lei
- Preț: 381.21 lei
- 20% Preț: 340.32 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 538.29 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 238.01 lei
- 17% Preț: 360.19 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 596.46 lei
- 15% Preț: 438.59 lei
- 20% Preț: 655.02 lei
- 20% Preț: 649.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 310.26 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 326.98 lei
- 20% Preț: 825.93 lei
- 17% Preț: 427.22 lei
- 20% Preț: 763.23 lei
- 20% Preț: 350.21 lei
- 20% Preț: 307.71 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 20% Preț: 343.62 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 353.50 lei
- 20% Preț: 607.39 lei
Preț: 334.71 lei
Preț vechi: 418.38 lei
-20% Nou
Puncte Express: 502
Preț estimativ în valută:
64.06€ • 66.63$ • 53.69£
64.06€ • 66.63$ • 53.69£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540572718
ISBN-10: 3540572716
Pagini: 340
Ilustrații: IX, 331 p.
Dimensiuni: 216 x 279 x 18 mm
Greutate: 0.48 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540572716
Pagini: 340
Ilustrații: IX, 331 p.
Dimensiuni: 216 x 279 x 18 mm
Greutate: 0.48 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Efficient wait-free implementation of a concurrent priority queue.- Binary snapshots.- Linear-time snapshot protocols for unbalanced systems.- Towards a necessary and sufficient condition for wait-free synchronization (Extended Abstract).- Efficient algorithms for checking the atomicity of a run of read and write operations.- Benign failure models for shared memory.- Generalized agreement between concurrent fail-stop processes.- Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract).- Asynchronous epoch management in replicated databases.- Crash resilient communication in dynamic networks.- Distributed job scheduling using snapshots.- Optimal time self stabilization in dynamic systems.- Tolerating transient and permanent failures (extended abstract).- Quick atomic broadcast.- Time bounds for decision problems in the presence of timing uncertainty and failures.- Boolean Routing.- Notes on sorting and counting networks (extended abstract).- A simple, efficient algorithm for maximum finding on rings.- Wang tilings and distributed orientation on anonymous torus networks (extended abstract).- Fairness of N-party synchronization and its implementation in a distributed environment.- Programming distributed reactive systems: A strong and weak synchronous coupling.- Using message semantics to reduce rollback in the time warp mechanism.