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

Junseok Park, Hansung Chun, Hyokyung Bahn, Kern Koh

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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.

Original languageEnglish
Pages (from-to)570-575
Number of pages6
JournalIEEE Transactions on Consumer Electronics
Issue number2
StatePublished - 2009

Bibliographical note

Funding Information:
1This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD, Basic Research Promotion Fund) (KRF-2006-311-D00754).


  • MEMS-based storage
  • Mobile device
  • Response time
  • Scheduling


Dive into the research topics of 'G-MST: A dynamic group-based scheduling algorithm for MEMS-based mobile storage devices'. Together they form a unique fingerprint.

Cite this