# MQHD: Dynamic Load Balancing Method for Energy-Aware Storage Systems

Authors: Xiaoling Xie
Journal: Scientific Programming
 (2020)

---

## Abstract

Aiming at the problem that some disks of energy-aware storage systems are easily overloaded, a dynamic load balancing method based on multiqueue and heat degree (MQHD) is proposed. According to data popularity, MQHD divides data into multiple least recently used (LRU) queues by data access frequency and access temporal locality and uses heat degree to measure the load pressure brought by each data unit to a disk. When a disk is overloaded, MQHD calculates the load pressure ratio (LPR) according to the disk overload degree and then selects some appropriate data to migrate according to the LPR. The experimental results show that, compared with the popular data concentration method (PDC), the workload-adaptive management method (WAM), and the energy model-based file migration strategy (EM-FMS), MQHD is the most effective. Under given experimental conditions, the request change ratio (RCR) value of MQHD is 0.371, EM-FMS is 0.2872, and WAM is 0.0114. Compared with EM-FMS, MQHD has better rapidity and less overhead.


---

## Body

## 1. Introduction

In a medium-sized data center, the energy cost of storage system can be as high as $700 million to $900 million per year [1]. In order to reduce the energy consumption of storage system, various types of energy-aware storage systems have been proposed. The practice of most energy-aware storage systems is to tilt the access load to some disks, so that other disks can enter a low-power standby state or completely shut down to achieve energy saving [2, 3]. This practice solves the energy-saving problem of the storage system, but it also brings a side effect; that is, the disks with skewed load can easily be overloaded, resulting in a delayed response of requests. It is important to balance the load of these disks dynamically, solve the overload problem of these disks, and eliminate this side effect.The basic principle of the dynamic load balancing method is that when a disk is detected to be overloaded, migrate the hot data of the disk to other light-loaded disks until the disk is no longer overloaded. The dynamic load balancing method needs to solve two key problems [4, 5]: (i) How to recognize hot data? (ii) How much data should be migrated at a time?Aiming at the two key problems, a dynamic load balancing method based on multiqueue and heat degree (MQHD) is proposed in this paper. MQHD can recognize hot data accurately based on multiqueue and only maintain the hot data as a migration object, improve the effectiveness of load adjustment, and reduce the overhead. In addition, MQHD uses heat degree to measure the load pressure brought by each data unit to a disk and conducts batch data migration according to the load state of each disk so as to improve the speed and effectiveness of load adjustment. The experimental results show that, compared with the current popular dynamic load balancing methods for energy-aware storage systems, MQHD is the most effective and has better rapidity and less overhead.The rest of this paper is organized as follows. Section2 summarizes the relevant research work. Section 3 introduces MQHD in detail. Section 4 verifies MQHD. Section 5 summarizes this paper and outlines future work.


## 2. Related Work

In order to prevent the disks that store hot data from being overloaded, the popular data concentration method (PDC) estimates the future load of each disk. The expected load associated with a file is estimated by dividing its size by its average access time interval. PDC migrates data to a disk periodically until the expected load of the disk is close to its maximum bandwidth [6, 7]. PDC is a simple and convenient solution to the problem of disk overload, its overhead is small, but the effect is difficult to guarantee. When the load suddenly increases, the system is difficult to adjust in real time, and the effect is poor.In order to achieve load balancing among hot disks, a dynamic load balancing method for an energy-aware storage system named workload-adaptive management (WAM) was proposed [1]. Whenever a request arrives at a hot disk, WAM checks whether the disk's request arrival speed is greater than the overload threshold. If so, the disk will be marked as a hot disk. Next, for each request that arrived at the disk, WAM locates the data block of the request after servicing it and then exchanges the data block with an unaccessed data block of an unoverloaded disk. Such exchange will continue until the disk's request arrival speed is less than or equal to the target threshold, and then the hot tag will be removed from the disk. WAM detects the request arrival speed of the disk and compares it with the overload threshold and target threshold. If the disk's request arrival speed exceeds the overload threshold, the data block will be exchanged until the disk's request arrival speed is less than or equal to the target threshold. WAM can always make the request arrival speed of the hot disk less than or equal to the target threshold, but the exchange only occurs when the request arrives at the disk, and only the requested data block is exchanged at a time, which makes it difficult to quickly and effectively eliminate the overload state of the hot disk [8].In order to achieve load balancing of a heterogeneous storage system, an energy model-based file migration strategy (EM-FMS) was proposed [9]. The file energy model is related to the file’s number of accesses, concurrent access situation, size, and access interval. EM-FMS determines whether a storage unit triggers the file migration operation according to the available bandwidth of the storage unit and the probability-based migration trigger function. For all storage units that trigger the file migration operation, EM-FMS selects the file with the highest energy density from the currently accessed files for migration. EM-FMS uses an energy model to measure the load pressure on the storage system caused by the file, which is beneficial to select correct files for migration. However, too much calculation is needed to calculate the energy value of each file, which results in a large system overhead. At the same time, because only the file with the highest energy density is selected for migration at a time, it is difficult to quickly eliminate the overload state of the overloaded storage unit [10].Therefore, although the above research works have achieved some results, the high overhead, low speed, and poor effectiveness problems of dynamic load balancing in energy-aware storage systems have not been comprehensively solved yet.


## 3. MQHD: Dynamic Load Balancing Method Based on Multiqueue and Heat Degree

### 3.1. Hot Data Recognition Based on Multiqueue

