AbstractThis paper is concerned with the page migration (or file migration) problem (Black and Sleator, Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University, 1989) as part of a large class of on-line problems. The page migration problem deals with the management of pages residing in a network of processors. In the classical problem there is only one copy of each page which is accessed by different processors over time. The page is allowed to be migrated between processors. However a migration incurs higher communication cost than an access (proportionally to the page size). The problem is that of deciding when and where to migrate the page in order to lower access costs. A more general setting is the k-...
Includes bibliographical references (pages 31-33)In this thesis, problems are considered that arise ...
In this paper, we construct a deterministic 4-competitive algorithm for the online file migration pr...
The data migration problem is the problem of computing an eÆcient plan for moving data stored on dev...
The page migration problem occurs in managing a globally addressed shared memory in a multiprocessor...
Abstract. The dynamic page migration problem [4] is defined in a dis-tributed network of n mobile no...
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 distributed network of n mobile node...
Abstract. Most previous work on page migration assumes that each pro-cessor, in the given distribute...
Page migration is one of the fundamental subproblems in the framework of data management in networks...
This paper presents user-level dynamic page migration, a runtime technique which transparently enabl...
金沢大学理工研究域電子情報学系The page migration problem in Euclidean space is revisited. In this problem, online r...
The page migration problem is one of subproblems of data management in networks. It occurs in a dist...
This paper presents algorithms for improving the performance of parallel programs on multiprogrammed...
The performance of multiprogrammed shared-memory multiprocessors suffers often from scheduler interv...
Includes bibliographical references (pages 31-33)In this thesis, problems are considered that arise ...
In this paper, we construct a deterministic 4-competitive algorithm for the online file migration pr...
The data migration problem is the problem of computing an eÆcient plan for moving data stored on dev...
The page migration problem occurs in managing a globally addressed shared memory in a multiprocessor...
Abstract. The dynamic page migration problem [4] is defined in a dis-tributed network of n mobile no...
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 distributed network of n mobile node...
Abstract. Most previous work on page migration assumes that each pro-cessor, in the given distribute...
Page migration is one of the fundamental subproblems in the framework of data management in networks...
This paper presents user-level dynamic page migration, a runtime technique which transparently enabl...
金沢大学理工研究域電子情報学系The page migration problem in Euclidean space is revisited. In this problem, online r...
The page migration problem is one of subproblems of data management in networks. It occurs in a dist...
This paper presents algorithms for improving the performance of parallel programs on multiprogrammed...
The performance of multiprogrammed shared-memory multiprocessors suffers often from scheduler interv...
Includes bibliographical references (pages 31-33)In this thesis, problems are considered that arise ...
In this paper, we construct a deterministic 4-competitive algorithm for the online file migration pr...
The data migration problem is the problem of computing an eÆcient plan for moving data stored on dev...