A Disk Allocation Scheme for High - Performance Parallel File Systems 


Vol. 7,  No. 9, pp. 2827-2835, Sep.  2000
10.3745/KIPSTE.2000.7.9.2827


PDF
  Abstract

In recent years, much attention has been focused on improving I/O devices' processing speed which is essential in such large data processing areas as multimedia data processing. And studies on high-performance parallel file systems are considered to be one of such efforts. In this paper, an efficient disk allocation scheme is proposed for high-performance parallel file systems. In other words, the concept of a parallel disk file''s parallelism is defined using data declustering characteristic of a given parallel file. With the concept, an efficient disk allocation scheme is proposed which calculates the appropriate degree of data declustering on disks for each parallel file in order to obtain the maximum throughput when more than one parallel file is used at the same time. Since, calculation for obtaining the maximum throughput is too complex as the number of parallel files increases, an approximate disk allocation algorithm is also proposed in this paper. The approximate algorithm is very simple and especially provides very good results when I/O workload is high. In addition, it has shown that the approximate algorithm provides the optimal disk allocation for the maximum throughput when the arrival rate of I/O requests is infinite.

  Statistics


  Cite this article

[IEEE Style]

K. H. Park, "A Disk Allocation Scheme for High - Performance Parallel File Systems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 9, pp. 2827-2835, 2000. DOI: 10.3745/KIPSTE.2000.7.9.2827.

[ACM Style]

Kee Hyun Park. 2000. A Disk Allocation Scheme for High - Performance Parallel File Systems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 9, (2000), 2827-2835. DOI: 10.3745/KIPSTE.2000.7.9.2827.