Towards optimal I/O scheduling for MEMS-based storage

Author

Yu, Hailing ; Agrawal, Divyakant ; El Abbadi, Amr

Author_Institution

Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA

fYear

2003

fDate

7-10 April 2003

Firstpage

58

Lastpage

61

Abstract

MEMS-based storage devices are currently being developed to narrow the gap between processor and disk speeds. MEMS-based storage devices have a different architecture from disk devices, thus algorithms, such as I/O scheduling and data placement, designed for disks need to be revisited. In this paper we focus on developing an I/O scheduling algorithm for MEMS-based storage devices. Our theoretical analysis shows that this algorithm is guaranteed to perform within twice the optimal time for any workload.

Keywords

input-output programs; micromechanical devices; scheduling; storage media; trees (mathematics); MEMS-based storage devices; cost graph; data placement; input/output scheduling; minimum spanning tree; scheduling; undirected graph; Algorithm design and analysis; Costs; Disk recording; Job shop scheduling; Manufacturing processes; Optimal scheduling; Probes; Processor scheduling; Scheduling algorithm; Semiconductor device manufacture;

fLanguage

English

Publisher

ieee

Conference_Titel

Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings. 20th IEEE/11th NASA Goddard Conference on

Print_ISBN

0-7695-1914-8

Type

conf

DOI

10.1109/MASS.2003.1194836

Filename

1194836