block i/o scheduling on storage servers of distributed file systems

This paper presents a new scheme of i/o scheduling on storage servers of distributed/parallel file systems, for yielding better i/o performance. to this end, we first analyze read/write requests in the i/o queue of storage server (we name them block i/os), by using our proposed technique of horizontal partition. then, all block requests are supposed to be divided into multiple groups, on the basis of their offsets. this is to say, all requests related to the same chunk file will be grouped together, and then be satisfied within the same time slot between opening and closing the target chunk file on the storage server. as a result, the time resulted by completing block i/o requests can be significantly decreased, because of less file operations on the corresponding chunk files at the low-level file systems of server machines. furthermore, we introduce an algorithm to rate a priority for each group of block i/o requests, and then the storage server dispatches groups of i/os by following the priority order. consequently, the applications having higher i/o priorities, e.g. they have less i/o operations and small size of involved data, can finish at a earlier time. we implement a prototype of this server-side scheduling in the parte file system, to demonstrate the feasibility and applicability of the proposed scheme. experimental results show that the newly proposed scheme can achieve better i/o bandwidth and less i/o time, compared with the strategy of first come first served, as well as other server-side i/o scheduling approaches.