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.
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.

Extensions of the UNITY Methodology: Compositionality, Fairness and Probability in Parallelism
178
Extensions of the UNITY Methodology: Compositionality, Fairness and Probability in Parallelism
178Paperback(1995)
Product Details
ISBN-13: | 9783540591733 |
---|---|
Publisher: | Springer Berlin Heidelberg |
Publication date: | 05/12/1995 |
Series: | Lecture Notes in Computer Science , #908 |
Edition description: | 1995 |
Pages: | 178 |
Product dimensions: | 6.10(w) x 9.25(h) x 0.02(d) |