When a disk is overloaded, some data need to be migrated for load adjustment, so it is important to recognize hot data accurately to select the appropriate data for migration. The multiqueue (MQ) algorithm is a proven effective cache management method [11]. Based on the idea of the MQ algorithm, this paper proposes a hot data recognition method based on multiqueue which is used to identify the data for migration.For the convenience of describing the method, the following definitions are given.Definition 1.
Hot Data Unit (HDU). It refers to a data unit that has been frequently accessed recently. It is the migration object of load adjustment. According to the different interface levels of an energy-aware storage system, a data unit represents a data block or a file.Definition 2.
Queue. According to the popularity of HDUs, the HDUs are divided into multiple queues by access frequency and access temporal locality. These queues use the LRU rules to arrange HDUs and are represented by Qi, where ii=0,1,2,…, indicates the popularity level of the queue. The larger the number, the higher the popularity level of the queue, such as Q0<Q1<Q2<⋯.Definition 3.
Life Cycle (LC). It refers to the allowed time that an HDU has not been accessed in a queue Qi. When an HDU stays in a queue Qi for longer than LC without any request access to it, this HDU will be degraded to the next lower-level queue Qi−1. If this HDU is in the queue Q0, it will be removed from the queue.Definition 4.
Expire Time (ET). It refers to the time when an HDU needs to be removed from a queue. It is equal to the sum of the time at which this HDU was last accessed and the LC of this HDU.Definition 5.
Logical Time. It refers to the time measured by the number of accesses. The first access of the disk is time 1, and the second access is time 2. The LC and ET defined above are measured by logical time.
The hot data recognition method based on multiqueue is described as follows:(i)
The system maintains multiple LRU queues named asQ0,Q1,…,Qn, as shown in Figure 1.(ii) When an HDU enters a queue, the HDU is placed at the end of the queue and its ET is set to the sum of the current time and LC, as shown in Figure2.(iii) Each queue has a maximum access count. If an HDU in the queue is accessed more than2i times, then the HDU will be promoted to the end of the queue Qi+1 and its ET will be set to the sum of the current time and LC, as shown in Figure 3.(iv) For each access, compare the ET of the HDU of each queue head with the current time. If the former is smaller than the latter and the queue in which the HDU is located is not the queueQ0, the HDU will be moved to the end of the next lower-level queue, and its number of accesses will be halved and its ET is reset to the current time plus LC, as shown in Figure 4. If the former is smaller than the latter and the queue in which the HDU is located is the queue Q0, the number of accesses of the HDU will be set to 0 and the HDU will be cleared out of the queue, as shown in Figure 5.
The pseudocode of the hot data recognition Algorithm1 is described as follows.Figure 1
Multiqueue hot data.Figure 2
HDUa entersQ0.Figure 3
HDUn is promoted from queueQ0 to queue Q1.Figure 4
HDUr is degraded to the end of Q0 from Q1.Figure 5
HDUm is cleared out of the queue.Algorithm 1: The hot data recognition algorithm.
Input: a requestOutput:Q0,Q1,…,Qn(1)
current Time⟵current Time+1;(2)
ETcurrent File⟵current Time+LC;(3)
ifaccess Timescurrent File=0then;(4)
place the current file node at the end ofQ0(5)
else(6)
old QueueID⟵log2access Timescurrent File;(7)
access Timescurrent File⟵access Timescurrent File+1;(8)
new QueueID⟵log2access Timescurrent File;(9)
ifold QueueID=new QueueIDthen(10)
place the current file node at the end of the original queue;(11)
else(12)
place the current file node at the end of the new queue;(13)
end if(14)
end if(15)
ifQ0∧ETQ0⋅file≤current Timethen(16)
access TimesQ0⋅file⟵0;(17)
Q0⟵Q0⋅next;(18)
end if(19)
fori=1tondo(20)
ifQi∧ETQi⋅file≤current Timethen(21)
access TimesQi⋅file⟵access TimesQi⋅file/2;(22)
ETQi⋅file⟵current Time+LC;(23)
new QueueID⟵log2access TimesQi⋅file;(24)
move the head node ofQi to the end of the new queue;(25)
end if(26)
end for


### 3.2. Heat Degree

After recognizing the hot data, a certain number of HDUs should be selected for load adjustment, which is related to the rapidity of load adjustment. Since the load pressure on the disk caused by each HDU is different, the load pressure needs to be measured by an appropriate parameter. In this paper, heat degree is used as the parameter, as defined in Definition6.Definition 6.
Heat Degree (HD). It reflects the degree of the load pressure that an HDU brings to a disk in a certain period of time. It is represented by a number between (0, 1]. The larger the number, the greater the load pressure that HDU brings to a disk. The sum of HDs of all HDUs on the same disk is equal to 1.
In general, the HD of an HDU is related to the following two factors:(i)
Access frequency: The HDU that is with more number of accesses in the recent period is more likely to be accessed multiple times in the future period, and its HD is greater.(ii)
Time frequency: The HDU that was frequently accessed in the past but was not accessed in a relatively long period of time is less likely to be accessed in the future, and its HD should be smaller. In other words, the HD of an HDU that is frequently accessed recently should be greater.
In the hot data recognition method based on multiqueue, the access frequency of an HDU is reflected by the queue number, and which queue the HDU is placed in is determined by(1)i=log2times.
In the above equation,i is the queue number where the HDU is located, times is the number of accesses of the HDU, and [] is a rounding symbol.
The time frequency is reflected by the LC of the HDU. For an HDU that has not been accessed during the LC period, its number of accesses will be halved and it will be moved to the end of the next lower-level queue. If this HDU is in the queueQ0, it will be removed from the queue. Therefore, in the hot data recognition method based on multiqueue, the time frequency of HDU is also directly related to the queue number.
Based on the above considerations, equation (2) is used to calculate the HD of an HDU. In the same queue, the HDs are considered to be the same. HDSi is used to represent the HD of a single HDU belonging to the disk S in queue i.(2)HDSi=2i∑j=0n−1Lsj2j.
In the above equation,i is the queue number where the HDU is located, j is the queue number, n is the number of queues, and LSj is the number of the HDUs belonging to the disk S in queue j.
In order to measure the load pressure brought by a certain number of HDUs to a disk, the load pressure ratio is used.Definition 7.
Load Pressure Ratio (LPR). It refers to the load pressure brought by a certain number of HDUs to a disk. Its value is the sum of HD values of the selected HDUs belonging to a disk. The calculation equation is as shown in equation (3).(3)LPRS=∑i=0n−1numSi×HDSi.
In the above equation,i is the queue number where the HDU is located, n is the number of queues, and numSi is the number of the HDUs belonging to the disk S selected from queue i.


### 3.3. MQHD Method

