Extensions of the UNITY Methodology [electronic resource] : Compositionality, Fairness and Probability in Parallelism / edited by Josyula Ramachandra Rao.

By: Rao, Josyula Ramachandra [editor.]Contributor(s): SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 908Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1995Description: XI, 178 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540492191Subject(s): Computer science | Software engineering | Logic design | Distribution (Probability theory) | Statistics | Computer Science | Programming Techniques | Software Engineering | Programming Languages, Compilers, Interpreters | Logics and Meanings of Programs | Probability Theory and Stochastic Processes | Statistics, generalAdditional physical formats: Printed edition:: No titleDDC classification: 005.11 LOC classification: QA76.6-76.66Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

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.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha