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
This paper deals with the file allocation problem [BFR92] concerning the dynamic optimization of com...
This paper presents user-level dynamic page migration, a runtime technique which transparently enabl...
This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly ...
We present an extension of a classical data management subproblem, the page migration. The problem i...
AbstractWe present an extension of a classical data management subproblem, the page migration. The p...
Abstract. The dynamic page migration problem [4] is defined in a dis-tributed network of n mobile no...
Abstract The dynamic page migration problem [4] is defined in a distributed network of n mobile node...
Page migration is one of the fundamental subproblems in the framework of data management in networks...
The page migration problem is one of subproblems of data management in networks. It occurs in a dist...
The page migration problem occurs in managing a globally addressed shared memory in a multiprocessor...
Abstract. We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of da...
AbstractThis paper is concerned with the page migration (or file migration) problem (Black and Sleat...
Abstract. Most previous work on page migration assumes that each pro-cessor, in the given distribute...
This paper addresses the page migration problem: given online requests from nodes on a network for a...
The data migration problem is the problem of computing an eÆcient plan for moving data stored on dev...
This paper deals with the file allocation problem [BFR92] concerning the dynamic optimization of com...
This paper presents user-level dynamic page migration, a runtime technique which transparently enabl...
This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly ...
We present an extension of a classical data management subproblem, the page migration. The problem i...
AbstractWe present an extension of a classical data management subproblem, the page migration. The p...
Abstract. The dynamic page migration problem [4] is defined in a dis-tributed network of n mobile no...
Abstract The dynamic page migration problem [4] is defined in a distributed network of n mobile node...
Page migration is one of the fundamental subproblems in the framework of data management in networks...
The page migration problem is one of subproblems of data management in networks. It occurs in a dist...
The page migration problem occurs in managing a globally addressed shared memory in a multiprocessor...
Abstract. We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of da...
AbstractThis paper is concerned with the page migration (or file migration) problem (Black and Sleat...
Abstract. Most previous work on page migration assumes that each pro-cessor, in the given distribute...
This paper addresses the page migration problem: given online requests from nodes on a network for a...
The data migration problem is the problem of computing an eÆcient plan for moving data stored on dev...
This paper deals with the file allocation problem [BFR92] concerning the dynamic optimization of com...
This paper presents user-level dynamic page migration, a runtime technique which transparently enabl...
This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly ...
DOI
Add to ORKG