On a Method of Multiprogramming | Buch

Cover: 9780387988702 | On a Method of Multiprogramming | W. H. J. Feijen (u. a.) | Buch | XX

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

160,49 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

Among all the interests in parallelism, there is an essential and fundamental one that has remained largely unexplored, namely the question of how to design parallel programs from their specification. And that is what this book is about. It proposes a method for the formal development of parallel programs - multiprograms as we have preferred to call them -, and it does so with a minimum of formal gear, viz. with the predicate calculus and with the meanwhile well-established theory of Owicki and Gries. The fact that one can get away with just this theory will probably not convey anything to the uninitiated, but it may all the more come as a surprise to those who were exposed earlier to correctness of multiprograms. Contrary to common belief, the Owicki/Gries theory can indeed be effectively put to work for the formal development of multiprograms, regardless of whether these algorithms are distributed or not. That is what we intend to exemplify with this book.

Zusammenfassung

Even with all the interest in parallelism and parallel processing, there is still something missing. This book is about how to design parallel programs from their specification. It follows from the Owicki/Gries theory and can be put to work for the formal development of multiprograms regardless of whether these algorithms are distributed or not.

Inhaltsverzeichnis

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.

Erscheinungsjahr:	1999
Genre:	Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Buch
Reihe:	Monographs in Computer Science
Inhalt:	xx 370 S.
ISBN-13:	9780387988702
ISBN-10:	038798870X
Sprache:	Englisch
Ausstattung / Beilage:	HC runder Rücken kaschiert
Einband:	Gebunden
Autor:	Feijen, W. H. J. Gasteren, A. J. M. Van
Hersteller:	Springer New York Springer US, New York, N.Y. Monographs in Computer Science
Maße:	241 x 160 x 26 mm
Von/Mit:	W. H. J. Feijen (u. a.)
Erscheinungsdatum:	11.06.1999
Gewicht:	0,758 kg

Ähnliche Produkte