AbstractWe 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 data management in computer systems in which the computing nodes are connected...
金沢大学理工研究域電子情報学系The page migration problem in Euclidean space is revisited. In this problem, online r...
The data migration problem is the problem of computing an eÆcient plan for moving data stored on dev...
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...
Page migration is one of the fundamental subproblems in the framework of data management in networks...
Abstract The dynamic page migration problem [4] is defined in a distributed network of n mobile node...
The page migration problem is one of subproblems of data management in networks. It occurs in a dist...
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...
The page migration problem occurs in managing a globally addressed shared memory in a multiprocessor...
Abstract. Most previous work on page migration assumes that each pro-cessor, in the given distribute...
This paper deals with data management in computer systems in which the computing nodes are connected...
In this paper, we construct a deterministic 4-competitive algorithm for the online file migration pr...
This paper deals with data management in computer systems in which the computing nodes are connected...
金沢大学理工研究域電子情報学系The page migration problem in Euclidean space is revisited. In this problem, online r...
The data migration problem is the problem of computing an eÆcient plan for moving data stored on dev...
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...
Page migration is one of the fundamental subproblems in the framework of data management in networks...
Abstract The dynamic page migration problem [4] is defined in a distributed network of n mobile node...
The page migration problem is one of subproblems of data management in networks. It occurs in a dist...
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...
The page migration problem occurs in managing a globally addressed shared memory in a multiprocessor...
Abstract. Most previous work on page migration assumes that each pro-cessor, in the given distribute...
This paper deals with data management in computer systems in which the computing nodes are connected...
In this paper, we construct a deterministic 4-competitive algorithm for the online file migration pr...
This paper deals with data management in computer systems in which the computing nodes are connected...
金沢大学理工研究域電子情報学系The page migration problem in Euclidean space is revisited. In this problem, online r...
The data migration problem is the problem of computing an eÆcient plan for moving data stored on dev...
DOI
Add to ORKG