| 書(shū)目名稱 | Extensions of the UNITY Methodology |
| 副標(biāo)題 | Compositionality, Fa |
| 編輯 | Josyula Ramachandra Rao |
| 視頻video | http://file.papertrans.cn/320/319866/319866.mp4 |
| 叢書(shū)名稱 | Lecture Notes in Computer Science |
| 圖書(shū)封面 |  |
| 描述 | 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. |
| 出版日期 | Book 1995 |
| 關(guān)鍵詞 | Algorithms; Parallel Programming; Probabilistic Parallel Algorithms; Probabilistische Parallele Algorit |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-59173-7 |
| isbn_softcover | 978-3-540-59173-3 |
| isbn_ebook | 978-3-540-49219-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1995 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-11 17:28
發(fā)表于 2025-3-21 19:28:51
