東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Exploring Novel Burst Buffer Managem...

Wang, Teng.

FindBook

Google Book

Amazon

博客來

Exploring Novel Burst Buffer Management on Extreme-Scale HPC Systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Exploring Novel Burst Buffer Management on Extreme-Scale HPC Systems./
作者:	Wang, Teng.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
面頁冊數:	105 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
Contained By:	Dissertation Abstracts International78-10B(E).
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10257507
ISBN:	9781369863109

Exploring Novel Burst Buffer Management on Extreme-Scale HPC Systems.
Wang, Teng.

Exploring Novel Burst Buffer Management on Extreme-Scale HPC Systems. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 105 p.

Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.

Thesis (Ph.D.)--The Florida State University, 2017.

The computing power on the leadership-class supercomputers has been growing exponentially over the past few decades, and is projected to reach exascale in the near future. This trend, however, will continue to push forward the peak I/O requirement for checkpoint/restart, data analysis and visualization. As a result, the conventional Parallel File System (PFS) is no longer a qualified candidate for handling the exascale I/O workloads. On one hand, the basic storage unit of the conventional PFS is still the hard drives, which are expensive in terms of I/O bandwidth/operation per dollar. Providing sufficient hard drives to meet the I/O requirement at exascale is prohibitively costly. On the other hand, the effective I/O bandwidth of PFS is limited by I/O contention, which occurs when multiple computing processes concurrently write to the same shared disks.

ISBN: 9781369863109Subjects--Topical Terms:

523869
Computer science.

Exploring Novel Burst Buffer Management on Extreme-Scale HPC Systems.
LDR:06082nmm a2200325 4500 001 2126555
005 20171128150726.5
008 180830s2017 ||||||||||||||||| ||eng d
020 $a 9781369863109
035 $a (MiAaPQ)AAI10257507
035 $a AAI10257507
040 $a MiAaPQ $c MiAaPQ
100 1 $a Wang, Teng. $3 3182630
245 1 0 $a Exploring Novel Burst Buffer Management on Extreme-Scale HPC Systems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 105 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
500 $a Adviser: Weikuan Yu.
502 $a Thesis (Ph.D.)--The Florida State University, 2017.
520 $a The computing power on the leadership-class supercomputers has been growing exponentially over the past few decades, and is projected to reach exascale in the near future. This trend, however, will continue to push forward the peak I/O requirement for checkpoint/restart, data analysis and visualization. As a result, the conventional Parallel File System (PFS) is no longer a qualified candidate for handling the exascale I/O workloads. On one hand, the basic storage unit of the conventional PFS is still the hard drives, which are expensive in terms of I/O bandwidth/operation per dollar. Providing sufficient hard drives to meet the I/O requirement at exascale is prohibitively costly. On the other hand, the effective I/O bandwidth of PFS is limited by I/O contention, which occurs when multiple computing processes concurrently write to the same shared disks.
520 $a Recently, researchers and system architects are exploring a new storage architecture with tiers of burst buffers (e.g. DRAM, NVRAM and SSD) deployed between the compute nodes and the backend PFS. This additional burst buffer layer offers much higher aggregate I/O bandwidth than the PFS and is designed to absorb the massive I/O workloads on the slower PFS. Burst buffers have been deployed on numerous contemporary supercomputers, and they have also become an indispensable hardware component on the next-generation supercomputers.
520 $a There are two representative burst buffer architectures being explored: node-local burst buffers (burst buffers on compute nodes) and remote shared burst buffers (burst buffers on I/O nodes). Both types of burst buffers rely on a software management system to provide fast and scalable data service. However, there is still a lack of in-depth study on the software solutions and their impacts. On one hand, a number of studies on burst buffers are based on modeling and simulation, which cannot exactly capture the performance impact of various design choices. On the other hand, existing software development efforts are generally carried out by industrial companies, whose proprietary products are commercialized without releasing sufficient details on the internal design.
520 $a This dissertation explores the alternative burst buffer management strategies based on research designs and prototype implementations, with a focus on how to accelerate the common scientific I/O workloads, including the bursty writes from checkpointing and bursty reads from restart/analysis/visualization. Our design philosophy is to leverage burst buffers as a fast and intermediate storage layer to orchestrate the data movement between the applications and burst buffers, as well as the data movement between burst buffers and the backend PFS. On one hand, the performance benefit of burst buffers can significantly speed up the data movement between the applications and burst buffers. On the other hand, this additional burst buffer layer offers extra capacity to buffer and reshape the write requests, and drain them to the backend PFS in a manner catering to the most effective utilization of PFS capabilities. Rooted on this design philosophy, this dissertation investigates three data management strategies. The first two strategies answer how to efficiently move data between the scientific applications and the burst buffers. These two strategies are respectively designed for the remote shared burst buffers and the node-local burst buffers. The rest one strategy aims to speed up the data movement between the burst buffers and the PFS, it is applicable to both types of burst buffers. In the first strategy, a novel burst buffer system named BurstMem is designed and prototyped to manage the remote shared burst buffers. BurstMem expedites scientific checkpointing by quickly buffering the checkpoints in the burst buffers after each round of computation and asynchronously flushing the datasets to the PFS during the next round of computation. It outperforms the state-of-the-art data management systems with efficient data transfer, buffering and flushing. In the second strategy, we have designed and prototyped an ephemeral burst buffer file system named BurstFS to manage the node-local burst buffers. BurstFS delivers scalable write bandwidth by having each process write to its node-local burst buffer. It also provides fast and temporary data sharing service for multiple coupled applications in the same job. In the third strategy, a burst buffer orchestration framework named TRIO is devised to address I/O contention on the PFS. TRIO buffers scientific applications' bursty write requests, and dynamically adjusts the flush order of all the write requests to avoid multiple burst buffers' competing flush on the same disk. Our experiments demonstrate that by addressing I/O contention, TRIO not only improves the storage bandwidth utilization but also minimizes the average I/O service time for each job.
520 $a Through systematic experiments and comprehensive evaluation and analysis, we have validated our design and management solutions for burst buffers can significantly accelerate scientific I/O for the next-generation supercomputers.
590 $a School code: 0071.
650 4 $a Computer science. $3 523869
690 $a 0984
710 2 $a The Florida State University. $b Computer Science. $3 3171069
773 0 $t Dissertation Abstracts International $g 78-10B(E).
790 $a 0071
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10257507