Cantitate/Preț
Produs

Extensions of the UNITY Methodology: Compositionality, Fairness and Probability in Parallelism: Lecture Notes in Computer Science, cartea 908

Autor Josyula R. Rao
en Limba Engleză Paperback – 6 apr 1995
This monograph extends and generalizes the UNITY methodology, introduced in the late 1980s by K. Mani Chandy and Jayadev Misra as a formalism aiding in the specification and verification of parallel programs, in several directions.
This treatise further develops the ideas behind UNITY in order to explore and understand the potential and limitations of this approach: first UNITY is applied to formulate and tackle problems in parallelism such as compositionality; second, the logic and notation of UNITY is generalized in order to increase its range of applicability; finally, paradigms and abstractions useful for the design of probabilistic parallel algorithms are developed. Taken together the results presented reaffirm the promise of UNITY as a versatile medium for treating many problems of parallelism.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32744 lei

Preț vechi: 40930 lei
-20% Nou

Puncte Express: 491

Preț estimativ în valută:
6266 6502$ 5238£

Carte tipărită la comandă

Livrare economică 17-31 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540591733
ISBN-10: 3540591737
Pagini: 196
Ilustrații: XI, 178 p.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.28 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Prologue.- Preliminaries.- An introduction to UNITY.- The role of commutativity in parallel program design.- On the design of proof rules for fair parallel programs.- Reasoning about probabilistic parallel programs.- Eventual determinism: Using probabilistic means to achieve deteministic ends.- Epilogue.