A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Informed prefetching and caching
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
On the performance issues of object-based buffering
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
A Comparison of Two Strategies of Dynamic Data Prefetching in Software DSM
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
IP SAN " From iSCSI to IP-Addressable Ethernet Disks
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Group-Based Management of Distributed File Caches
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The Panasas ActiveScale Storage Cluster: Delivering Scalable High Bandwidth Storage
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
The performance impact of kernel prefetching on buffer cache replacement algorithms
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
DULO: an effective buffer cache management scheme to exploit both temporal and spatial locality
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Context-aware prefetching at the storage server
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Hi-index | 0.00 |
The prefetching strategies used in modern distributed storage systems generally are based on temporal and/or spatial locality of requests Due to the special properties of object-based storage systems, however, the traditional tactics are almost incompetent for the job This paper presents a new prefetching approach, which takes the correlationship among objects into account Two orthogonal replica distribution algorithms are proposed to aggregate prefetching operations A moving window mechanism is also developed to control prefetching We implement these approaches in our object-based file system called NBJLOFS (abbreviated for Nankai-Baidu Joint Lab Object-based File System) The experimental results show that these approaches improves throughput by up to 80%.