Research Article
Data Placement Algorithm for Improving I/O Load Balance without Using Popularity Information
Algorithm 1
Initialization subalgorithm.
Data: Data file set ; storage node set . | Result: Mapping of the data file set to the storage node set ; counter arrays . | Initialize each element with 0, each element with , and each element with | while there is an unhandled file in do | Query the file’s creation time | Calculate the file’s age | | while is between 1 anddo | ifthen | break; | end | | end | | End | while is between 1 anddo | while there is an unhandled fileindo | | | | while is between 2 anddo | ifthen | | | end | | end | Place the file on the storage node | | end | End |
|