By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yi Jiang ; Dept of Comput. Sci. & Eng., Shanghai Jiao Tong Univ. ; Guangtao Xue ; Zhaoqing Jia ; Jinyuan You

In this paper, we introduce a Linda (Carriero et al., 1989) like peer-to-peer tuple space middleware build on top of distributed hash table Tuples. With the help of DTuples, the development of the distributed cooperation and coordination task would be simplified. The decoupled style of tuple space (Carriero and Gelemter, 2001) model is useful in peer-to-peer environment. In the application level, the DTuples was used instead of the publish/subscribe model and message-passing 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

Published in:

Grid and Cooperative Computing, 2006. GCC 2006. Fifth International Conference

Date of Conference:

Oct. 2006