Article ID Journal Published Year Pages File Type
426054 Future Generation Computer Systems 2012 10 Pages PDF
Abstract

Many application scenarios have a read-dominated behaviour of information provision, which means that there are few updates, and that users execute frequent queries for information discovery. Discovery of content in such systems could benefit from the use of summary techniques in order to facilitate the discovery process and minimise the size of the data exchanged. This is particularly applicable within Grid computing environments where nodes (representing a group of computational and storage resources), which enable jobs to reach them may need to exchange metadata with each other about their resources. We introduce network-aware summarisation algorithms for the resource discovery in P2P-content networks, which are based on Cobweb clustering. We identify how summarisation can improve the discovery process while also improving the accuracy of the discovered resource(s). Metrics based on precision–recall are used to compare the accuracy for specific types of queries generated over the summarised content.

► Content summarisation for resource discovery in large-scale Computational Grid. ► Using a peer-to-peer-based communication protocol to provide a very large scalability. ► Network awareness reduces the job processing time through the discovery of close nodes. ► Reduced lookup time by applying a content summarisation technique. ► Precision–recall metric to evaluate the quality of the discovery.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , , , ,