Research Article
Data Placement Algorithm for Improving I/O Load Balance without Using Popularity Information
Algorithm 6
Self-refreshing subalgorithm.
Data: Counter arrays and each file’s age | Result: Renewal of the counter arrays | Increase the age of each file by one day | Set each element with 0 | | | whileis between 1 anddo | whiledo | ifthe age of the th file is larger thanthen | break | end | ++ | end | | ifthen | | end | | whileis betweentodo | Query the number of the node that holds the th file | | | end | End |
|