Files

Action Filename Description Size Access License Resource Version
Show more files...

Abstract

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.

Details

Actions

Preview