David L Black; Daniel D Sleator
|描述：||23 pages ; 28 cm.|
|叢書名：||Carnegie-Mellon University.; Computer Science Department.; Research paper|
|責任：||David L. Black and Daniel D. Sleator.|
For interconnection topologies that are complete graphs, or trees we have obtained efficient on-line algorithms for these problems. Our migration algorithms also extend to interconnections that are products of these topologies (e.g. a hypercube is a product of simple trees). An on-line algorithm decides how to process each request (which is a read or write request from a processor to a page) without knowing future requests. Our algorithms are also said to be competitive because their performance is within a small constant factor of that of any other algorithm, including algorithms that make use of knowledge of future requests."