Damià Castellà Martínez

Learn More
This paper proposes an efficient and scalable computational resource discovery overlay orientated towards P2P computing. Our proposal gathers the peers into markets according to their computational resources. Each market is arranged in an N-tree and the trees are linked by a Bruijn graph. The tree topology allows efficient searching of available resources(More)
Peer-to-Peer (P2P) computing, the harnessing of idle CPU cycles through the Internet, offers new research challenges in the domain of distributed computing. This paper proposes an efficient, dynamic and scalable overlay orientated towards P2P computing, called DisCoP. Our proposal gathers the peers into markets according to their computational resources.(More)
This paper proposes a distributed computing architecture using the P2P paradigm. Our proposal gathers the peers into markets according to their computational resources. Each market is arranged in an N-tree and the trees are linked by a Bruijn graph. The tree topology allows efficient searching of available resources in a specific market, while Bruijn(More)
Peer-to-Peer (P2P) computing, the harnessing of idle compute cycles through the Internet, allows computing resources from ordinary users to be shared in an open access. In this framework, the dynamic resource management offers new research challenges in the domain of distributed computing. This paper proposes a distributed computing architecture using the(More)
CodiP2P and DisCoP are two peer-to-peer (P2P) computing overlays aimed at sharing computing resources (CPU, Memory, etc.) to execute parallel applications. Their component nodes are basically PC’s and a wide range of computer servers, desktops or laptops. This paper joins these two platforms into a new one, DisCoP2P, to combine the features from both(More)
  • 1