The MQHD method determines overloaded disks according to the load state of each disk, calculates LPR according to the overload degree of each overloaded disk, and selects appropriate HDUs for data migration according to the LPR. For every migration, MQHD considers the new load state of the overloaded disk and rediscovers the disk with the lightest load as the load migration object, thus ensuring the dynamics of the load adjustment.MQHD usesLS to measure the load state of disk S. According to the actual situation, LS can be the average response time of requests, the request queue length of the disk, the system throughput, and so on [12].In order to determine whether a disk needs to migrate data out or whether data can be migrated to the disk, two thresholds are used, namely, overload (OL) and safe load (SL). The regulations are as follows:(i)
IfLS>OL, it means that disk S is overloaded and needs to migrate data out.(ii)
IfLS<SL, it means that disk S has a light load and data can be migrated to it.(iii)
IfSL≤LS≤OL, it means that the load of disk S lies in a hysteresis region; it is not necessary to migrate data out and cannot migrate data to it. By means of setting the hysteresis region, it can effectively avoid the situation that the same piece of data is migrated back and forth across the same disks.In order to determine the HDUs that need to be migrated, the concepts of overload amount and safety margin are introduced, as defined as follows.Definition 8.
Overload Amount. The ratio of LSn−OL and LSn, where LSn is the load of the overloaded disk Sn, is denoted by α%.
α% can be expressed by equation (4).(4)α%=LSn−OLLSn×100%.Definition 9.
Safety Margin. The ratio of SL−LSm and LSn, where LSm is the load of the light-loaded disk Sm and LSn is the load of the overloaded disk Sn, is denoted by β%.
β% can be expressed by(5)β%=SL−LSmLSn×100%.
For an overloaded disk, the load pressure caused by HDUs is measured by LPR. Therefore, the LPR value of the HDUs that need to be migrated is calculated by(6)LPRSn=cα%.
In the above equation,LPRSn is the LPR value of the HDUs that need to be migrated out of the overloaded disk Sn; c is the migration-out adjustment coefficient. c is used to adjust the corresponding relationship between the overload amount and LPR, it is adjusted according to the adjustment effect during the dynamic adjustment process, and the initial value is 0.8.
For a light-loaded disk, the LPR value of the HDUs that can be migrated into it is calculated by(7)LPRSm=kβ%.
In the above equation,LPRSm is the LPR value of the HDUs that can be migrated into the light-loaded disk Sm; k is the migration-in adjustment coefficient. k is used to adjust the corresponding relationship between the safety margin and LPR, it is adjusted according to the adjustment effect during the dynamic adjustment process, and the initial value is 0.8.
The MQHD method is described as follows:(i)
Find an overloaded diskSn. If it was previously used as a migration-in disk (the migration-in disk flag is 1), then reduce its migration-out adjustment coefficient cSn by 10%. Set its migration-in adjustment coefficient kSn to the initial value, migration-in disk flag to 0, and migration-out disk flag to 1 and then calculate its overload amount α% and the load pressure ratio LPRSn that need to be migrated.(ii)
Find a diskSm that has the lightest load and can be migrated data to it. If it was previously used as a migration-out disk (the migration-out disk flag is 1), then reduce its migration-in adjustment coefficient kSm by 10%. Set its migration-out adjustment coefficient cSm to the initial value, migration-out disk flag to 0, and migration-in disk flag to 1 and then calculate its safety margin β% and the load pressure ratio LPRSm it can accept. If the acceptable LPRSm of the disk is greater than the LPRSn that needs to be migrated out of the overloaded disk Sn, then the HDUs shall be selected for migration according to LPRSn, equation (3), and the principles described in the next paragraph. Otherwise, the HDUs shall be selected for migration according to LPRSm, equation (3), and the principles described in the next paragraph.(iii)
The principles of selecting HDUs according to LPR are as follows: (i) Global perspective: try to get HDUs from each queue to avoid the problem of the excessive local error caused by selecting HDUs from a certain queue. (ii) Introducing randomness: when getting one HDU from one queue, randomly select one HDU from the queue to avoid the problem of the excessive local error caused by selecting the HDU in a fixed order.(iv)
Rejudge the load state of the overloaded diskSn after a migration. If it is still overloaded, repeat the load adjustment process.
The pseudocode of the MQHD Algorithm2 is described as follows.Algorithm 2: The MQHD algorithm.
(1)
procedure LOADBALANCING(2)
whileLi>OLdo(3)
ififlagi=1thenci⟵0.9×ci;(4)
ki⟵0.8;(5)
iflagi⟵0;(6)
oflagi⟵1;(7)
αi⟵Li−OL/Li×100%;(8)
LPRi⟵ci×αi;(9)
min⟵1(10)
forj=2tondo(11)
ifLj<Lminthenmin⟵j;(12)
end for(13)
ifLmin<SLthen(14)
ifoflagmin=1thenkmin⟵0.9×kmin;(15)
cmin⟵0.8;(16)
oflagi⟵0;(17)
iflagi⟵1;(18)
βi⟵SL−Lmin/Li×100%;(19)
LPRmin⟵kmin×βi;(20)
ifLPRi⟵LPRminthen(21)
get the serial numbers of the HDUs for migration based onLPRi;(22)
migrage the HDUs selected for migration;(23)
else(24)
get the serial numbers of the HDUs for migration based onLPRmin;(25)
migrage the HDUs selected for migration;(26)
end if(27)
end if(28)
end while(29)
end procedure


## 3.1. Hot Data Recognition Based on Multiqueue

