Fair bandwidth allocating and strip-aware prefetching for concurrent read streams and striped RAIDs in distributed file systems

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 168
  • Download : 0
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.
Publisher
SPRINGER
Issue Date
2018-08
Language
English
Article Type
Article
Keywords

HIGH-PERFORMANCE; STORAGE; FRAMEWORK; MAPREDUCE

Citation

JOURNAL OF SUPERCOMPUTING, v.74, no.8, pp.3904 - 3932

ISSN
0920-8542
DOI
10.1007/s11227-018-2396-4
URI
http://hdl.handle.net/10203/245576
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0