top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalit√† di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Introduction to distributed algorithms / Gerard Tel.
Introduction to distributed algorithms / Gerard Tel.
Creatore [Tel, Gerard]
Estensione xii, 534 p. : ill. ; 26 cm.
Disciplina 005.2
ISBN 0521470692 (text) :
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-002243004
[Tel, Gerard]  
Materiale a stampa
Lo trovi qui: New York University
Topics in distributed algorithms / Gerard Tel.
Topics in distributed algorithms / Gerard Tel.
Creatore [Tel, Gerard]
Estensione x, 240 p. : ill. ; 26 cm.
ISBN 0521403766
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UPENN-9916514053503681
[Tel, Gerard]  
Materiale a stampa
Lo trovi qui: University of Pennsylvania
Distributed Algorithms [electronic resource] : 8th International Workshop, WDAG 1994, Terschelling, The Netherlands, September 29 - October 1, 1994. Proceedings / by Gerard Tel, Paul Vitanyi
Distributed Algorithms [electronic resource] : 8th International Workshop, WDAG 1994, Terschelling, The Netherlands, September 29 - October 1, 1994. Proceedings / by Gerard Tel, Paul Vitanyi
Creatore [Tel, Gerard]
Accesso persona Vitanyi, Paul
Accesso ente SpringerLink (Online service)
Soggetto non controllato Computer Science
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Computer Communication Networks
Operating Systems
Programming Techniques
Special Purpose and Application-Based Systems
ISBN 9783540584490
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-7355270
[Tel, Gerard]  
Software
Lo trovi qui: University of Chicago
Introduction to distributed algorithms / Gerard Tel.
Introduction to distributed algorithms / Gerard Tel.
Creatore [Tel, Gerard]
Edizione [2nd ed.]
Estensione xii, 596 p. ; 25 cm.
Disciplina 005.2/76
ISBN 0521794838
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Introduction: Distributed Systems -- Pt. 1. Protocols -- 2. The Model -- 3. Communication Protocols -- 4. Routing Algorithms -- 5. Deadlock-free Packet Switching -- Pt. 2. Fundamental Algorithms -- 6. Wave and Traversal Algorithms -- 7. Election Algorithms -- 8. Termination Detection -- 9. Anonymous Networks -- 10. Snapshots -- 11. Sense of Direction and Orientation -- 12. Synchrony in Networks -- Pt. 3. Fault Tolerance -- 13. Fault Tolerance in Distributed Systems -- 14. Fault Tolerance in Asynchronous Systems -- 15. Fault Tolerance in Synchronous Systems -- 16. Failure Detection -- 17. Stabilization -- Pt. 4. Appendices -- A. Pseudocode Conventions -- B. Graphs and Networks.
Record Nr. UCHICAGO-4358228
[Tel, Gerard]  
Materiale a stampa
Lo trovi qui: University of Chicago
Introduction to distributed algorithms / Gerard Tel.
Introduction to distributed algorithms / Gerard Tel.
Creatore [Tel, Gerard, author]
Edizione [Second edition.]
Estensione 1 online resource (xii, 596 pages) : digital, PDF file(s).
Disciplina 005.2/76
ISBN 9781139168724 (ebook)
9780521794831 (paperback)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1 Introduction: Distributed Systems 1 -- 1.2 Architecture and Languages 18 -- 1.3 Distributed Algorithms 26 -- 1.4 Outline of the Book 36 -- Part 1 Protocols 41 -- 2 Model 43 -- 2.1 Transition Systems and Algorithms 44 -- 2.2 Proving Properties of Transition Systems 50 -- 2.3 Causal Order of Events and Logical Clocks 54 -- 2.4 Additional Assumptions, Complexity 64 -- 3 Communication Protocols 74 -- 3.1 Balanced Sliding-window Protocol 76 -- 3.2 A Timer-based Protocol 85 -- 4 Routing Algorithms 103 -- 4.1 Destination-based Routing 105 -- 4.2 All-pairs Shortest-path Problem 110 -- 4.3 Netchange Algorithm 123 -- 4.4 Routing with Compact Routing Tables 132 -- 4.5 Hierarchical Routing 149 -- 5 Deadlock-free Packet Switching 155 -- 5.2 Structured Solutions 158 -- 5.3 Unstructured Solutions 167 -- Part 2 Fundamental Algorithms 179 -- 6 Wave and Traversal Algorithms 181 -- 6.1 Definition and Use of Wave Algorithms 182 -- 6.2 A Collection of Wave Algorithms 190 -- 6.3 Traversal Algorithms 202 -- 6.4 Time Complexity: Depth-first Search 208 -- 7 Election Algorithms 227 -- 7.2 Ring Networks 232 -- 7.3 Arbitrary Networks 245 -- 7.4 Korach-Kutten-Moran Algorithm 260 -- 8 Termination Detection 268 -- 8.2 Computation Trees and Forests 276 -- 8.3 Wave-based Solutions 284 -- 9 Anonymous Networks 307 -- 9.2 Deterministic Algorithms 317 -- 9.3 A Probabilistic Election Algorithm 323 -- 9.4 Computing the Network Size 327 -- 10 Snapshots 335 -- 10.2 Two Snapshot Algorithms 340 -- 10.3 Using Snapshot Algorithms 344 -- 10.4 Application: Deadlock Detection 349 -- 11 Sense of Direction and Orientation 356 -- 11.2 Election in Rings and Chordal Rings 364 -- 11.3 Computing in Hypercubes 374 -- 11.4 Complexity-related Issues 386 -- 12 Synchrony in Networks 396 -- 12.2 Election in Synchronous Networks 404 -- 12.3 Synchronizer Algorithms 408 -- 12.4 Application: Breadth-first Search 414 -- 12.5 Archimedean Assumption 420 -- Part 3 Fault Tolerance 425 -- 13 Fault Tolerance in Distributed Systems 427 -- 13.1 Reasons for Using Fault-tolerant Algorithms 427 -- 13.2 Robust Algorithms 429 -- 13.3 Stabilizing Algorithms 435 -- 14 Fault Tolerance in Asynchronous Systems 437 -- 14.1 Impossibility of Consensus 437 -- 14.2 Initially Dead Processes 442 -- 14.3 Deterministically Achievable Cases 445 -- 14.4 Probabilistic Consensus Algorithms 451 -- 14.5 Weak Termination 462 -- 15 Fault Tolerance in Synchronous Systems 469 -- 15.1 Synchronous Decision Protocols 470 -- 15.2 Authenticating Protocols 481 -- 15.3 Clock Synchronization 493 -- 16 Failure Detection 505 -- 16.2 Solving Consensus with a Weakly Accurate Detector 510 -- 16.3 Eventually Weakly Accurate Detectors 511 -- 16.4 Implementation of Failure Detectors 515 -- 17 Stabilization 520 -- 17.2 Graph Algorithms 526 -- 17.3 Methodology for Stabilization 535 -- A Pseudocode Conventions 551 -- B Graphs and Networks 556.
Record Nr. STANFORD-a12742944
[Tel, Gerard, author]  
Materiale a stampa
Lo trovi qui: Stanford University
Introduction to distributed algorithms / Gerard Tel.
Introduction to distributed algorithms / Gerard Tel.
Creatore [Tel, Gerard]
Edizione [2nd ed.]
Estensione xii, 596 p. ; 25 cm.
Disciplina 005.2/76
ISBN 0521794838
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UMICH-004126681
[Tel, Gerard]  
Materiale a stampa
Lo trovi qui: University of Michigan Ann Arbor
Introduction to distributed algorithms / Gerard Tel.
Introduction to distributed algorithms / Gerard Tel.
Creatore [Tel, Gerard]
Estensione xii, 534 p. : ill. ; 26 cm.
Disciplina 005.2
ISBN 0521470692 (hardback)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-001710998
[Tel, Gerard]  
Materiale a stampa
Lo trovi qui: Duke University
Introduction to distributed algorithms / Gerard Tel.
Introduction to distributed algorithms / Gerard Tel.
Creatore [Tel, Gerard]
Edizione [2nd ed.]
Estensione 1 online resource (xii, 596 pages)
Disciplina 005.2/76
Genere/Forma Electronic books
ISBN 9781139168724
113916872X
0521794838
9780521794831
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1 Introduction: distributed systems -- 1.2 Architecture and languages -- 1.3 Distributed algorithms -- 1.4 Outline of the book -- Part 1 Protocols -- 2 Model -- 2.1 Transition systems and algorithms -- 2.2 Proving properties of transition systems -- 2.3 Causal order of events and logical clocks -- 2.4 Additional assumptions, complexity -- 3 Communication protocols -- 3.1 Balanced sliding-window protocol -- 3.2 A timer-based protocol -- 4 Routing algorithms -- 4.1 Destination-based routing -- 4.2 All-pairs shortest-path problem -- 4.3 Netchange algorithm -- 4.4 Routing with compact routing tables -- 4.5 Hierarchical routing -- 5 Deadlock-free packet switching -- 5.2 Structured solutions -- 5.3 Unstructured solutions -- Part 2 Fundamental algorithms -- 6 Wave and traversal algorithms -- 6.1 Definition and use of wave algorithms -- 6.2 A collection of wave algorithms -- 6.3 Traversal algorithms -- 6.4 Time complexity: depth-first search -- 7 Election algorithms -- 7.2 Ring networks -- 7.3 Arbitrary networks -- 7.4 Korach-Kutten-Moran algorithm -- 8 Termination detection -- 8.2 Computation trees and forests -- 8.3 Wave-based solutions -- 9 Anonymous networks -- 9.2 Deterministic algorithms -- 9.3 A probabilistic election algorithm -- 9.4 Computing the network size -- 10 Snapshots -- 10.2 Two snapshot algorithms -- 10.3 Using snapshot algorithms -- 10.4 Application: deadlock detection -- 11 Sense of direction and orientation -- 11.2 Election in rings and chordal rings -- 11.3 Computing in hypercubes -- 11.4 Complexity-related issues -- 12 Synchrony in networks -- 12.2 Election in synchronous networks -- 12.3 Synchronizer algorithms -- 12.4 Application: breadth-first search -- 12.5 Archimedean assumption -- Part 3 Fault tolerance -- 13 Fault tolerance in distributed systems -- 13.1 Reasons for using fault-tolerant algorithms -- 13.2 Robust algorithms -- 13.3 Stabilizing algorithms -- 14 Fault tolerance in asynchronous systems -- 14.1 Impossibility of consensus -- 14.2 Initially dead processes -- 14.3 Deterministically achievable cases -- 14.4 Probabilistic consensus algorithms -- 14.5 Weak termination -- 15 Fault tolerance in synchronous systems -- 15.1 Synchronous decision protocols -- 15.2 Authenticating protocols -- 15.3 Clock synchronization -- 16 Failure detection -- 16.2 Solving consensus with a weakly accurate detector -- 16.3 Eventually weakly accurate detectors -- 16.4 Implementation of failure detectors -- 17 Stabilization -- 17.2 Graph algorithms -- 17.3 Methodology for stabilization -- A pseudocode conventions -- B Graphs and networks.
Record Nr. NYU-004816628
[Tel, Gerard]  
Materiale a stampa
Lo trovi qui: New York University
Introduction to distributed algorithms / Gerard Tel.
Introduction to distributed algorithms / Gerard Tel.
Creatore [Tel, Gerard]
Estensione xii, 534 p. : ill. ; 26 cm.
Disciplina 005.2
ISBN 0521470692 (hardback)
9780521470698 (hardback)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a2976853
[Tel, Gerard]  
Materiale a stampa
Lo trovi qui: Stanford University
Topics in distributed algorithms / Gerard Tel.
Topics in distributed algorithms / Gerard Tel.
Creatore [Tel, Gerard]
Estensione x, 240 p. : ill. ; 26 cm.
ISBN 0521403766
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-002007345
[Tel, Gerard]  
Materiale a stampa
Lo trovi qui: New York University