When a disk is overloaded, some data need to be migrated for load adjustment, so it is important to recognize hot data accurately to select the appropriate data for migration. The multiqueue (MQ) algorithm is a proven effective cache management method [11]. Based on the idea of the MQ algorithm, this paper proposes a hot data recognition method based on multiqueue which is used to identify the data for migration.For the convenience of describing the method, the following definitions are given.Definition 1.
Hot Data Unit (HDU). It refers to a data unit that has been frequently accessed recently. It is the migration object of load adjustment. According to the different interface levels of an energy-aware storage system, a data unit represents a data block or a file.Definition 2.
Queue. According to the popularity of HDUs, the HDUs are divided into multiple queues by access frequency and access temporal locality. These queues use the LRU rules to arrange HDUs and are represented by Qi, where ii=0,1,2,…, indicates the popularity level of the queue. The larger the number, the higher the popularity level of the queue, such as Q0<Q1<Q2<⋯.Definition 3.
Life Cycle (LC). It refers to the allowed time that an HDU has not been accessed in a queue Qi. When an HDU stays in a queue Qi for longer than LC without any request access to it, this HDU will be degraded to the next lower-level queue Qi−1. If this HDU is in the queue Q0, it will be removed from the queue.Definition 4.
Expire Time (ET). It refers to the time when an HDU needs to be removed from a queue. It is equal to the sum of the time at which this HDU was last accessed and the LC of this HDU.Definition 5.
Logical Time. It refers to the time measured by the number of accesses. The first access of the disk is time 1, and the second access is time 2. The LC and ET defined above are measured by logical time.
The hot data recognition method based on multiqueue is described as follows:(i)
The system maintains multiple LRU queues named asQ0,Q1,…,Qn, as shown in Figure 1.(ii) When an HDU enters a queue, the HDU is placed at the end of the queue and its ET is set to the sum of the current time and LC, as shown in Figure2.(iii) Each queue has a maximum access count. If an HDU in the queue is accessed more than2i times, then the HDU will be promoted to the end of the queue Qi+1 and its ET will be set to the sum of the current time and LC, as shown in Figure 3.(iv) For each access, compare the ET of the HDU of each queue head with the current time. If the former is smaller than the latter and the queue in which the HDU is located is not the queueQ0, the HDU will be moved to the end of the next lower-level queue, and its number of accesses will be halved and its ET is reset to the current time plus LC, as shown in Figure 4. If the former is smaller than the latter and the queue in which the HDU is located is the queue Q0, the number of accesses of the HDU will be set to 0 and the HDU will be cleared out of the queue, as shown in Figure 5.
The pseudocode of the hot data recognition Algorithm1 is described as follows.Figure 1
Multiqueue hot data.Figure 2
HDUa entersQ0.Figure 3
HDUn is promoted from queueQ0 to queue Q1.Figure 4
HDUr is degraded to the end of Q0 from Q1.Figure 5
HDUm is cleared out of the queue.Algorithm 1: The hot data recognition algorithm.
Input: a requestOutput:Q0,Q1,…,Qn(1)
current Time⟵current Time+1;(2)
ETcurrent File⟵current Time+LC;(3)
ifaccess Timescurrent File=0then;(4)
place the current file node at the end ofQ0(5)
else(6)
old QueueID⟵log2access Timescurrent File;(7)
access Timescurrent File⟵access Timescurrent File+1;(8)
new QueueID⟵log2access Timescurrent File;(9)
ifold QueueID=new QueueIDthen(10)
place the current file node at the end of the original queue;(11)
else(12)
place the current file node at the end of the new queue;(13)
end if(14)
end if(15)
ifQ0∧ETQ0⋅file≤current Timethen(16)
access TimesQ0⋅file⟵0;(17)
Q0⟵Q0⋅next;(18)
end if(19)
fori=1tondo(20)
ifQi∧ETQi⋅file≤current Timethen(21)
access TimesQi⋅file⟵access TimesQi⋅file/2;(22)
ETQi⋅file⟵current Time+LC;(23)
new QueueID⟵log2access TimesQi⋅file;(24)
move the head node ofQi to the end of the new queue;(25)
end if(26)
end for


## 3.2. Heat Degree

After recognizing the hot data, a certain number of HDUs should be selected for load adjustment, which is related to the rapidity of load adjustment. Since the load pressure on the disk caused by each HDU is different, the load pressure needs to be measured by an appropriate parameter. In this paper, heat degree is used as the parameter, as defined in Definition6.Definition 6.
Heat Degree (HD). It reflects the degree of the load pressure that an HDU brings to a disk in a certain period of time. It is represented by a number between (0, 1]. The larger the number, the greater the load pressure that HDU brings to a disk. The sum of HDs of all HDUs on the same disk is equal to 1.
In general, the HD of an HDU is related to the following two factors:(i)
Access frequency: The HDU that is with more number of accesses in the recent period is more likely to be accessed multiple times in the future period, and its HD is greater.(ii)
Time frequency: The HDU that was frequently accessed in the past but was not accessed in a relatively long period of time is less likely to be accessed in the future, and its HD should be smaller. In other words, the HD of an HDU that is frequently accessed recently should be greater.
In the hot data recognition method based on multiqueue, the access frequency of an HDU is reflected by the queue number, and which queue the HDU is placed in is determined by(1)i=log2times.
In the above equation,i is the queue number where the HDU is located, times is the number of accesses of the HDU, and [] is a rounding symbol.
The time frequency is reflected by the LC of the HDU. For an HDU that has not been accessed during the LC period, its number of accesses will be halved and it will be moved to the end of the next lower-level queue. If this HDU is in the queueQ0, it will be removed from the queue. Therefore, in the hot data recognition method based on multiqueue, the time frequency of HDU is also directly related to the queue number.
Based on the above considerations, equation (2) is used to calculate the HD of an HDU. In the same queue, the HDs are considered to be the same. HDSi is used to represent the HD of a single HDU belonging to the disk S in queue i.(2)HDSi=2i∑j=0n−1Lsj2j.
In the above equation,i is the queue number where the HDU is located, j is the queue number, n is the number of queues, and LSj is the number of the HDUs belonging to the disk S in queue j.
In order to measure the load pressure brought by a certain number of HDUs to a disk, the load pressure ratio is used.Definition 7.
Load Pressure Ratio (LPR). It refers to the load pressure brought by a certain number of HDUs to a disk. Its value is the sum of HD values of the selected HDUs belonging to a disk. The calculation equation is as shown in equation (3).(3)LPRS=∑i=0n−1numSi×HDSi.
In the above equation,i is the queue number where the HDU is located, n is the number of queues, and numSi is the number of the HDUs belonging to the disk S selected from queue i.


## 3.3. MQHD Method

