View : 23 Download: 3

On the parallelism of I/O scheduling algorithms in MEMS-based large storage systems

Title
On the parallelism of I/O scheduling algorithms in MEMS-based large storage systems
Authors
Lee E.Koh K.Choi H.Bahn H.
Ewha Authors
반효경
SCOPUS Author ID
반효경scopus
Issue Date
2009
Journal Title
WSEAS Transactions on Information Science and Applications
ISSN
1790-0832JCR Link
Citation
vol. 6, no. 5, pp. 705 - 714
Indexed
SCOPUS scopus
Abstract
MEMS-based storage is being developed as a new storage media that has several salient characteristics such as high-parallelism, high density, and low-power consumption. Because physical structures of MEMS-based storage is different from those of hard disks, new software management techniques for MEMS-based storage are needed. Specifically, MEMS-based storage has thousands of parallel-activating heads, which requires parallelism-aware request scheduling algorithms to maximize the performance of the storage media. In this paper, we compare various versions of I/O scheduling algorithms that exploit high-parallelism of MEMS-based storage devices. Trace-driven simulations show that parallelism-aware algorithms can be effectively used for high capacity mass storage servers because they perform better than other algorithms in terms of the average response time when the workload intensity becomes heavy.
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
On the parallelism of I O scheduling algorithms in MEMS-based large storage systems.pdf(389.17 kB)Download
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE