Sciweavers

90 search results - page 1 / 18
» Improved Algorithms for Dynamic Page Migration
Sort
View
STACS
2005
Springer
13 years 10 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
ESA
2005
Springer
140views Algorithms» more  ESA 2005»
13 years 10 months ago
Bucket Game with Applications to Set Multicover and Dynamic Page Migration
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
Marcin Bienkowski, Jaroslaw Byrka
ISHPC
2000
Springer
13 years 8 months ago
Leveraging Transparent Data Distribution in OpenMP via User-Level Dynamic Page Migration
This paper describes transparent mechanisms for emulating some of the data distribution facilities offered by traditional data-parallel programming models, such as High Performance...
Dimitrios S. Nikolopoulos, Theodore S. Papatheodor...
EUROPAR
2005
Springer
13 years 10 months ago
Dynamic Page Migration Under Brownian Motion
We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where ac...
Marcin Bienkowski, Miroslaw Korzeniowski
SPAA
2004
ACM
13 years 10 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...