View : 17 Download: 0

G-MST: A dynamic group-based scheduling algorithm for MEMS-based mobile storage devices

Title
G-MST: A dynamic group-based scheduling algorithm for MEMS-based mobile storage devices
Authors
Park J.Chun H.Bahn H.Koh K.
Ewha Authors
반효경
SCOPUS Author ID
반효경scopus
Issue Date
2009
Journal Title
IEEE Transactions on Consumer Electronics
ISSN
0098-3063JCR Link
Citation
vol. 55, no. 2, pp. 570 - 575
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
MEMS-based storage is anticipated to be used as the secondary storage of mobile consumer devices due to its attractive features such as small size, low-power consumption, and low cost. However, physical structures of MEMS-based storage are vastly different from traditional hard disks especially in the way of data placement and seeking. Hence, it is important to revise the software management techniques appropriate for MEMS-based storage. In this paper, we present a new I/O scheduling algorithm for MEMSbased storage called G-MST that exploits the two-dimensional graph algorithm and group-based SCAN. The proposed algorithm aims at reducing the total seek distance in the two dimensional MEMS structure and providing fast and uniform response time simultaneously. Simulations with synthetic and real world I/O traces are performed to assess the effectiveness of G-MST. © 2009 IEEE.
DOI
10.1109/TCE.2009.5174424
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

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

BROWSE