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