DTuples: A Distributed Hash Table based Tuple Space Service for Distributed Coordination

Authors:
Yi Jiang;Guangtao Xue;Zhaoqing Jia;Jinyuan You
Affiliations:
Shanghai Jiao Tong University, China;Shanghai Jiao Tong University, China;Shanghai Jiao Tong University, China;Shanghai Jiao Tong University, China
Venue:
GCC '06 Proceedings of the Fifth International Conference on Grid and Cooperative Computing
Year:
2006

Citing 0
Cited 3

Introducing the concept of customizable structured spaces for agent coordination in the production automation domain

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Contextual Data Management and Retrieval: A Self-Organized Approach

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
DTuplesHPC: distributed tuple space for desktop high performance computing

ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a Linda [3] like peerto- peer tuple space middleware build on top of distributed hash table -- DTuples. With the help of DTuples, the development of the distributed cooperation and coordination task would be simplified. The decoupled style of tuple space [2] model is useful in peer-to-peer environment. In the application level, the DTuples was used instead of the publish/subscribe model and messagepassing model. In low level, the DTuples service can be used as cooperation middleware and context-aware middleware. The tuples in the DTuples are stored in distributed hash table based peer-to-peer tuple storage. In our current work, the in(), rd(), out() and copy-collect() primitives are supported. The eval() primitive will be added to D-Tuples in the future. In this paper, we present the key design concepts of DTuples.