The MQHD method determines overloaded disks according to the load state of each disk, calculates LPR according to the overload degree of each overloaded disk, and selects appropriate HDUs for data migration according to the LPR. For every migration, MQHD considers the new load state of the overloaded disk and rediscovers the disk with the lightest load as the load migration object, thus ensuring the dynamics of the load adjustment.MQHD usesLS to measure the load state of disk S. According to the actual situation, LS can be the average response time of requests, the request queue length of the disk, the system throughput, and so on [12].In order to determine whether a disk needs to migrate data out or whether data can be migrated to the disk, two thresholds are used, namely, overload (OL) and safe load (SL). The regulations are as follows:(i)
IfLS>OL, it means that disk S is overloaded and needs to migrate data out.(ii)
IfLS<SL, it means that disk S has a light load and data can be migrated to it.(iii)
IfSL≤LS≤OL, it means that the load of disk S lies in a hysteresis region; it is not necessary to migrate data out and cannot migrate data to it. By means of setting the hysteresis region, it can effectively avoid the situation that the same piece of data is migrated back and forth across the same disks.In order to determine the HDUs that need to be migrated, the concepts of overload amount and safety margin are introduced, as defined as follows.Definition 8.
Overload Amount. The ratio of LSn−OL and LSn, where LSn is the load of the overloaded disk Sn, is denoted by α%.
α% can be expressed by equation (4).(4)α%=LSn−OLLSn×100%.Definition 9.
Safety Margin. The ratio of SL−LSm and LSn, where LSm is the load of the light-loaded disk Sm and LSn is the load of the overloaded disk Sn, is denoted by β%.
β% can be expressed by(5)β%=SL−LSmLSn×100%.
For an overloaded disk, the load pressure caused by HDUs is measured by LPR. Therefore, the LPR value of the HDUs that need to be migrated is calculated by(6)LPRSn=cα%.
In the above equation,LPRSn is the LPR value of the HDUs that need to be migrated out of the overloaded disk Sn; c is the migration-out adjustment coefficient. c is used to adjust the corresponding relationship between the overload amount and LPR, it is adjusted according to the adjustment effect during the dynamic adjustment process, and the initial value is 0.8.
For a light-loaded disk, the LPR value of the HDUs that can be migrated into it is calculated by(7)LPRSm=kβ%.
In the above equation,LPRSm is the LPR value of the HDUs that can be migrated into the light-loaded disk Sm; k is the migration-in adjustment coefficient. k is used to adjust the corresponding relationship between the safety margin and LPR, it is adjusted according to the adjustment effect during the dynamic adjustment process, and the initial value is 0.8.
The MQHD method is described as follows:(i)
Find an overloaded diskSn. If it was previously used as a migration-in disk (the migration-in disk flag is 1), then reduce its migration-out adjustment coefficient cSn by 10%. Set its migration-in adjustment coefficient kSn to the initial value, migration-in disk flag to 0, and migration-out disk flag to 1 and then calculate its overload amount α% and the load pressure ratio LPRSn that need to be migrated.(ii)
Find a diskSm that has the lightest load and can be migrated data to it. If it was previously used as a migration-out disk (the migration-out disk flag is 1), then reduce its migration-in adjustment coefficient kSm by 10%. Set its migration-out adjustment coefficient cSm to the initial value, migration-out disk flag to 0, and migration-in disk flag to 1 and then calculate its safety margin β% and the load pressure ratio LPRSm it can accept. If the acceptable LPRSm of the disk is greater than the LPRSn that needs to be migrated out of the overloaded disk Sn, then the HDUs shall be selected for migration according to LPRSn, equation (3), and the principles described in the next paragraph. Otherwise, the HDUs shall be selected for migration according to LPRSm, equation (3), and the principles described in the next paragraph.(iii)
The principles of selecting HDUs according to LPR are as follows: (i) Global perspective: try to get HDUs from each queue to avoid the problem of the excessive local error caused by selecting HDUs from a certain queue. (ii) Introducing randomness: when getting one HDU from one queue, randomly select one HDU from the queue to avoid the problem of the excessive local error caused by selecting the HDU in a fixed order.(iv)
Rejudge the load state of the overloaded diskSn after a migration. If it is still overloaded, repeat the load adjustment process.
The pseudocode of the MQHD Algorithm2 is described as follows.Algorithm 2: The MQHD algorithm.
(1)
procedure LOADBALANCING(2)
whileLi>OLdo(3)
ififlagi=1thenci⟵0.9×ci;(4)
ki⟵0.8;(5)
iflagi⟵0;(6)
oflagi⟵1;(7)
αi⟵Li−OL/Li×100%;(8)
LPRi⟵ci×αi;(9)
min⟵1(10)
forj=2tondo(11)
ifLj<Lminthenmin⟵j;(12)
end for(13)
ifLmin<SLthen(14)
ifoflagmin=1thenkmin⟵0.9×kmin;(15)
cmin⟵0.8;(16)
oflagi⟵0;(17)
iflagi⟵1;(18)
βi⟵SL−Lmin/Li×100%;(19)
LPRmin⟵kmin×βi;(20)
ifLPRi⟵LPRminthen(21)
get the serial numbers of the HDUs for migration based onLPRi;(22)
migrage the HDUs selected for migration;(23)
else(24)
get the serial numbers of the HDUs for migration based onLPRmin;(25)
migrage the HDUs selected for migration;(26)
end if(27)
end if(28)
end while(29)
end procedure


## 4. Experimental Verification and Analysis

This section verifies MQHD and compares it against PDC, WAM, and EM-FMS.


### 4.1. Experimental Environment

Request generator and energy-aware storage system simulator are designed in the experiment.The request generator can generate storage system request records based on the number of requests, request rate, disk coverage, data coverage, disk popularity, and data popularity specified by the user. The request rate is the number of requests that arrive at the storage system in unit time, and it is assumed that the request arrival time is subject to an exponential distribution. Disk coverage represents the number of disks that are accessed as a percentage of the number of all disks. Data coverage represents the number of data units that are accessed as a percentage of the number of all data units. Disk popularity represents the degree of centralization of disks to be accessed; it is expressed by a coefficient in the range of (0–1) in Zipf's law. The closer the coefficient is to 1, the more the accesses are centralized on partial disks. For a specified disk, the Zipf distribution formula is used to calculate its assessed probability, as shown in equation (8). Data popularity is similar to disk popularity in meaning, indicating the degree of concentration of data is accessed.(8)Pi=1/iθ∑j=1n1/jθ.In the above equation,Pi is the probability of disk be accessed, n is the number of disks be accessed, i and j are the ranking of the disk’s accessed probability, and θ is the disk popularity.In the experiment, the parameters of request generator are set as follows: the number of requests is 1000; the request rate of the first 200 requests is 50/s; the request rate of the last 800 requests is 300/s; the disk coverage is 25%; the disk popularity is 0.5; the data coverage is 5%; the data popularity is 0.5. Table1 shows the parameters used by the request generator when generating records.Table 1
Request parameters.
ParameterNumber of requestsRequest rateDisk coverage (%)Disk popularityData coverage (%)Data popularityValue100050 or 300250.550.5In the energy-aware storage system simulated by the energy-aware storage system simulator, disks are divided into two groups: data disk group and cache disk group. The disks of the data disk group are not always rotating. Some disks of the data disk group that have been not accessed for a while will be transited into a standby state according to the power management method to save energy. The disks of the cache disk group keep rotating; they store the data that is frequently accessed. The controller tries to ensure that frequently accessed data is copied to the disks of the cache disk group [11].In the energy-aware storage system simulator, besides, MQHD, PDC, WAM, and EM-FMS are also implemented.In order to observe the overload situation and focus on the overload situation of the local storage units, a small size energy-aware storage system is configured. The parameters of the energy-aware storage system used in the experiment are configured as follows: the number of cache disks is 2, the number of data disks is 4, the capacity of a single cache disk is 500, and the capacity of a single data disk is 1000. In the energy-aware storage system simulator, the average service time of requests is set to 8 ms. The disk load is measured by the disk's request response time,OL is set to 48 ms, and SL is set to 24 ms.


