The data grid technology, which uses the scale of the Internet to solve storage limitation for the huge amount of data, has become one of the hot research topics. Recently, data replication strategies have been widely employed in distributed environment to copy frequently accessed data in suitable sites. The primary purposes are shortening distance of file transmission and achieving files from ...

In this work, we propose a new mining-based file caching scheme for a hybrid storage disk system. In particular, we focus our efforts on reducing the latency of launching applications. The proposed scheme identifies correlated file accesses in a file access sequence via sequential pattern mining algorithm. Our scheme caches correlated files together to maximize the caching efficiency. The corre...

The modest I/O configurations and file system limitations of many current high-performance systems preclude solution of problems with large I/O needs. I/O hardware and file system parallelism is the key to achieve high performance. We analyze the I/O behavior of several versions of two scientific applicationson the Intel Paragon XP/S. The versions involve incremental application code enhancemen...

The modest I/O configurations and file system limitations of many current high-performance systems preclude solution of problems with large I/O needs. I/O hardware and file system parallelism is the key to achieve high performance. We analyze the I/O behavior of several versions of two scientific applicationson the Intel Paragon XP/S. The versions involve incremental application code enhancemen...

In cloud storage systems, replica is a key technology, which reduces access time lag, network bandwidth consumption and system unreliability. However, an inadequate replica consistency management mechanism would cause problems for cloud storage systems in the time lag of file access and network bandwidth consumption. Therefore, this paper proposes a self-adaptive replica consistency strategy wh...

The problem of multidisk partial match file design is a file allocation problem among multiple independently accessible disks so that, for all possible partial match queries, maximal disk access concurrency can be obtained. Since this problem has been shown to be NP-hard, there are a few heuristic methods based upon the Disk Modulo (DM) allocation method [5,6,9]. The file systems proposed for t...

Most modern I/O systems treat each file access independently. However, events in a computer system are driven by programs. Thus, accesses to files occur in consistent patterns and are by no means independent. The result is that modern I/O systems ignore useful information. Using traces of file system activity we show that file accesses are strongly correlated with preceding accesses. In fact, a...