Sciweavers

372 search results - page 3 / 75
» Dynamic Constraints and Object Migration
Sort
View
IPPS
2000
IEEE
13 years 11 months ago
Replicating the Contents of a WWW Multimedia Repository to Minimize Download Time
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...
Thanasis Loukopoulos, Ishfaq Ahmad
JAVA
2001
Springer
13 years 11 months ago
Supporting dynamic parallel object arrays
We present efficient support for generalized arrays of parallel data driven objects. Array elements are regular C++ objects, and are scattered across the parallel machine. An indi...
Orion Sky Lawlor, Laxmikant V. Kalé
IPPS
2009
IEEE
14 years 2 months ago
Enabling high-performance memory migration for multithreaded applications on LINUX
As the number of cores per machine increases, memory architectures are being redesigned to avoid bus contention and sustain higher throughput needs. The emergence of Non-Uniform M...
Brice Goglin, Nathalie Furmento
CATA
2003
13 years 8 months ago
A Task Migration Scheme for High Performance Real-Time Cluster System
In a real-time system, it is attractive to use cluster computing system for realizing high performance and high availability. The objectives of the real-time clusters are maximize...
Makoto Suzuki, Hidenori Kobayashi, Nobuyuki Yamasa...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
13 years 11 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre