Distributed abstract data types

Authors:
Gian Pietro Picco;Matteo Migliavacca;Amy L. Murphy;Gruia-Catalin Roman
Affiliations:
Dip di Elettronica e Informazione, Politecnico di Milano, Italy;Dip di Elettronica e Informazione, Politecnico di Milano, Italy;Faculty of Informatics, University of Lugano, Switzerland;Dept of Computer Science and Engineering, Washington Univ in St Louis
Venue:
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Year:
2006

Citing 8
Cited 0

Programming with sets; an introduction to SETL

Programming with sets; an introduction to SETL
Fine-grained mobility in the Emerald system

ACM Transactions on Computer Systems (TOCS)
Understanding Code Mobility

IEEE Transactions on Software Engineering
Toward a model for shared data abstraction with performance

Journal of Parallel and Distributed Computing - Parallel and distributed data structures
LIME: Linda meets mobility

Proceedings of the 21st international conference on Software engineering
Concurrent aggregates (CA)

PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Spatial Programming Using Smart Messages: Design and Implementation

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Programming ad-hoc networks of mobile and resource-constrained devices

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce the concept of Distributed Abstract Data Type (dadt), a new programming model simplifying the development of distributed, context-aware applications A dadt instance logically encapsulates a collection of adt instances distributed throughout the system dadt operations specify the semantics of access to this distributed state by using dedicated programming constructs The scope of these operations can be restricted using dadtviews, i.e., projections over the target adt instances, defined declaratively and dynamically based on adt properties Interestingly, dadt constructs can be used to deal not only with application data, but also with the space where it resides This leads to a uniform treatment of the data and space concerns, simplifying the development of context-aware applications and providing the programmer with considerable flexibility and expressive power We argue that dadts are amenable to incorporation in existing object-oriented programming languages, as demonstrated by our prototype implementation.