|
|
|
|
LEADER |
03416nam a22005175i 4500 |
001 |
978-3-540-27245-8 |
003 |
DE-He213 |
005 |
20151204173034.0 |
007 |
cr nn 008mamaa |
008 |
100301s2005 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540272458
|9 978-3-540-27245-8
|
024 |
7 |
|
|a 10.1007/b138812
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UY
|2 bicssc
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
072 |
|
7 |
|a COM031000
|2 bisacsh
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
100 |
1 |
|
|a Caromel, Denis.
|e author.
|
245 |
1 |
2 |
|a A Theory of Distributed Objects
|h [electronic resource] :
|b Asynchrony — Mobility — Groups — Components /
|c by Denis Caromel, Ludovic Henrio.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
300 |
|
|
|a XXXII, 352 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
505 |
0 |
|
|a 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.
|
520 |
|
|
|a 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.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Software Engineering.
|
700 |
1 |
|
|a Henrio, Ludovic.
|e author.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540208662
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b138812
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
950 |
|
|
|a Computer Science (Springer-11645)
|