東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back to Search results for [ null ]

Switch To: Labeled | MARC Mode | ISBD

Extracting Better Performance from t...

Elyasi, Nima.

Linked to FindBook

Google Book

Amazon

博客來

Extracting Better Performance from the Parallelism Offered by SSDS.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Extracting Better Performance from the Parallelism Offered by SSDS./
Author:	Elyasi, Nima.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2019,
Description:	123 p.
Notes:	Source: Dissertations Abstracts International, Volume: 80-12, Section: B.
Contained By:	Dissertations Abstracts International80-12B.
Subject:	Computer Engineering. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13917900
ISBN:	9781392318331

Extracting Better Performance from the Parallelism Offered by SSDS.
Elyasi, Nima.

Extracting Better Performance from the Parallelism Offered by SSDS. - Ann Arbor : ProQuest Dissertations & Theses, 2019 - 123 p.

Source: Dissertations Abstracts International, Volume: 80-12, Section: B.

Thesis (Ph.D.)--The Pennsylvania State University, 2019.

This item must not be added to any third party search indexes.

The majority of growth in the industry is driven by massive data processing which in turn is driving a tremendous need for high performance storage. To satisfy the lower latency demands, large-scale computing platforms have been making heavy use of flash-based Solid State Drives (SSDs), which provide substantially lower latencies compared to conventional hard disk drives. To satisfy the capacity and bandwidth demands, SSDs continue to scale by (i) adopting new flash technologies such as V-NAND, and (ii) embodying more flash chips which leads to higher levels of internal parallelism. With the tremendous growth in SSDs capacity and the continuing rise in their internal hardware parallelism, load imbalance and resource contention remain serious impediments towards boosting their performance. Employing and exploiting higher levels of internal parallelism in SSDs can even accentuate the load imbalance as variable-sized requests span more number of flash chips and impose more complexities to the request schedulers when coordinating the individual queues. On the other hand, the widely differential latency of the basic flash operations: read, write, and erase, exacerbates the load imbalance since not all chips are necessarily doing the same operation at the same time. As a consequence of such unbalanced system, SSD requests experience considerable inefficiencies in terms of non-uniformity and non-determinism in their service, which can in turn impair the profitability of client-facing applications. In this dissertation, remedies to alleviate these challenges are proposed, developed and evaluated. The proposed performance-enhancement mechanisms can be incorporated in the device firmware to provide faster and more consistent service.In this dissertation, we address the load imbalance problem by (i) exploiting the variation in the queue lengths to better take advantage of offered hardware parallelism while serving SSD requests, and (ii) balancing the load across different flash chips by opportunistically re-directing the load to less busy flash chips. First, we propose and develop a scheduling mechanism which orchestrates SSD requests at the (i) arrival time: when inserting requests in their respective queues, and (ii) service time: when issuing requests on flash chips. The former estimates and leverages the skews in completion of sub-requests in order to allow the new arrivals to jump ahead of the existing ones without affecting their response times. The latter, however, aims at achieving time sharing of available resources by coordinatedly scheduling sub-requests of each request at the service time. Such scheduling mechanisms are targeted at reducing the response time of SSD requests by coordinating SSD requests in their respective queues. Apart from such optimizations -which are restricted in terms of flash chips servicing a request, one can attempt to re-direct requests to other flash chips which are opportunistically free. Providing this re-direction opportunity is nontrivial for read requests. In the second part of this dissertation, we propose novel approaches to re-direct the load to less busy flash chips. With our proposed techniques, re-direction of read requests is achieved by (i) selective replication, wherein the value popularity is leveraged to replicate the popular data on multiple flash chips and provide more opportunities for read re-direction; and (ii) leveraging existing RAID groups in which flash chips are organized, and reconstructing the read data from the remaining chips of the group, rather than waiting for a long latency operation to complete. While both read redirection approaches aim at exploiting the existing redundancy to improve response times of SSD requests, the former technique is designed for a content-addressable SSD, while the latter is applicable to normal SSDs with RAID-like capabilities which are more common in high-end SSDs employed in large-scale production environments.

ISBN: 9781392318331Subjects--Topical Terms:

1567821
Computer Engineering.

