Matteo Mordacchini

Learn More
Resource location or discovery is a key issue for Grid systems in which applications are composed of hardware and software resources that need to be located. Classical approaches to Grid resource location are either centralized or hierarchical and will prove inefficient as the scale of Grid systems rapidly increases. On the other hand, the Peer-to-Peer(More)
Resource management and scheduling of distributed, data-driven applications in a Grid environment are challenging problems. Although significant results were achieved in the past few years, the development and the proper deployment of generic, reliable, standard components present issues that still need to be completely solved. Interested domains include(More)
Efficient and robust system for accessing computational resources and managing job operations is a key component of any Grid framework designed to support large distributed computing environment. Computing Resource Execution and Management (CREAM) is a simple, minimal system designed to provide efficient processing of a large number of requests for(More)
Resource discovery in a grid environment is a critical problem, as a typical grid system includes a very large number of resources, which must be readily identified and accessed to run applications. Traditional grid discovery algorithms perform poorly, as they do not scale, nor allow grid-enabled applications to transparently query the whole set of grid(More)
Similarity search for content-based retrieval (where content can be any combination of text, image, audio/video, etc.) has gained importance in recent years, also because of the advantage of ranking the retrieved results according to their proximity to a query. However, to use similarity search in real world applications, we need to tackle the problem of(More)
The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutions are extensions of P2P DHT-based networks. We believe that these systems are not flexible enough in case the indexed data are very dynamic, i.e., the values of the resource(More)
Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building and maintaining the network topology itself as well as to support a pervasive diffusion of the information injected into the network. This is very useful in a world where there is a(More)
Resource discovery is a key issue for Grid systems in which applications are composed of hardware and software resources that need to be located. Classical approaches to Grid resource discovery are either centralized or hierarchical and will prove inefficient as the scale of Grid systems rapidly increases. On the other hand, the Peer-to-Peer (P2P) paradigm(More)
Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building and maintaining the network topology itself as well as to support a pervasive diffusion of the information injected into the network. This is very useful in a world where there is a(More)
The opportunistic data dissemination problem for mobile devices is an open topic that has attracted many investigations so far. At the best of our knowledge, none of these approaches takes into account the semantic side of the data shared in an opportunistic network. In this paper, we present an algorithm that, starting from the semantic data annotations(More)