An Innovative Approach of Data Grid Consistency Using Tree-Based Clustering
Abstract
Index Terms
- An Innovative Approach of Data Grid Consistency Using Tree-Based Clustering
Recommendations
Hybrid Negotiation Mechanism for Resolution Conflicts between Replicas in Data Grid
MUE '08: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous EngineeringLarge scale systems such as computational Grid are distributed computing infrastructure that can provide globally available network resources. Grid computing has emerged as a framework for supporting complex compilations over large data sets. In general,...
A Divide-and-Conquer Approach for Minimum Spanning Tree-Based Clustering
Due to their ability to detect clusters with irregular boundaries, minimum spanning tree-based clustering algorithms have been widely used in practice. However, in such clustering algorithms, the search for nearest neighbor in the construction of ...
Dynamic replication in a data grid using a Modified BHR Region Based Algorithm
Grid computing is emerging as a key part of the infrastructure for a wide range of disciplines in science and engineering, including astronomy, high energy physics, molecular biology and earth sciences. These applications handle large data sets that ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
IEEE Computer Society
United States
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0