On a Method of Multiprogramming
Autor W H J Feijen, A J M van Gasterenen Limba Engleză Hardback – 11 iun 1999
Preț: 963.57 lei
Preț vechi: 1204.46 lei
-20%
Puncte Express: 1445
Preț estimativ în valută:
170.25€ • 195.72$ • 147.84£
170.25€ • 195.72$ • 147.84£
Carte tipărită la comandă
Livrare economică 13-27 mai
Specificații
ISBN-13: 9780387988702
ISBN-10: 038798870X
Pagini: 370
Ilustrații: XX, 370 p.
Dimensiuni: 160 x 241 x 26 mm
Greutate: 0.76 kg
Ediția:1999 edition
Editura: Springer
Locul publicării:New York, NY, United States
ISBN-10: 038798870X
Pagini: 370
Ilustrații: XX, 370 p.
Dimensiuni: 160 x 241 x 26 mm
Greutate: 0.76 kg
Ediția:1999 edition
Editura: Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
1 On Our Computational Model.- 2 Our Program Notation and Its Semantics.- 3 The Core of the Owicki/Gries Theory.- 4 Two Disturbing Divergences.- 5 Bridling the Complexity.- 6 Co-assertions and Strengthening the Annotation.- 7 Three Theorems and Two Examples.- 8 Synchronization and Total Deadlock.- 9 Individual Progress and the Multibound.- 10 Concurrent Vector Writing.- 11 More Theorems and More Examples.- 12 The Yellow Pages.- 13 The Safe Sluice.- 14 Peterson’s Two-Component Mutual Exclusion Algorithm.- 15 Re-inventing a Great Idea.- 16 On Handshake Protocols.- 17 Phase Synchronization for Two Machines.- 18 The Parallel Linear Search.- 19 The Initialization Protocol.- 20 Co-components.- 21 The Initialization Protocol Revisited.- 22 The Non-Blocking Write Protocol.- 23 Mutual Inclusion and Synchronous Communication.- 24 A Simple Election Algorithm.- 25 Peterson’s General Mutual Exclusion Algorithm.- 26 Monitored Phase Synchronization.- 27 Distributed Liberal Phase Synchronization.- 28 Distributed Computation of a Spanning Tree.- 29 Shmuel Safra’s Termination Detection Algorithm.- 30 The Alternating Bit Protocol.- 31 Peterson’s Mutual Exclusion Algorithm Revisited.- 32 Epilogue.- References.