An Optimization Load Balancing Algorithm Design in Massive Storage System

Author

Zhenjie, Deng ; Yan, Cui

Author_Institution

Hebei Univ. of Technol., Langfang, China

Volume

3

fYear

2009

fDate

4-5 July 2009

Firstpage

310

Lastpage

313

Abstract

Modeling on the average storage response time to a single file and the RAID disk array is accomplished by using M/G/1 queuing theory, and the optimal load balancing algorithm based on this model is addressed, and its implementation method is given. The optimal stripe algorithm is effective by simulation experimental verification; it can use the corresponding SU (stripe unit) and SW (stripe width) according to the different storage access characteristics and different access flow, so it has the shortest storage access response time.

Keywords

RAID; optimisation; queueing theory; resource allocation; scheduling; storage management; M/G/1 queuing theory; RAID disk array; dynamic scheduling strategy; massive storage system; optimal stripe algorithm; optimization load balancing algorithm design; simulation experimental verification; static scheduling strategy; storage access; stripe unit; stripe width; Algorithm design and analysis; Bandwidth; Delay; Design engineering; Design optimization; Dynamic scheduling; Load management; Queueing analysis; Space technology; Throughput; RAID; load balancing; massive storage; optimization stripe; storage access;

fLanguage

English

Publisher

ieee

Conference_Titel

Environmental Science and Information Application Technology, 2009. ESIAT 2009. International Conference on

Conference_Location

Wuhan

Print_ISBN

978-0-7695-3682-8

Type

conf

DOI

10.1109/ESIAT.2009.479

Filename

5199697