Research Article
Data Placement Algorithm for Improving I/O Load Balance without Using Popularity Information
Data: Leaving storage node | Result: Data migration; renewal of the counter array | Initialize with 1 | whileis between 1 anddo | | Divide the files belonging to the th age group on the | th node into subsets, with the total size of | the files in each subset approximately equal to ; | | whileis between 1 anddo | migrate the th subset from the th node to the | th node; | | | end | | end | ā |
|