However, applications running in such environments are often dynamic and highly unpredictable. Furthermore, synchronous communication is usually too expensive to be used in disseminating load information. We therefore investigate policies that use local information to approximate desired global behaviors. Our results with common Java applications show that simple, local approaches are surprisingly effective in capturing load information and object relationships, and in making migration and clustering decisions based on profiled information.

@inProceedings{silaghi-icdcs01,
	title = "Object Distribution With Local Information",
	author = "Bujor D. Silaghi and Pete Keleher",
	booktitle = {The 22nd International Conference on Distributed Computing Systems (ICDCS)},
	year = {2001},
}