Method of determining data placement for distributed storage system

A method of determining data placement for a distributed storage system comprising the steps of:

• selecting a heuristic class which meets a performance requirement and which provides a replication cost that is within an allowable limit of a minimum replication cost;
• instantiating a data placement heuristic selected from a range of data placement heuristics according to the heuristic class;
• and
• evaluating a placement of data objects onto nodes of the distributed storage system made according to the data placement heuristic.

A method of determining data placement for a distributed storage system comprising the steps of:

• selecting a heuristic class which meets a performance requirement and which provides a replication cost that is within an allowable limit of a minimum replication cost;
• instantiating a data placement heuristic selected from a range of data placement heuristics according to the heuristic class;
• evaluating a placement of data objects onto nodes of the distributed storage system made according to the data placement heuristic;
• and
• iteratively performing the steps of selecting the heuristic class, instantiating the data placement heuristic, and evaluating the placement of the data objects.

A computer readable memory comprising computer code for implementing a method of determining data placement for a distributed storage system, the method of determining the data placement comprising the steps of:

• selecting a heuristic class which meets a performance requirement and which provides a replication cost that is within an allowable limit of a minimum replication cost;
• instantiating a data placement heuristic selected from a range of data placement heuristics according to the heuristic class;
• and
• evaluating a placement of data objects onto nodes of the distributed storage system made according to the data placement heuristic.

A computer readable memory comprising computer code for implementing a method of determining data placement for a distributed storage system, the method of determining the data placement comprising the steps of:

• selecting a heuristic class which meets a performance requirement and which provides a replication cost that is within an allowable limit of a minimum replication cost;
• instantiating a data placement heuristic selected from a range of data placement heuristics according to the heuristic class;
• evaluating a placement of data objects onto nodes of the distributed storage system made according to the data placement heuristic;
• and
• iteratively performing the steps of selecting the heuristic class, instantiating the data placement heuristic, and evaluating the placement of the data objects.