### 4.2. Evaluation Methods and Indicators

We evaluate the load balancing methods from three aspects: effectiveness, rapidity, and overhead.


#### 4.2.1. Effectiveness

The effectiveness of the load balancing method means that when disk overload occurs, the method can eliminate the overload state of the disk by timely load adjustment. For an effective load balancing method, its effectiveness is measured by the request change ratio (RCR). RCR is equal to the ratio of the number of requestsnafter that arrive at the disk when using the load balancing method to the number of requests nbefore that arrive at the disk when the load balancing method is not used:(9)RCR=nafternbefore.The larger the RCR value is, the more accurately the load balancing method can control the change of load size, without causing too much data to be migrated, and the more effective it is.


#### 4.2.2. Rapidity

The rapidity of the load balancing method is measured by the adjusting timeta and the average response time of requests tr. ta is the time taken to adjust the disk out from an overload state, which is represented in logical time in this paper. tr is the average response time of all requests in the stage of adjusting the disk from overload to not overload.


#### 4.2.3. Overhead

In order to select appropriate HDUs for migration during load adjustment, the load balancing method should maintain the information of a certain amount of HDUs. The load adjustment overhead is represented by the ratio of the number of HDUs maintained to the number of data units of the overloaded disk.


### 4.3. Experimental Results and Analysis

Figure6 shows a cache disk response without using the load balancing method. As it can be seen from Figure 6, when the request rate is increased from 50/s to 300/s, the disk begins to overload, and the response of the disk deteriorates with time, resulting in a large number of delayed requests.Figure 6
A cache disk response without using the load balancing method.Figures7(a)–7(d) show the disk response when using PDC, WAM, EM-FMS, and MQHD, respectively.Figure 7
Disk response after using PDC, WAM, EM-FMS, and MQHD, respectively. (a) PDC. (b) WAM. (c) EM-FMS. (d) MQHD.
(a)(b)(c)(d)


#### 4.3.1. Effectiveness Analysis

PDC periodically performs hot data migration and estimates the future load of each disk as it migrates data, ensuring that the expected load of the disk is close to its maximum bandwidth. As shown in Figure7(a), when disk overload occurred at the beginning of the 212 requests, PDC did not perform load adjustment in time. PDC did not perform load adjustment until about 300 requests, when the timing migration time arrived, which had caused a large number of requests to be delayed. It can be seen that the PDC's adjustment is affected by the timing time. When disk overload occurs, PDC takes more time to respond to load adjustment.When disk overload occurs, for each request that arrived at the disk, WAM locates the data block of the request after servicing it and then exchanges the data block with an unaccessed data block of an unoverloaded disk. Such an exchange will continue until the disk's request arrival speed is less than or equal to the target threshold. Because there is no distinction between the popularity of data, WAM is blind in choosing blocks, which may cause too much data to be migrated and cause the RCR to be too small, so that the effectiveness of load adjustment is bad. As shown in Figure7(b), after load adjustment by WAM, disk requests are greatly reduced, and the RCR value is only 0.0114. Therefore, the WAM method is less effective.When disk overload occurs, EM-FMS selects the file with the highest energy density from the currently accessed files for migration. Because the popularity of data has been distinguished, EM-FMS is specific in selecting files, so its load adjustment is more effective. As shown in Figure7(c), after load adjustment, the disk request is not greatly reduced, and the RCR value is 0.2872.When the disk is overloaded, MQHD determines the appropriate LPR according to the overload degree of the overloaded disk and selects appropriate HDUs to perform data migration according to the LPR. By considering the overload degree and the heat degree of HDU, MQHD is more targeted than other methods. As shown in Figure7(d), after load adjustment, the disk utilization is still high, the RCR value is 0.3721.It can be seen that, among the four methods, PDC takes more time to respond to load adjustment and WAM is less effective, while EM-FMS and MQHD are more effective. Table2 shows RCR of PDC, WAM, EM-FMS, and MQHD.Table 2
RCR of PDC, WAM, EM-FMS, and MQHD.
MethodPDCWAMEM-FMSMQHDRCR0.30130.01410.28720.3721


#### 4.3.2. Rapidity Analysis

Table3 shows ta and tr of PDC, WAM, EM-FMS, and MQHD. As it can be seen from Table 3, among the four methods, MQH and EM-FMS have better rapidity, because they distinguish the popularity of data and adjust the load more targeted.Table 3
ta and tr of PDC, WAM, EM-FMS, and MQHD.
MethodPDCWAMEM-FMSMQHDta (logic time)4221088520tr (ms)114.170.455.837.8Figure8 shows how the adjustment time of MQHD and EM-FMS varies with data coverage. As it can be seen from the figure, MQHD has better rapidity than EM-FMS. Under different data coverage, the adjustment time of MQHD method is small and has little change, while the adjustment time of EM-FMS is large and increases with the increase of data coverage. This is because MQHD can select an appropriate number of HDUs to migrate according to the overload degree of the disk, so the overload state of the disk can be quickly eliminated. However, EM-FMS only migrates one file at a time, and because of the error in energy estimation of a single file, the adjustment time of EM-FMS is longer, and the adjustment time will increase as the data coverage increases.Figure 8
Adjustment time comparison between MQHD and EM-FMS.


#### 4.3.3. Overhead Analysis

Figure9 shows the overhead comparison between MQHD and EM-FMS. As can be seen from the figure, the overhead of EM-FMS is much larger than that of MQHD. This is because EM-FMS needs to maintain access information for all data at all times while MQHD only needs to maintain access information for the data that has been frequently accessed recently.Figure 9
Overhead comparison between MQHD and EM-FMS.


## 4.1. Experimental Environment

