Distributed Computing: 12th International Symposium, DISC'98, Andros, Greece, September 24 -26, 1998, Proceedings: Lecture Notes in Computer Science, cartea 1499
Editat de Shay Kuttenen Limba Engleză Paperback – 11 sep 1998
The 28 revised papers presented were carefully reviewed and selected from a total of 87 submissions. Also included are one invited paper and two abstracts of invited contributions. The papers address all currect issues of distributed systems, in particular Internet-based computing, shared-memory systems, ATM networks, security aspects, Java process coordination, network protocols, wait-free systems, shared objects, resource allocation, and distributed objects.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 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ț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 339.47 lei
Preț vechi: 424.34 lei
-20% Nou
Puncte Express: 509
Preț estimativ în valută:
64.96€ • 67.41$ • 54.30£
64.96€ • 67.41$ • 54.30£
Carte tipărită la comandă
Livrare economică 18 martie-01 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540650669
ISBN-10: 3540650660
Pagini: 440
Ilustrații: XII, 428 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540650660
Pagini: 440
Ilustrații: XII, 428 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Sense of direction in distributed computing.- Top-down considerations on distributed computing.- Inter-task co-ordination in long-lived distributed applications.- Seamlessly selecting the best copy from internet-wide replicated web servers.- Wait-free synchronization in quantum-based multiprogrammed systems.- Computing in totally anonymous asynchronous shared memory systems.- Transient fault detectors.- Directed virtual path layouts in ATM networks.- A decision-theoretic approach to reliable message delivery.- Propagation and leader election in a multihop broadcast environment.- The arrow distributed directory protocol.- Efficient Byzantine agreement secure against general adversaries.- Long-lived, fast, waitfree renaming with optimal name space and high throughput.- The compactness of interval routing for almost all graphs.- A wait-free classification of loop agreement tasks.- A stabilizing repair timer.- Java: Memory consistency and process coordination.- A complete and constant time wait-free implementation of CAS from LL/SC and vice versa.- Failure detection and consensus in the crash-recovery model.- A more committed quorum-based three phase commit protocol.- Multicast group communication as a base for a load-balancing replicated data service.- Efficient deadlock-free multi-dimensional interval routing in interconnection networks.- A new protocol for efficient cooperative transversal Web caching.- Fairness of shared objects.- Optimistic Atomic Broadcast.- Approximate agreement with mixed mode faults: Algorithm and lower bound.- Using remote access histories for thread scheduling in distributed shared memory systems.- The Bancomat problem: An example of resource allocation in a partitionable asynchronous system.- Lifetime based consistency protocols for distributedobjects.- Deriving a scalable algorithm for mutual exclusion.- OFC: A distributed fossil-collection algorithm for Time-Warp.
Caracteristici
Includes supplementary material: sn.pub/extras