このページのリンク

A Theory of Distributed Objects : Asynchrony - Mobility - Groups - Components / by Denis Caromel, Ludovic Henrio

データ種別 電子ブック
1st ed. 2005.
出版者 (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年 2005
大きさ XXXII, 352 p : online resource
著者標目 *Caromel, Denis author
Henrio, Ludovic author
SpringerLink (Online service)

所蔵情報を非表示

URL
射水-電子 007 EB0003328 Computer Scinece R0 2005-6,2022-3

9783540272458

書誌詳細を非表示

一般注記 Review -- Analysis -- Formalisms and Distributed Calculi -- ASP Calculus -- An Imperative Sequential Calculus -- Asynchronous Sequential Processes -- A Few Examples -- Semantics and Properties -- Parallel Semantics -- Basic ASP Properties -- Confluence Property -- Determinacy -- A Few More Features -- More Confluent Features -- Non-Confluent Features -- Migration -- Groups -- Components -- Channels and Reconfigurations -- Implementation Strategies -- A Java API for ASP: ProActive -- Future Update -- Loosing Rendezvous -- Controlling Pipelining -- Garbage Collection -- Final Words -- ASP Versus Other Concurrent Calculi -- Conclusion -- Epilogue
Distributed and communicating objects are becoming ubiquitous. In global, Grid and Peer-to-Peer computing environments, extensive use is made of objects interacting through method calls. So far, no general formalism has been proposed for the foundation of such systems. Caromel and Henrio are the first to define a calculus for distributed objects interacting using asynchronous method calls with generalized futures, i.e., wait-by-necessity -- a must in large-scale systems, providing both high structuring and low coupling, and thus scalability. The authors provide very generic results on expressiveness and determinism, and the potential of their approach is further demonstrated by its capacity to cope with advanced issues such as mobility, groups, and components. Researchers and graduate students will find here an extensive review of concurrent languages and calculi, with comprehensive figures and summaries. Developers of distributed systems can adopt the many implementation strategies that are presented and analyzed in detail. Preface by Luca Cardelli
HTTP:URL=https://doi.org/10.1007/b138812
件 名 LCSH:Computer science
LCSH:Machine theory
LCSH:Software engineering
FREE:Theory of Computation
FREE:Computer Science Logic and Foundations of Programming
FREE:Formal Languages and Automata Theory
FREE:Software Engineering
分 類 LCC:QA75.5-76.95
DC23:004.0151
書誌ID EB00002716
ISBN 9783540272458

 類似資料