Show simple item record

dc.contributor.authorMiranda Bueno, Alberto
dc.contributor.authorCortés, Toni
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2015-06-08T10:05:57Z
dc.date.available2015-06-08T10:05:57Z
dc.date.created2014
dc.date.issued2014
dc.identifier.citationMiranda, A.; Cortes, A. CRAID: Online RAID upgrades using dynamic hot data reorganization. A: USENIX Conference on File and Storage Technologies. "Proceedings of the 12th USENIX Conference on File and Storage Technologies: February 17-20, 2014, Santa Clara, CA". Santa Clara, CA: USENIX Association, 2014, p. 133-146.
dc.identifier.isbn978-1-931971-08-9
dc.identifier.urihttp://hdl.handle.net/2117/28208
dc.description.abstractCurrent algorithms used to upgrade RAID arrays typically require large amounts of data to be migrated, even those that move only the minimum amount of data required to keep a balanced data load. This paper presents CRAID, a self-optimizing RAID array that performs an online block reorganization of frequently used, long-term accessed data in order to reduce this migration even further. To achieve this objective, CRAID tracks frequently used, long-term data blocks and copies them to a dedicated partition spread across all the disks in the array. When new disks are added, CRAID only needs to extend this process to the new devices to redistribute this partition, thus greatly reducing the overhead of the upgrade process. In addition, the reorganized access patterns within this partition improve the array’s performance, amortizing the copy overhead and allowing CRAID to offer a performance competitive with traditional RAIDs. We describe CRAID’s motivation and design and we evaluate it by replaying seven real-world workloads including a file server, a web server and a user share. Our experiments show that CRAID can successfully detect hot data variations and begin using new disks as soon as they are added to the array. Also, the usage of a dedicated partition improves the sequentiality of relevant data access, which amortizes the cost of reorganizations. Finally, we prove that a full-HDD CRAID array with a small distributed partition (<1.28% per disk) can compete in performance with an ideally restriped RAID-5 and a hybrid RAID-5 with a small SSD cache.
dc.format.extent14 p.
dc.language.isoeng
dc.publisherUSENIX Association
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshRAID (Computer science)
dc.subject.lcshComputer storage devices
dc.titleCRAID: Online RAID upgrades using dynamic hot data reorganization
dc.typeConference report
dc.subject.lemacOrdinadors -- Memòries
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://www.usenix.org/system/files/conference/fast14/fast14-paper_miranda.pdf
dc.rights.accessOpen Access
drac.iddocument15448349
dc.description.versionPostprint (published version)
upcommons.citation.authorMiranda, A.; Cortes, A.
upcommons.citation.contributorUSENIX Conference on File and Storage Technologies
upcommons.citation.pubplaceSanta Clara, CA
upcommons.citation.publishedtrue
upcommons.citation.publicationNameProceedings of the 12th USENIX Conference on File and Storage Technologies: February 17-20, 2014, Santa Clara, CA
upcommons.citation.startingPage133
upcommons.citation.endingPage146


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder