000 03399nam a22005175i 4500
001 978-3-540-27245-8
003 DE-He213
005 20161121230527.0
007 cr nn 008mamaa
008 100301s2005 gw | s |||| 0|eng d
020 _a9783540272458
_9978-3-540-27245-8
024 7 _a10.1007/b138812
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aCaromel, Denis.
_eauthor.
245 1 2 _aA Theory of Distributed Objects
_h[electronic resource] :
_bAsynchrony — Mobility — Groups — Components /
_cby Denis Caromel, Ludovic Henrio.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2005.
300 _aXXXII, 352 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aReview -- 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.
520 _aDistributed 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputers.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aSoftware Engineering.
700 1 _aHenrio, Ludovic.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540208662
856 4 0 _uhttp://dx.doi.org/10.1007/b138812
912 _aZDB-2-SCS
950 _aComputer Science (Springer-11645)
999 _c500096
_d500096