1185 search results - page 138 / 237 » An Improved Parallel Thinning Algorithm |
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterizati...
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
112
click to vote
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
EUROPAR
2008
Springer
14 years 11 months ago
2008
Springer
The use of virtualization is rapidly expanding from server consolidation to various computing systems including PC, multimedia set-top box and gaming console. However, different fr...