A Load-Aware Multistripe Concurrent Update Scheme in Erasure-Coded Storage System

Algorithm 1

Computing node selection module.

1. Inputs:

 : candidate computing nodes set

 : concurrent update stripes set

 : CPU utilization

 : remaining memory

 : I/O load

 : access bandwidth

 Output: best computing nodes for concurrent update stripes

2. Fors in stripe set do

3. For in node set do

4.  Obtain the load parameters , , ,

5.  Normalize load parameter to , , , according to (18) and (19)

6.  Calculate the capacity of node according to (20)

7. Set the node has largest capacity as computing node for stripe

8. Delete from to ensure that the computing nodes selected by multiple stripes are not duplicated

9. End for

10. End for