Please use this identifier to cite or link to this item:
|Title:||DWC2: A dynamic weight-based cooperative caching scheme for object-based storage cluster||Authors:||Wei, Q.
|Issue Date:||2008||Citation:||Wei, Q., Veeravalli, B., Zeng, L. (2008). DWC2: A dynamic weight-based cooperative caching scheme for object-based storage cluster. Proceedings - IEEE International Conference on Cluster Computing, ICCC : 167-174. ScholarBank@NUS Repository. https://doi.org/10.1109/CLUSTR.2008.4663768||Abstract:||Object-Based Storage is emerging as a next generation of distributed storage technology. Aiming at improving the performance and load-balancing of large-scale object-based storage system, we present a dynamic weight-based cooperative caching scheme referred to as DWC2, which allows an object-based storage device (OSD) to use the available free cache of the neighbouring OSD. Our proposed DWC2 replaces objects based on their weights which is a function of object size, popularity and replica number, and dynamically partitions the memory of OSD into local cache and remote cache according to activity workload. An object data is cached in local cache or remote cache of the cooperative OSDs, thus increasing cache hit ratio, reducing expensive disk access time as well as improving load balance. We benchmarked our proposed DWC2 with existing cooperative caching schemes under various OSD environments. Our rigorous experiment results conclusively demonstrate that our DWC2 is scalable and can achieve a significant cache hit ratio, average response time, and load balancing for large-scale OSD cluster. © 2008 IEEE.||Source Title:||Proceedings - IEEE International Conference on Cluster Computing, ICCC||URI:||http://scholarbank.nus.edu.sg/handle/10635/83655||ISBN:||9781424426409||ISSN:||15525244||DOI:||10.1109/CLUSTR.2008.4663768|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 13, 2019
checked on Sep 7, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.