상세정보
학술지
Fair Bandwidth Allocating and Strip-aware Prefetching for Concurrent Read Streams and Striped RAIDs in Distributed File Systems
- 발행일
- 201808
- 출처
- Journal of Supercomputing, v.74 no.8, pp.3904-3932
- ISSN
- 0920-8542
- 출판사
- Springer
- 협약과제
- 18HS3900, (ICBMS-총괄) ICBMS(IoT, 클라우드, 빅데이터, 모바일, 정보보호) 핵심 기술 개발 사업 총괄 및 엑사스케일급 클라우드 스토리지 기술 개발, 김영균
- 초록
- With a striped RAID (Redundant Array of Independent Disks) which consists of multiple disks and spreads data across them in parallel, distributed file systems (DFSs) easily enhance the performance of a single read stream (i.e., a series of sequential reads by a process). However, most existing DFSs suffer from performance degradation in concurrent read streams (i.e., multiple series of sequential reads by concurrent processes). Furthermore, research on the performance of concurrent ones for a striped RAID in DFSs has been rarely reported so far. In this paper, we define the problems that degrade it at different configurations of striped RAIDs, and resolve them by proposing the following two methods: (1) a fair allocating of network bandwidth for concurrent read streams and (2) a strip-aware prefetching for each individual read stream. We show that our proposal outperforms all the existing DFSs by at least two times for all kinds and configurations of striped RAIDs. Furthermore, the performance gap between our proposal and the existing DFSs becomes wider according to the increasing number of striped disks.
- KSP 제안 키워드
- Concurrent processes, Distributed File system, Network bandwidth, Redundant array of independent disks(RAID), performance degradation, performance gap