DocumentCode
3678355
Title
TRIO: Burst Buffer Based I/O Orchestration
Author
Teng Wang;Sarp Oral;Michael Pritchard;Bin Wang;Weikuan Yu
Author_Institution
Florida State Univ., Tallahassee, FL, USA
fYear
2015
Firstpage
194
Lastpage
203
Abstract
The growing computing power on leadership HPC systems is often accompanied by ever-escalating failure rates. Checkpointing is a common defensive mechanism used by scientific applications for failure recovery. However, directly writing the large and bursty checkpointing dataset to parallel file systems can incur significant I/O contention on storage servers. Such contention in turn degrades bandwidth utilization of storage servers and prolongs the average job I/O time of concurrent applications. Recently burst buffers have been proposed as an intermediate layer to absorb the bursty I/O traffic from compute nodes to storage backend. But an I/O orchestration mechanism is still desirable to efficiently move checkpointing data from burst buffers to storage backend. In this paper, we propose a burst buffer based I/O orchestration framework, named TRIO, to intercept and reshape the bursty writes for better sequential write traffic to storage servers. Meanwhile, TRIO coordinates the flushing orders among concurrent burst buffers to alleviate the contention on storage server. Our experimental results demonstrated that TRIO could efficiently utilize storage bandwidth and reduce the average job I/O time by 37% on average for data-intensive applications in typical checkpointing scenarios.
Keywords
"Servers","Bandwidth","Checkpointing","Buffer storage","Benchmark testing","Indexing","Organizations"
Publisher
ieee
Conference_Titel
Cluster Computing (CLUSTER), 2015 IEEE International Conference on
Type
conf
DOI
10.1109/CLUSTER.2015.38
Filename
7307585
Link To Document