Sciweavers

1016 search results - page 136 / 204
» Parallelism Constraints
Sort
View
IPPS
2000
IEEE
14 years 1 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
SPAA
2000
ACM
14 years 1 months ago
Fault tolerant networks with small degree
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
Li Zhang
PDP
2010
IEEE
14 years 1 months ago
Distributed Scheduler of Workflows with Deadlines in a P2P Desktop Grid
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhe...
Javier Celaya, Unai Arronategui
ICPP
1999
IEEE
14 years 1 months ago
A Framework for Interprocedural Locality Optimization Using Both Loop and Data Layout Transformations
There has been much work recently on improving the locality performance of loop nests in scientific programs through the use of loop as well as data layout optimizations. However,...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
ICECCS
1998
IEEE
161views Hardware» more  ICECCS 1998»
14 years 1 months ago
A Method and a Technique to Model and Ensure Timeliness in Safety Critical Real-Time Systems
The main focus of this paper is the problem of ensuring timeliness in safety critical systems. First, we introduce a method and its associated technique to model both real-time ta...
Christophe Aussaguès, Vincent David