Loading...
research article
Optimal Algorithms for Page Migration in Dynamic Networks
We present an extension of a classical data management subproblem, the page migration. The problem is investigated in dynamic networks, where costs of communication between different nodes may change with time. We construct asymptotically optimal online algorithms for this problem, both in deterministic and randomized scenarios.
Loading...
Name
page-migration.pdf
Access type
openaccess
Size
353.41 KB
Format
Adobe PDF
Checksum (MD5)
91b5324e13e6003a77a4e35107c6f25e