DTuplesHPC: distributed tuple space for desktop high performance computing

Authors:
Yi Jiang;Guangtao Xue;Minglu Li;Jinyuan You
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.R. China
Venue:
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Year:
2006

Citing 6
Cited 0

Guest Editor's Introduction: Domesticating Parallelism

Computer
Solving the Linda multiple rd problem using the copy-collect primitive

Science of Computer Programming
A computational model of everything

Communications of the ACM
OpenDHT: a public DHT service and its uses

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
DTuples: A Distributed Hash Table based Tuple Space Service for Distributed Coordination

GCC '06 Proceedings of the Fifth International Conference on Grid and Cooperative Computing
A peer-to-peer framework for robust execution of message passing parallel programs on grids

PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.