DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click HERE
to register or log in.
Optimal Resource Placement in a Distributed System. (Extended Abstract).
WASHINGTON UNIV SEATTLE DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
Consider the problem of locating t resources on the nodes of a complete binary tree of n leaves so as to minimize the expected total distance from each of t simultaneous random requests at the leaves to the resource with which each is optimally matched. The optimal placement of resources yields an expected total distance of at most ct 2 lognt. Such a placement can be found in time 0log n. Author
APPROVED FOR PUBLIC RELEASE