Heuristic Data Placement for Data-Intensive Applications in Heterogeneous Cloud

Pseudocode 1

The pseudocode of the heuristic data allocation method: DataAllocation.

Function Name: DataAllocation

Input: dtNode: The root of the data item binary-tree

 ctNode: The root of the data center binary-tree

Output: whether the data tree can be allocated to the server tree

() /First, find the smallest server sub-tree that its total storage capacity is more than the total data size of the sub-tree

   dtNode, suppose its root node is /

()  = nextSmallestServerTree (totalStorageRequirement (dtNode));

() while ( != Null)

()  if (DataPlacement (dtNode, ) == True) return True; //DetaPlacement is a recursive function

()  else = nextSmallestServerTree (totalStorageRequirement (dtNode));

() 

() Return False;