Request generator and energy-aware storage system simulator are designed in the experiment.The request generator can generate storage system request records based on the number of requests, request rate, disk coverage, data coverage, disk popularity, and data popularity specified by the user. The request rate is the number of requests that arrive at the storage system in unit time, and it is assumed that the request arrival time is subject to an exponential distribution. Disk coverage represents the number of disks that are accessed as a percentage of the number of all disks. Data coverage represents the number of data units that are accessed as a percentage of the number of all data units. Disk popularity represents the degree of centralization of disks to be accessed; it is expressed by a coefficient in the range of (0–1) in Zipf's law. The closer the coefficient is to 1, the more the accesses are centralized on partial disks. For a specified disk, the Zipf distribution formula is used to calculate its assessed probability, as shown in equation (8). Data popularity is similar to disk popularity in meaning, indicating the degree of concentration of data is accessed.(8)Pi=1/iθ∑j=1n1/jθ.In the above equation,Pi is the probability of disk be accessed, n is the number of disks be accessed, i and j are the ranking of the disk’s accessed probability, and θ is the disk popularity.In the experiment, the parameters of request generator are set as follows: the number of requests is 1000; the request rate of the first 200 requests is 50/s; the request rate of the last 800 requests is 300/s; the disk coverage is 25%; the disk popularity is 0.5; the data coverage is 5%; the data popularity is 0.5. Table1 shows the parameters used by the request generator when generating records.Table 1
Request parameters.
ParameterNumber of requestsRequest rateDisk coverage (%)Disk popularityData coverage (%)Data popularityValue100050 or 300250.550.5In the energy-aware storage system simulated by the energy-aware storage system simulator, disks are divided into two groups: data disk group and cache disk group. The disks of the data disk group are not always rotating. Some disks of the data disk group that have been not accessed for a while will be transited into a standby state according to the power management method to save energy. The disks of the cache disk group keep rotating; they store the data that is frequently accessed. The controller tries to ensure that frequently accessed data is copied to the disks of the cache disk group [11].In the energy-aware storage system simulator, besides, MQHD, PDC, WAM, and EM-FMS are also implemented.In order to observe the overload situation and focus on the overload situation of the local storage units, a small size energy-aware storage system is configured. The parameters of the energy-aware storage system used in the experiment are configured as follows: the number of cache disks is 2, the number of data disks is 4, the capacity of a single cache disk is 500, and the capacity of a single data disk is 1000. In the energy-aware storage system simulator, the average service time of requests is set to 8 ms. The disk load is measured by the disk's request response time,OL is set to 48 ms, and SL is set to 24 ms.


## 4.2. Evaluation Methods and Indicators

We evaluate the load balancing methods from three aspects: effectiveness, rapidity, and overhead.


### 4.2.1. Effectiveness

The effectiveness of the load balancing method means that when disk overload occurs, the method can eliminate the overload state of the disk by timely load adjustment. For an effective load balancing method, its effectiveness is measured by the request change ratio (RCR). RCR is equal to the ratio of the number of requestsnafter that arrive at the disk when using the load balancing method to the number of requests nbefore that arrive at the disk when the load balancing method is not used:(9)RCR=nafternbefore.The larger the RCR value is, the more accurately the load balancing method can control the change of load size, without causing too much data to be migrated, and the more effective it is.


### 4.2.2. Rapidity

The rapidity of the load balancing method is measured by the adjusting timeta and the average response time of requests tr. ta is the time taken to adjust the disk out from an overload state, which is represented in logical time in this paper. tr is the average response time of all requests in the stage of adjusting the disk from overload to not overload.


### 4.2.3. Overhead

In order to select appropriate HDUs for migration during load adjustment, the load balancing method should maintain the information of a certain amount of HDUs. The load adjustment overhead is represented by the ratio of the number of HDUs maintained to the number of data units of the overloaded disk.


## 4.2.1. Effectiveness

The effectiveness of the load balancing method means that when disk overload occurs, the method can eliminate the overload state of the disk by timely load adjustment. For an effective load balancing method, its effectiveness is measured by the request change ratio (RCR). RCR is equal to the ratio of the number of requestsnafter that arrive at the disk when using the load balancing method to the number of requests nbefore that arrive at the disk when the load balancing method is not used:(9)RCR=nafternbefore.The larger the RCR value is, the more accurately the load balancing method can control the change of load size, without causing too much data to be migrated, and the more effective it is.


## 4.2.2. Rapidity

The rapidity of the load balancing method is measured by the adjusting timeta and the average response time of requests tr. ta is the time taken to adjust the disk out from an overload state, which is represented in logical time in this paper. tr is the average response time of all requests in the stage of adjusting the disk from overload to not overload.


## 4.2.3. Overhead

In order to select appropriate HDUs for migration during load adjustment, the load balancing method should maintain the information of a certain amount of HDUs. The load adjustment overhead is represented by the ratio of the number of HDUs maintained to the number of data units of the overloaded disk.


## 4.3. Experimental Results and Analysis

Figure6 shows a cache disk response without using the load balancing method. As it can be seen from Figure 6, when the request rate is increased from 50/s to 300/s, the disk begins to overload, and the response of the disk deteriorates with time, resulting in a large number of delayed requests.Figure 6
A cache disk response without using the load balancing method.Figures7(a)–7(d) show the disk response when using PDC, WAM, EM-FMS, and MQHD, respectively.Figure 7
Disk response after using PDC, WAM, EM-FMS, and MQHD, respectively. (a) PDC. (b) WAM. (c) EM-FMS. (d) MQHD.
(a)(b)(c)(d)


### 4.3.1. Effectiveness Analysis

PDC periodically performs hot data migration and estimates the future load of each disk as it migrates data, ensuring that the expected load of the disk is close to its maximum bandwidth. As shown in Figure7(a), when disk overload occurred at the beginning of the 212 requests, PDC did not perform load adjustment in time. PDC did not perform load adjustment until about 300 requests, when the timing migration time arrived, which had caused a large number of requests to be delayed. It can be seen that the PDC's adjustment is affected by the timing time. When disk overload occurs, PDC takes more time to respond to load adjustment.When disk overload occurs, for each request that arrived at the disk, WAM locates the data block of the request after servicing it and then exchanges the data block with an unaccessed data block of an unoverloaded disk. Such an exchange will continue until the disk's request arrival speed is less than or equal to the target threshold. Because there is no distinction between the popularity of data, WAM is blind in choosing blocks, which may cause too much data to be migrated and cause the RCR to be too small, so that the effectiveness of load adjustment is bad. As shown in Figure7(b), after load adjustment by WAM, disk requests are greatly reduced, and the RCR value is only 0.0114. Therefore, the WAM method is less effective.When disk overload occurs, EM-FMS selects the file with the highest energy density from the currently accessed files for migration. Because the popularity of data has been distinguished, EM-FMS is specific in selecting files, so its load adjustment is more effective. As shown in Figure7(c), after load adjustment, the disk request is not greatly reduced, and the RCR value is 0.2872.When the disk is overloaded, MQHD determines the appropriate LPR according to the overload degree of the overloaded disk and selects appropriate HDUs to perform data migration according to the LPR. By considering the overload degree and the heat degree of HDU, MQHD is more targeted than other methods. As shown in Figure7(d), after load adjustment, the disk utilization is still high, the RCR value is 0.3721.It can be seen that, among the four methods, PDC takes more time to respond to load adjustment and WAM is less effective, while EM-FMS and MQHD are more effective. Table2 shows RCR of PDC, WAM, EM-FMS, and MQHD.Table 2
RCR of PDC, WAM, EM-FMS, and MQHD.
MethodPDCWAMEM-FMSMQHDRCR0.30130.01410.28720.3721


