Loading…
Exploiting redundancy to boost performance in a RAID-10 style cluster-based file system
While aggregating the throughput of existing disks on cluster nodes is a cost-effective approach to alleviate the I/O bottleneck in cluster computing, this approach suffers from potential performance degradations due to contentions for shared resources on the same node between storage data processin...
Saved in:
Published in: | Cluster computing 2006-10, Vol.9 (4), p.433-447 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c304t-1c27b0fc8e14f0a1def2888a994db2aa519ffad6c576972fa80f0c8f8cbcb59b3 |
---|---|
cites | cdi_FETCH-LOGICAL-c304t-1c27b0fc8e14f0a1def2888a994db2aa519ffad6c576972fa80f0c8f8cbcb59b3 |
container_end_page | 447 |
container_issue | 4 |
container_start_page | 433 |
container_title | Cluster computing |
container_volume | 9 |
creator | Zhu, Yifeng Jiang, Hong Qin, Xiao Feng, Dan Swanson, David R. |
description | While aggregating the throughput of existing disks on cluster nodes is a cost-effective approach to alleviate the I/O bottleneck in cluster computing, this approach suffers from potential performance degradations due to contentions for shared resources on the same node between storage data processing and user task computation. This paper proposes to judiciously utilize the storage redundancy in the form of mirroring existed in a RAID-10 style file system to alleviate this performance degradation. More specifically, a heuristic scheduling algorithm is developed, motivated from the observations of a simple cluster configuration, to spatially schedule write operations on the nodes with less load among each mirroring pair. The duplication of modified data to the mirroring nodes is performed asynchronously in the background. The read performance is improved by two techniques: doubling the degree of parallelism and hot-spot skipping. A synthetic benchmark is used to evaluate these algorithms in a real cluster environment and the proposed algorithms are shown to be very effective in performance enhancement. |
doi_str_mv | 10.1007/s10586-006-0011-6 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29088713</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2920226029</sourcerecordid><originalsourceid>FETCH-LOGICAL-c304t-1c27b0fc8e14f0a1def2888a994db2aa519ffad6c576972fa80f0c8f8cbcb59b3</originalsourceid><addsrcrecordid>eNpdkE1LxDAQhoMouK7-AG8BwVt0kn4kOS7rri4sCKJ4DGmaSJe2qUkL9t-bZT15GGZ452EYHoRuKTxQAP4YKRSiJADHopSUZ2hBC54RXuTZeZqztOWi4JfoKsYDAEjO5AJ9bn6G1jdj03_hYOupr3VvZjx6XHkfRzzY4HzoUmhx02ON31a7J0IBx3FuLTbtFEcbSKWjrbFrUhTnlHTX6MLpNtqbv75EH9vN-_qF7F-fd-vVnpgM8pFQw3gFzghLcwea1tYxIYSWMq8rpnVBpXO6Lk3By_Sw0wIcGOGEqUxVyCpbovvT3SH478nGUXVNNLZtdW_9FBWTIASnWQLv_oEHP4U-_ZYYBoyVwGSi6IkywccYrFNDaDodZkVBHUWrk2iVRKujaFVmv7tPcP8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2920226029</pqid></control><display><type>article</type><title>Exploiting redundancy to boost performance in a RAID-10 style cluster-based file system</title><source>Springer Link</source><creator>Zhu, Yifeng ; Jiang, Hong ; Qin, Xiao ; Feng, Dan ; Swanson, David R.</creator><creatorcontrib>Zhu, Yifeng ; Jiang, Hong ; Qin, Xiao ; Feng, Dan ; Swanson, David R.</creatorcontrib><description>While aggregating the throughput of existing disks on cluster nodes is a cost-effective approach to alleviate the I/O bottleneck in cluster computing, this approach suffers from potential performance degradations due to contentions for shared resources on the same node between storage data processing and user task computation. This paper proposes to judiciously utilize the storage redundancy in the form of mirroring existed in a RAID-10 style file system to alleviate this performance degradation. More specifically, a heuristic scheduling algorithm is developed, motivated from the observations of a simple cluster configuration, to spatially schedule write operations on the nodes with less load among each mirroring pair. The duplication of modified data to the mirroring nodes is performed asynchronously in the background. The read performance is improved by two techniques: doubling the degree of parallelism and hot-spot skipping. A synthetic benchmark is used to evaluate these algorithms in a real cluster environment and the proposed algorithms are shown to be very effective in performance enhancement.</description><identifier>ISSN: 1386-7857</identifier><identifier>EISSN: 1573-7543</identifier><identifier>DOI: 10.1007/s10586-006-0011-6</identifier><language>eng</language><publisher>Dordrecht: Springer Nature B.V</publisher><subject>Algorithms ; Clusters ; Data processing ; Heuristic scheduling ; Nodes ; Performance degradation ; Performance enhancement ; RAID ; Redundancy</subject><ispartof>Cluster computing, 2006-10, Vol.9 (4), p.433-447</ispartof><rights>Springer Science + Business Media, LLC 2006.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c304t-1c27b0fc8e14f0a1def2888a994db2aa519ffad6c576972fa80f0c8f8cbcb59b3</citedby><cites>FETCH-LOGICAL-c304t-1c27b0fc8e14f0a1def2888a994db2aa519ffad6c576972fa80f0c8f8cbcb59b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Zhu, Yifeng</creatorcontrib><creatorcontrib>Jiang, Hong</creatorcontrib><creatorcontrib>Qin, Xiao</creatorcontrib><creatorcontrib>Feng, Dan</creatorcontrib><creatorcontrib>Swanson, David R.</creatorcontrib><title>Exploiting redundancy to boost performance in a RAID-10 style cluster-based file system</title><title>Cluster computing</title><description>While aggregating the throughput of existing disks on cluster nodes is a cost-effective approach to alleviate the I/O bottleneck in cluster computing, this approach suffers from potential performance degradations due to contentions for shared resources on the same node between storage data processing and user task computation. This paper proposes to judiciously utilize the storage redundancy in the form of mirroring existed in a RAID-10 style file system to alleviate this performance degradation. More specifically, a heuristic scheduling algorithm is developed, motivated from the observations of a simple cluster configuration, to spatially schedule write operations on the nodes with less load among each mirroring pair. The duplication of modified data to the mirroring nodes is performed asynchronously in the background. The read performance is improved by two techniques: doubling the degree of parallelism and hot-spot skipping. A synthetic benchmark is used to evaluate these algorithms in a real cluster environment and the proposed algorithms are shown to be very effective in performance enhancement.</description><subject>Algorithms</subject><subject>Clusters</subject><subject>Data processing</subject><subject>Heuristic scheduling</subject><subject>Nodes</subject><subject>Performance degradation</subject><subject>Performance enhancement</subject><subject>RAID</subject><subject>Redundancy</subject><issn>1386-7857</issn><issn>1573-7543</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNpdkE1LxDAQhoMouK7-AG8BwVt0kn4kOS7rri4sCKJ4DGmaSJe2qUkL9t-bZT15GGZ452EYHoRuKTxQAP4YKRSiJADHopSUZ2hBC54RXuTZeZqztOWi4JfoKsYDAEjO5AJ9bn6G1jdj03_hYOupr3VvZjx6XHkfRzzY4HzoUmhx02ON31a7J0IBx3FuLTbtFEcbSKWjrbFrUhTnlHTX6MLpNtqbv75EH9vN-_qF7F-fd-vVnpgM8pFQw3gFzghLcwea1tYxIYSWMq8rpnVBpXO6Lk3By_Sw0wIcGOGEqUxVyCpbovvT3SH478nGUXVNNLZtdW_9FBWTIASnWQLv_oEHP4U-_ZYYBoyVwGSi6IkywccYrFNDaDodZkVBHUWrk2iVRKujaFVmv7tPcP8</recordid><startdate>20061001</startdate><enddate>20061001</enddate><creator>Zhu, Yifeng</creator><creator>Jiang, Hong</creator><creator>Qin, Xiao</creator><creator>Feng, Dan</creator><creator>Swanson, David R.</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20061001</creationdate><title>Exploiting redundancy to boost performance in a RAID-10 style cluster-based file system</title><author>Zhu, Yifeng ; Jiang, Hong ; Qin, Xiao ; Feng, Dan ; Swanson, David R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c304t-1c27b0fc8e14f0a1def2888a994db2aa519ffad6c576972fa80f0c8f8cbcb59b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Clusters</topic><topic>Data processing</topic><topic>Heuristic scheduling</topic><topic>Nodes</topic><topic>Performance degradation</topic><topic>Performance enhancement</topic><topic>RAID</topic><topic>Redundancy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhu, Yifeng</creatorcontrib><creatorcontrib>Jiang, Hong</creatorcontrib><creatorcontrib>Qin, Xiao</creatorcontrib><creatorcontrib>Feng, Dan</creatorcontrib><creatorcontrib>Swanson, David R.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer science database</collection><collection>ProQuest advanced technologies & aerospace journals</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Cluster computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhu, Yifeng</au><au>Jiang, Hong</au><au>Qin, Xiao</au><au>Feng, Dan</au><au>Swanson, David R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Exploiting redundancy to boost performance in a RAID-10 style cluster-based file system</atitle><jtitle>Cluster computing</jtitle><date>2006-10-01</date><risdate>2006</risdate><volume>9</volume><issue>4</issue><spage>433</spage><epage>447</epage><pages>433-447</pages><issn>1386-7857</issn><eissn>1573-7543</eissn><abstract>While aggregating the throughput of existing disks on cluster nodes is a cost-effective approach to alleviate the I/O bottleneck in cluster computing, this approach suffers from potential performance degradations due to contentions for shared resources on the same node between storage data processing and user task computation. This paper proposes to judiciously utilize the storage redundancy in the form of mirroring existed in a RAID-10 style file system to alleviate this performance degradation. More specifically, a heuristic scheduling algorithm is developed, motivated from the observations of a simple cluster configuration, to spatially schedule write operations on the nodes with less load among each mirroring pair. The duplication of modified data to the mirroring nodes is performed asynchronously in the background. The read performance is improved by two techniques: doubling the degree of parallelism and hot-spot skipping. A synthetic benchmark is used to evaluate these algorithms in a real cluster environment and the proposed algorithms are shown to be very effective in performance enhancement.</abstract><cop>Dordrecht</cop><pub>Springer Nature B.V</pub><doi>10.1007/s10586-006-0011-6</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1386-7857 |
ispartof | Cluster computing, 2006-10, Vol.9 (4), p.433-447 |
issn | 1386-7857 1573-7543 |
language | eng |
recordid | cdi_proquest_miscellaneous_29088713 |
source | Springer Link |
subjects | Algorithms Clusters Data processing Heuristic scheduling Nodes Performance degradation Performance enhancement RAID Redundancy |
title | Exploiting redundancy to boost performance in a RAID-10 style cluster-based file system |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T04%3A25%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Exploiting%20redundancy%20to%20boost%20performance%20in%20a%20RAID-10%20style%20cluster-based%20file%20system&rft.jtitle=Cluster%20computing&rft.au=Zhu,%20Yifeng&rft.date=2006-10-01&rft.volume=9&rft.issue=4&rft.spage=433&rft.epage=447&rft.pages=433-447&rft.issn=1386-7857&rft.eissn=1573-7543&rft_id=info:doi/10.1007/s10586-006-0011-6&rft_dat=%3Cproquest_cross%3E2920226029%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c304t-1c27b0fc8e14f0a1def2888a994db2aa519ffad6c576972fa80f0c8f8cbcb59b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2920226029&rft_id=info:pmid/&rfr_iscdi=true |