Distributed search structures are useful for parallel databases and in maintaining distributed storage systems. In this paper we discuss some issues in the design and implementation of distributed B-trees, such as methods for low-overhead synchronization of tree restructuring, node mobility and replication strategies. We have implemented a distributed B-tree that replicates the index and also p...

Data replication is crucial in enhancing data availability and reducing access latency cloud computing. This paper presents a dynamic duplicate management method for storage systems based on the Inverted Ant Colony Optimization (IACO) algorithm fuzzy logic system. The proposed approach optimizes decisions focusing energy consumption, response time, cost. Extensive simulations demonstrate that I...

It is a great challenge to map network processing tasks to processing resources of advanced network processors, which are heterogeneous and multi-threading multiprocessor System-on-Chip. This paper proposes a novel scheduling algorithm, called Replication-based Partial Dynamic Scheduling (RPDS). It aims to improve the NP performance by combining the strategies of partial dynamic mapping and tas...

The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...

For distributed applications requiring collaboration, responsive and transparent interactivity is highly desired. Though such interactivity can be achieved with optimistic replication, maintaining replica consistency is difficult. To support efficient implementations of collaborative applications, this paper extends a few representative abstract data types (ADTs), such as arrays, hash tables, a...

extended kalman filtering (ekf) is a nonlinear dynamic data reconciliation (nddr) method. one of its main advantages is its suitability for on-line applications. this paper presents an on-line nddr method using ekf. it is implemented for two case studies, temperature measurements of a distillation column and concentration measurements of a cstr. in each time step, random numbers with zero mean ...

Sharing research data is becoming increasingly important as it enables peers to validate and reproduce data driven experiments. Also exchanging data allows scientists to reuse data in different contexts and gather new knowledge from available sources. But with increasing volume of data, researchers need to reference exact versions of datasets. Until now access to research data often based on si...

Grid, Replication, Consistency Maintenance, Limd Refer ences Satyarth Kumar Singh 2008, Efficient grid scheduling algorithm based on priority queues, Thapar University, Patiala. Kavitha Ranganathan and Ian Foster 2007, Identifying Dynamic Replication Strategies for a High-Performance Data Grid, the University of Chicago.

Data growth in recent years has been swift, leading to the emergence of big data science. Distributed File Systems (DFS) are commonly used handle data, like Google System (GFS), Hadoop (HDFS), and others. The DFS should provide availability reliability system case failure. replicates files different locations reliability. These replications consume storage space other resources. importance thes...