Abstract | ||
---|---|---|
Improving read performance is one of the major challenges with speeding up scientific data analytic applications. Utilizing the memory hierarchy is one major line of researches to address the read performance bottleneck. Related methods usually combine solide-state-drives(SSDs) with dynamic random-access memory(DRAM) and/or parallel file system(PFS) to mitigate the speed and space gap between DRAM and PFS. However, these methods are unable to handle key performance issues plaguing SSDs, namely read contention that may cause up to 50% performance reduction. In this paper, we propose a framework that exploits the memory hierarchy resource to address the read contention issues involved with SSDs. The framework employs a general purpose online read algorithm that able to detect and utilize memory hierarchy resource to relieve the problem. To maintain a near optimal operating environment for SSDs, the framework is able to orchastrate data chunks across different memory layers to facilitate the read algorithm. Compared to existing tools, our framework achieves up to 50% read performance improvement when tested on datasets from real-world scientific simulations. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1109/CLUSTER.2015.18 | Cluster Computing |
Keywords | Field | DocType |
scientific data, read contention, memory hierarchy, SSD | File system,Interleaved memory,Semiconductor memory,Memory hierarchy,Computer science,Computer data storage,Parallel computing,Memory map,Flat memory model,Performance improvement | Conference |
ISSN | Citations | PageRank |
1552-5244 | 3 | 0.40 |
References | Authors | |
7 | 7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Wenzhao Zhang | 1 | 4 | 0.75 |
Houjun Tang | 2 | 53 | 15.97 |
Xiaocheng Zou | 3 | 64 | 5.90 |
Steve Harenberg | 4 | 17 | 5.11 |
Qing Liu | 5 | 389 | 25.62 |
Scott Klasky | 6 | 1547 | 99.00 |
Nagiza F. Samatova | 7 | 861 | 74.04 |