Paper Title
Computational Elements for Distributed Data Structures on Overlay Networks

Advances in applications and computing have led to increases in the scale complexity of overlay networks. The sophisticated applications in the field of high-performance com-puting have created a need to organize data structures within computing centers so as to benefit from advanced distributed data graphs and distributed . In previous works, we presented distributed data schemes which offer a storage layer on P2P networks. In this paper, we integrate our distributed data graph with the computational elements, which allows the dynamic updating of the data in P2P networks and this also extends the functionality of the distributed data scheme. In the evaluation, we compare between 4 different kinds of distributed computing. The procative method which called “push without timer” shows the best results, while “pull without time” performs worst. With our computational distributed graph approach, large scale computations in p2p networks will become possible.