Extracting Better Performance from the Parallelism Offered by SSDS.
LDR:05113nmm a2200337 4500 001 2207722
005 20190920102409.5
008 201008s2019 ||||||||||||||||| ||eng d
020 $a 9781392318331
035 $a (MiAaPQ)AAI13917900
035 $a AAI13917900
040 $a MiAaPQ $c MiAaPQ
100 1 $a Elyasi, Nima. $3 3434713
245 1 0 $a Extracting Better Performance from the Parallelism Offered by SSDS.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2019
300 $a 123 p.
500 $a Source: Dissertations Abstracts International, Volume: 80-12, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Sivasubramaniam, Anand.
502 $a Thesis (Ph.D.)--The Pennsylvania State University, 2019.
506 $a This item must not be added to any third party search indexes.
506 $a This item must not be sold to any third party vendors.
520 $a The majority of growth in the industry is driven by massive data processing which in turn is driving a tremendous need for high performance storage. To satisfy the lower latency demands, large-scale computing platforms have been making heavy use of flash-based Solid State Drives (SSDs), which provide substantially lower latencies compared to conventional hard disk drives. To satisfy the capacity and bandwidth demands, SSDs continue to scale by (i) adopting new flash technologies such as V-NAND, and (ii) embodying more flash chips which leads to higher levels of internal parallelism. With the tremendous growth in SSDs capacity and the continuing rise in their internal hardware parallelism, load imbalance and resource contention remain serious impediments towards boosting their performance. Employing and exploiting higher levels of internal parallelism in SSDs can even accentuate the load imbalance as variable-sized requests span more number of flash chips and impose more complexities to the request schedulers when coordinating the individual queues. On the other hand, the widely differential latency of the basic flash operations: read, write, and erase, exacerbates the load imbalance since not all chips are necessarily doing the same operation at the same time. As a consequence of such unbalanced system, SSD requests experience considerable inefficiencies in terms of non-uniformity and non-determinism in their service, which can in turn impair the profitability of client-facing applications. In this dissertation, remedies to alleviate these challenges are proposed, developed and evaluated. The proposed performance-enhancement mechanisms can be incorporated in the device firmware to provide faster and more consistent service.In this dissertation, we address the load imbalance problem by (i) exploiting the variation in the queue lengths to better take advantage of offered hardware parallelism while serving SSD requests, and (ii) balancing the load across different flash chips by opportunistically re-directing the load to less busy flash chips. First, we propose and develop a scheduling mechanism which orchestrates SSD requests at the (i) arrival time: when inserting requests in their respective queues, and (ii) service time: when issuing requests on flash chips. The former estimates and leverages the skews in completion of sub-requests in order to allow the new arrivals to jump ahead of the existing ones without affecting their response times. The latter, however, aims at achieving time sharing of available resources by coordinatedly scheduling sub-requests of each request at the service time. Such scheduling mechanisms are targeted at reducing the response time of SSD requests by coordinating SSD requests in their respective queues. Apart from such optimizations -which are restricted in terms of flash chips servicing a request, one can attempt to re-direct requests to other flash chips which are opportunistically free. Providing this re-direction opportunity is nontrivial for read requests. In the second part of this dissertation, we propose novel approaches to re-direct the load to less busy flash chips. With our proposed techniques, re-direction of read requests is achieved by (i) selective replication, wherein the value popularity is leveraged to replicate the popular data on multiple flash chips and provide more opportunities for read re-direction; and (ii) leveraging existing RAID groups in which flash chips are organized, and reconstructing the read data from the remaining chips of the group, rather than waiting for a long latency operation to complete. While both read redirection approaches aim at exploiting the existing redundancy to improve response times of SSD requests, the former technique is designed for a content-addressable SSD, while the latter is applicable to normal SSDs with RAID-like capabilities which are more common in high-end SSDs employed in large-scale production environments.
590 $a School code: 0176.
650 4 $a Computer Engineering. $3 1567821
650 4 $a Engineering. $3 586835
650 4 $a Computer science. $3 523869
690 $a 0464
690 $a 0537
690 $a 0984
710 2 $a The Pennsylvania State University. $b Computer Science and Engineering. $3 2095963
773 0 $t Dissertations Abstracts International $g 80-12B.
790 $a 0176
791 $a Ph.D.
792 $a 2019
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13917900