The clustering of objects in a layered object storage system is by common consent an exceedingly difficult problem. Studies the performance of three heuristic placement algorithms. A series of eight reasonably realistic case studies were used as a benchmark battery, and several hundred experiments were carried out to evaluate results of using the algorithms. Presents the results and the insights gained from the study.