A Theory of Distributed Objects

Asynchrony - Mobility - Groups - Components

By Denis Caromel , Ludovic Henrio , Luca Cardelli

A Theory of Distributed Objects Cover Image

  • ISBN13: 978-3-5402-0866-2
  • 384 Pages
  • User Level: Science
  • Publication Date: December 5, 2005
  • Available eBook Formats: PDF
  • eBook Price: $129.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
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
Table of Contents

Table of Contents

  1. Part I: Review: Analysis; Formalisms and Distributed Calculi.
  2. Part II: ASP Calculus: An Imperative Sequential Calculus; Asynchronous Sequential Processes; A Few Examples.
  3. Part III: Semantics and Properties: Parallel Semantics; Basic ASP Properties; Confluence Property; Determinancy.
  4. Part IV: A Few More Features: More Confluent Features; Non Confluent Features; Migration; Groups; Components; Channels and Reconfigurations.
  5. Part V: Implementation Strategies: A Java API for ASP: ProActive; Future Update; Loosing Rendezvous; Controlling Pipelining; Garbage Collection.
  6. Part VI: Final Words: ASP versus other Concurrent Calculi; Conclusion.
  7. Appendix: Equivalence Modulo Future Updates; Confluence Proofs.
Errata

Please Login to submit errata.

No errata are currently published