DTuplesHPC: Distributed Tuple Space for Desktop High Performance Computing

  • Yi Jiang
  • Guangtao Xue
  • Minglu Li
  • Jinyuan You
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4186)


This paper introduces a Linda [2] like peer-to-peer tuple space middleware build on top of distributed hash table – DTuplesHPC. This tuple space middleware is capable of being a high performance computing platform. And the decoupled style of tuple space [1] model is used instead of the message-passing model that is widely used in MPI based high performance computing. With the help of tuple space model, the distributed computing can be liberated from architectural consideration. First, the DTuples platform allows the dynamic organization of the computing resources. That is to say, the job can be submitted at any time, but the computation resources may be ready later. The time and space are all decoupled in DTuplesHPC. Second, it brings the simple tuple space programming model to the large-scale high performance computing at desktop. In our design, the in(), rd(), out(), copy-collect() and eval() primitives are supported. In this paper, we present the key design concepts of the DTuples.


High Performance Computing Active Object Distribute Hash Table Code Fragment Tuple Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Carriero, N., Gelernter, D.: A computational model of everything. Commun. ACM 44(11), 77–81 (2001)CrossRefGoogle Scholar
  2. 2.
    Carriero, N., Gelernter, D.: Linda: some current work. In: Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage, Digest of Papers, February 27– March 3, pp. 98–101 (1989)Google Scholar
  3. 3.
    Gelernter, D.: Domesticating Parallelism. IEEE Computer 19(8), 12–16 (1986)Google Scholar
  4. 4.
    Rhea, S., Godfrey, B., Karp, B., Kubiatowicz, J., Ratnasamy, S., Shenker, S., Stoica, I., Yu, H.: OpenDHT: A Public DHT Service and Its Uses. In: Proceedings of ACM SIGCOMM 2005 (August 2005)Google Scholar
  5. 5.
    Jini network technology (2005),
  6. 6.
    Sun Microsystems. JavaSpaces Specification (March 2005),
  7. 7.
    Genaud, S., Rattanapoka, C.: A Peer-to-Peer Framework for Robust Execution of Message Passing Parallel Programs on Grids. In: Di Martino, B., Kranzlmüller, D., Dongarra, J. (eds.) EuroPVM/MPI 2005. LNCS, vol. 3666, pp. 276–284. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Jiang, Y., Xue, G., You, J.: DTuples: A Distributed Hash Table based Tuple Space Service for Distributed Coordination. In: Proceedings of 5th International Conference on Grid and Cooperative Computing (to appear)Google Scholar
  9. 9.
    FreePastry (2006),
  10. 10.
    Rowstron, A., Wood, A.: Solving the Linda multiple rd problem using the copy-collect primitive. Science of Computer Programming 31(2-3), 335–358 (1998)MATHCrossRefGoogle Scholar
  11. 11.
  12. 12.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yi Jiang
    • 1
  • Guangtao Xue
    • 1
  • Minglu Li
    • 1
  • Jinyuan You
    • 1
  1. 1.Department of Computer Science and EngineeringShanghai Jiao Tong UniversityP.R. China

Personalised recommendations