DDL‐QoS: A dynamic I/O scheduling strategy of QoS for HPC applications
Summary With the increasing cloud‐trend of high‐performance computing (HPC), more users submit their applications simultaneously to the platform and wish they could finish before the deadline. Moreover, due to the severe holistic performance degradation caused by I/O contention, a deadline‐sensitive...
Gespeichert in:
| Veröffentlicht in: | Concurrency and computation 2021-04, Vol.33 (7), p.1-1, Article 5453 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1 |
|---|---|
| container_issue | 7 |
| container_start_page | 1 |
| container_title | Concurrency and computation |
| container_volume | 33 |
| creator | Yang, Ying Shi, Xuanhua Liu, Wei Jin, Hai Hua, Yusheng Jiang, Yan |
| description | Summary
With the increasing cloud‐trend of high‐performance computing (HPC), more users submit their applications simultaneously to the platform and wish they could finish before the deadline. Moreover, due to the severe holistic performance degradation caused by I/O contention, a deadline‐sensitive I/O scheduler is needed to allocate storage resources according to the requirements of applications and resultantly guarantee the quality of service (QoS) of concurrently running applications. In this paper, we first explore the bandwidth allocation phenomenon caused by interference in applications through the modeling of historical data, and then we quote a metric called random percentage that can represent the random degree of the applications and be used to guide I/O scheduling in the later stage. We design a dynamic I/O scheduler named DDL‐QoS that uses solid state drives(SSDs) as QoS guarantee to minimize interference and ensure applications meet their deadline. The potential of our design is that the greater the I/O interference, the greater the performance improvement, but this performance improvement will be limited by the physical properties of the storage hardware. |
| doi_str_mv | 10.1002/cpe.5453 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1002_cpe_5453</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2509242115</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2933-f39adb7e937955397c8f8b6fd24e25d69108cc6a2b6888d842c90bc31aad877c3</originalsourceid><addsrcrecordid>eNqNkM1Kw0AUhQdRsFbBRxhwI0ja-UkyE3clrbZQaEVdD5PJTJ2SZmImRbLzEXxGn8S0le4EV_csvnPvuQeAa4wGGCEyVJUeRGFET0APR5QEKKbh6VGT-BxceL9GCGNEcQ9Mx-P59-fXk3u-hyOYt6XcWAVnwwX06k3n28KWK-ibWjZ61UJnYEdC42o4XaZQVlVhlWysK_0lODOy8Prqd_bB68PkJZ0G88XjLB3NA0USSgNDE5lnTCeUJVFEE6a44VlschJqEuVxghFXKpYkiznnOQ-JSlCmKJYy54wp2gc3h71V7d632jdi7bZ12Z0UJEIJCQnufu2D2wOlaud9rY2oaruRdSswErueRNeT2PXUoXcH9ENnznhldan0EUcIhYyRmLFOIdzR_P90apt9Oanblk1nDX6tttDtn4FEupzsg_0AwcSH7g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2509242115</pqid></control><display><type>article</type><title>DDL‐QoS: A dynamic I/O scheduling strategy of QoS for HPC applications</title><source>Access via Wiley Online Library</source><source>Web of Science - Science Citation Index Expanded - 2021<img src="https://exlibris-pub.s3.amazonaws.com/fromwos-v2.jpg" /></source><creator>Yang, Ying ; Shi, Xuanhua ; Liu, Wei ; Jin, Hai ; Hua, Yusheng ; Jiang, Yan</creator><creatorcontrib>Yang, Ying ; Shi, Xuanhua ; Liu, Wei ; Jin, Hai ; Hua, Yusheng ; Jiang, Yan</creatorcontrib><description>Summary
With the increasing cloud‐trend of high‐performance computing (HPC), more users submit their applications simultaneously to the platform and wish they could finish before the deadline. Moreover, due to the severe holistic performance degradation caused by I/O contention, a deadline‐sensitive I/O scheduler is needed to allocate storage resources according to the requirements of applications and resultantly guarantee the quality of service (QoS) of concurrently running applications. In this paper, we first explore the bandwidth allocation phenomenon caused by interference in applications through the modeling of historical data, and then we quote a metric called random percentage that can represent the random degree of the applications and be used to guide I/O scheduling in the later stage. We design a dynamic I/O scheduler named DDL‐QoS that uses solid state drives(SSDs) as QoS guarantee to minimize interference and ensure applications meet their deadline. The potential of our design is that the greater the I/O interference, the greater the performance improvement, but this performance improvement will be limited by the physical properties of the storage hardware.</description><identifier>ISSN: 1532-0626</identifier><identifier>EISSN: 1532-0634</identifier><identifier>DOI: 10.1002/cpe.5453</identifier><language>eng</language><publisher>HOBOKEN: Wiley</publisher><subject>Cloud computing ; Computer Science ; Computer Science, Software Engineering ; Computer Science, Theory & Methods ; Deadline ; I/O Scheduler ; Interference ; Performance degradation ; Physical properties ; QoS ; Quality of service ; Scheduling ; Science & Technology ; Solid state devices ; Technology</subject><ispartof>Concurrency and computation, 2021-04, Vol.33 (7), p.1-1, Article 5453</ispartof><rights>2019 John Wiley & Sons, Ltd.</rights><rights>2021 John Wiley & Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>true</woscitedreferencessubscribed><woscitedreferencescount>0</woscitedreferencescount><woscitedreferencesoriginalsourcerecordid>wos000477267700001</woscitedreferencesoriginalsourcerecordid><citedby>FETCH-LOGICAL-c2933-f39adb7e937955397c8f8b6fd24e25d69108cc6a2b6888d842c90bc31aad877c3</citedby><cites>FETCH-LOGICAL-c2933-f39adb7e937955397c8f8b6fd24e25d69108cc6a2b6888d842c90bc31aad877c3</cites><orcidid>0000-0001-8451-8656 ; 0000-0002-3934-7605</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fcpe.5453$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fcpe.5453$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>315,781,785,1418,27929,27930,39263,45579,45580</link.rule.ids></links><search><creatorcontrib>Yang, Ying</creatorcontrib><creatorcontrib>Shi, Xuanhua</creatorcontrib><creatorcontrib>Liu, Wei</creatorcontrib><creatorcontrib>Jin, Hai</creatorcontrib><creatorcontrib>Hua, Yusheng</creatorcontrib><creatorcontrib>Jiang, Yan</creatorcontrib><title>DDL‐QoS: A dynamic I/O scheduling strategy of QoS for HPC applications</title><title>Concurrency and computation</title><addtitle>CONCURR COMP-PRACT E</addtitle><description>Summary
With the increasing cloud‐trend of high‐performance computing (HPC), more users submit their applications simultaneously to the platform and wish they could finish before the deadline. Moreover, due to the severe holistic performance degradation caused by I/O contention, a deadline‐sensitive I/O scheduler is needed to allocate storage resources according to the requirements of applications and resultantly guarantee the quality of service (QoS) of concurrently running applications. In this paper, we first explore the bandwidth allocation phenomenon caused by interference in applications through the modeling of historical data, and then we quote a metric called random percentage that can represent the random degree of the applications and be used to guide I/O scheduling in the later stage. We design a dynamic I/O scheduler named DDL‐QoS that uses solid state drives(SSDs) as QoS guarantee to minimize interference and ensure applications meet their deadline. The potential of our design is that the greater the I/O interference, the greater the performance improvement, but this performance improvement will be limited by the physical properties of the storage hardware.</description><subject>Cloud computing</subject><subject>Computer Science</subject><subject>Computer Science, Software Engineering</subject><subject>Computer Science, Theory & Methods</subject><subject>Deadline</subject><subject>I/O Scheduler</subject><subject>Interference</subject><subject>Performance degradation</subject><subject>Physical properties</subject><subject>QoS</subject><subject>Quality of service</subject><subject>Scheduling</subject><subject>Science & Technology</subject><subject>Solid state devices</subject><subject>Technology</subject><issn>1532-0626</issn><issn>1532-0634</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>HGBXW</sourceid><recordid>eNqNkM1Kw0AUhQdRsFbBRxhwI0ja-UkyE3clrbZQaEVdD5PJTJ2SZmImRbLzEXxGn8S0le4EV_csvnPvuQeAa4wGGCEyVJUeRGFET0APR5QEKKbh6VGT-BxceL9GCGNEcQ9Mx-P59-fXk3u-hyOYt6XcWAVnwwX06k3n28KWK-ibWjZ61UJnYEdC42o4XaZQVlVhlWysK_0lODOy8Prqd_bB68PkJZ0G88XjLB3NA0USSgNDE5lnTCeUJVFEE6a44VlschJqEuVxghFXKpYkiznnOQ-JSlCmKJYy54wp2gc3h71V7d632jdi7bZ12Z0UJEIJCQnufu2D2wOlaud9rY2oaruRdSswErueRNeT2PXUoXcH9ENnznhldan0EUcIhYyRmLFOIdzR_P90apt9Oanblk1nDX6tttDtn4FEupzsg_0AwcSH7g</recordid><startdate>20210410</startdate><enddate>20210410</enddate><creator>Yang, Ying</creator><creator>Shi, Xuanhua</creator><creator>Liu, Wei</creator><creator>Jin, Hai</creator><creator>Hua, Yusheng</creator><creator>Jiang, Yan</creator><general>Wiley</general><general>Wiley Subscription Services, Inc</general><scope>BLEPL</scope><scope>DTL</scope><scope>HGBXW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-8451-8656</orcidid><orcidid>https://orcid.org/0000-0002-3934-7605</orcidid></search><sort><creationdate>20210410</creationdate><title>DDL‐QoS: A dynamic I/O scheduling strategy of QoS for HPC applications</title><author>Yang, Ying ; Shi, Xuanhua ; Liu, Wei ; Jin, Hai ; Hua, Yusheng ; Jiang, Yan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2933-f39adb7e937955397c8f8b6fd24e25d69108cc6a2b6888d842c90bc31aad877c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Cloud computing</topic><topic>Computer Science</topic><topic>Computer Science, Software Engineering</topic><topic>Computer Science, Theory & Methods</topic><topic>Deadline</topic><topic>I/O Scheduler</topic><topic>Interference</topic><topic>Performance degradation</topic><topic>Physical properties</topic><topic>QoS</topic><topic>Quality of service</topic><topic>Scheduling</topic><topic>Science & Technology</topic><topic>Solid state devices</topic><topic>Technology</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Ying</creatorcontrib><creatorcontrib>Shi, Xuanhua</creatorcontrib><creatorcontrib>Liu, Wei</creatorcontrib><creatorcontrib>Jin, Hai</creatorcontrib><creatorcontrib>Hua, Yusheng</creatorcontrib><creatorcontrib>Jiang, Yan</creatorcontrib><collection>Web of Science Core Collection</collection><collection>Science Citation Index Expanded</collection><collection>Web of Science - Science Citation Index Expanded - 2021</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</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>Concurrency and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yang, Ying</au><au>Shi, Xuanhua</au><au>Liu, Wei</au><au>Jin, Hai</au><au>Hua, Yusheng</au><au>Jiang, Yan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>DDL‐QoS: A dynamic I/O scheduling strategy of QoS for HPC applications</atitle><jtitle>Concurrency and computation</jtitle><stitle>CONCURR COMP-PRACT E</stitle><date>2021-04-10</date><risdate>2021</risdate><volume>33</volume><issue>7</issue><spage>1</spage><epage>1</epage><pages>1-1</pages><artnum>5453</artnum><issn>1532-0626</issn><eissn>1532-0634</eissn><abstract>Summary
With the increasing cloud‐trend of high‐performance computing (HPC), more users submit their applications simultaneously to the platform and wish they could finish before the deadline. Moreover, due to the severe holistic performance degradation caused by I/O contention, a deadline‐sensitive I/O scheduler is needed to allocate storage resources according to the requirements of applications and resultantly guarantee the quality of service (QoS) of concurrently running applications. In this paper, we first explore the bandwidth allocation phenomenon caused by interference in applications through the modeling of historical data, and then we quote a metric called random percentage that can represent the random degree of the applications and be used to guide I/O scheduling in the later stage. We design a dynamic I/O scheduler named DDL‐QoS that uses solid state drives(SSDs) as QoS guarantee to minimize interference and ensure applications meet their deadline. The potential of our design is that the greater the I/O interference, the greater the performance improvement, but this performance improvement will be limited by the physical properties of the storage hardware.</abstract><cop>HOBOKEN</cop><pub>Wiley</pub><doi>10.1002/cpe.5453</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0001-8451-8656</orcidid><orcidid>https://orcid.org/0000-0002-3934-7605</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1532-0626 |
| ispartof | Concurrency and computation, 2021-04, Vol.33 (7), p.1-1, Article 5453 |
| issn | 1532-0626 1532-0634 |
| language | eng |
| recordid | cdi_crossref_primary_10_1002_cpe_5453 |
| source | Access via Wiley Online Library; Web of Science - Science Citation Index Expanded - 2021<img src="https://exlibris-pub.s3.amazonaws.com/fromwos-v2.jpg" /> |
| subjects | Cloud computing Computer Science Computer Science, Software Engineering Computer Science, Theory & Methods Deadline I/O Scheduler Interference Performance degradation Physical properties QoS Quality of service Scheduling Science & Technology Solid state devices Technology |
| title | DDL‐QoS: A dynamic I/O scheduling strategy of QoS for HPC applications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-14T17%3A22%3A18IST&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=DDL%E2%80%90QoS:%20A%20dynamic%20I/O%20scheduling%20strategy%20of%20QoS%20for%20HPC%20applications&rft.jtitle=Concurrency%20and%20computation&rft.au=Yang,%20Ying&rft.date=2021-04-10&rft.volume=33&rft.issue=7&rft.spage=1&rft.epage=1&rft.pages=1-1&rft.artnum=5453&rft.issn=1532-0626&rft.eissn=1532-0634&rft_id=info:doi/10.1002/cpe.5453&rft_dat=%3Cproquest_cross%3E2509242115%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2509242115&rft_id=info:pmid/&rfr_iscdi=true |