### 4.3.2. Rapidity Analysis

Table3 shows ta and tr of PDC, WAM, EM-FMS, and MQHD. As it can be seen from Table 3, among the four methods, MQH and EM-FMS have better rapidity, because they distinguish the popularity of data and adjust the load more targeted.Table 3
ta and tr of PDC, WAM, EM-FMS, and MQHD.
MethodPDCWAMEM-FMSMQHDta (logic time)4221088520tr (ms)114.170.455.837.8Figure8 shows how the adjustment time of MQHD and EM-FMS varies with data coverage. As it can be seen from the figure, MQHD has better rapidity than EM-FMS. Under different data coverage, the adjustment time of MQHD method is small and has little change, while the adjustment time of EM-FMS is large and increases with the increase of data coverage. This is because MQHD can select an appropriate number of HDUs to migrate according to the overload degree of the disk, so the overload state of the disk can be quickly eliminated. However, EM-FMS only migrates one file at a time, and because of the error in energy estimation of a single file, the adjustment time of EM-FMS is longer, and the adjustment time will increase as the data coverage increases.Figure 8
Adjustment time comparison between MQHD and EM-FMS.


### 4.3.3. Overhead Analysis

Figure9 shows the overhead comparison between MQHD and EM-FMS. As can be seen from the figure, the overhead of EM-FMS is much larger than that of MQHD. This is because EM-FMS needs to maintain access information for all data at all times while MQHD only needs to maintain access information for the data that has been frequently accessed recently.Figure 9
Overhead comparison between MQHD and EM-FMS.


## 4.3.1. Effectiveness Analysis

PDC periodically performs hot data migration and estimates the future load of each disk as it migrates data, ensuring that the expected load of the disk is close to its maximum bandwidth. As shown in Figure7(a), when disk overload occurred at the beginning of the 212 requests, PDC did not perform load adjustment in time. PDC did not perform load adjustment until about 300 requests, when the timing migration time arrived, which had caused a large number of requests to be delayed. It can be seen that the PDC's adjustment is affected by the timing time. When disk overload occurs, PDC takes more time to respond to load adjustment.When disk overload occurs, for each request that arrived at the disk, WAM locates the data block of the request after servicing it and then exchanges the data block with an unaccessed data block of an unoverloaded disk. Such an exchange will continue until the disk's request arrival speed is less than or equal to the target threshold. Because there is no distinction between the popularity of data, WAM is blind in choosing blocks, which may cause too much data to be migrated and cause the RCR to be too small, so that the effectiveness of load adjustment is bad. As shown in Figure7(b), after load adjustment by WAM, disk requests are greatly reduced, and the RCR value is only 0.0114. Therefore, the WAM method is less effective.When disk overload occurs, EM-FMS selects the file with the highest energy density from the currently accessed files for migration. Because the popularity of data has been distinguished, EM-FMS is specific in selecting files, so its load adjustment is more effective. As shown in Figure7(c), after load adjustment, the disk request is not greatly reduced, and the RCR value is 0.2872.When the disk is overloaded, MQHD determines the appropriate LPR according to the overload degree of the overloaded disk and selects appropriate HDUs to perform data migration according to the LPR. By considering the overload degree and the heat degree of HDU, MQHD is more targeted than other methods. As shown in Figure7(d), after load adjustment, the disk utilization is still high, the RCR value is 0.3721.It can be seen that, among the four methods, PDC takes more time to respond to load adjustment and WAM is less effective, while EM-FMS and MQHD are more effective. Table2 shows RCR of PDC, WAM, EM-FMS, and MQHD.Table 2
RCR of PDC, WAM, EM-FMS, and MQHD.
MethodPDCWAMEM-FMSMQHDRCR0.30130.01410.28720.3721


## 4.3.2. Rapidity Analysis

Table3 shows ta and tr of PDC, WAM, EM-FMS, and MQHD. As it can be seen from Table 3, among the four methods, MQH and EM-FMS have better rapidity, because they distinguish the popularity of data and adjust the load more targeted.Table 3
ta and tr of PDC, WAM, EM-FMS, and MQHD.
MethodPDCWAMEM-FMSMQHDta (logic time)4221088520tr (ms)114.170.455.837.8Figure8 shows how the adjustment time of MQHD and EM-FMS varies with data coverage. As it can be seen from the figure, MQHD has better rapidity than EM-FMS. Under different data coverage, the adjustment time of MQHD method is small and has little change, while the adjustment time of EM-FMS is large and increases with the increase of data coverage. This is because MQHD can select an appropriate number of HDUs to migrate according to the overload degree of the disk, so the overload state of the disk can be quickly eliminated. However, EM-FMS only migrates one file at a time, and because of the error in energy estimation of a single file, the adjustment time of EM-FMS is longer, and the adjustment time will increase as the data coverage increases.Figure 8
Adjustment time comparison between MQHD and EM-FMS.


## 4.3.3. Overhead Analysis

Figure9 shows the overhead comparison between MQHD and EM-FMS. As can be seen from the figure, the overhead of EM-FMS is much larger than that of MQHD. This is because EM-FMS needs to maintain access information for all data at all times while MQHD only needs to maintain access information for the data that has been frequently accessed recently.Figure 9
Overhead comparison between MQHD and EM-FMS.


## 5. Conclusion

Energy-aware storage system brings the problem that some disks are easily overloaded while achieving energy saving. To solve this problem, a dynamic load balancing method named MQHD for energy-aware storage systems is proposed in this paper, which relies on multiple queues to determine what data and in what amount to migrate to other disks. The method is verified by means of custom request generator and energy-aware storage system simulator. The results show that the method can effectively solve the problem that some disks of the energy-aware storage system are easily overloaded. The application of the method can improve the performance of the energy-aware storage system, which is beneficial to promote the development of energy-aware technology of the storage system.



---

*Source: 6843572-2020-12-07.xml*