Sciweavers

1536 search results - page 97 / 308
» DPS - Dynamic Parallel Schedules
Sort
View
ASPDAC
1995
ACM
77views Hardware» more  ASPDAC 1995»
15 years 3 months ago
A scheduling algorithm for synthesis of bus-partitioned architectures
- Due to efficient interconnect structure and internal parallelism bus-partitioned architectures are very beneficial for sub-micron chip design. This paper presents a new approach ...
Vasily G. Moshnyaga, Fumiaki Ohbayashi, Keikichi T...
ICPP
1999
IEEE
15 years 3 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
SIAMDM
2002
124views more  SIAMDM 2002»
14 years 11 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
HPDC
2006
IEEE
15 years 5 months ago
On the Harmfulness of Redundant Batch Requests
Most parallel computing resources are controlled by batch schedulers that place requests for computation in a queue until access to compute nodes is granted. Queue waiting times a...
Henri Casanova
ICDCS
1997
IEEE
15 years 3 months ago
Predictable Network Computing
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...
Andreas Polze, Gerhard Fohler, Matthias Werner