6105 search results - page 782 / 1221 » A Parallel Algorithm for Bound-Smoothing |
181
click to vote
PARELEC
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...
172
click to vote
ICA3PP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...
195
click to vote
HCW
2000
IEEE
15 years 11 months ago
2000
IEEE
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
202
click to vote
ICPPW
2000
IEEE
15 years 11 months ago
2000
IEEE
Proxy caches have become a central mechanism for reducing the latency of web document retrieval. While caching alone reduces latency for previously requested documents, web docume...
168
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
The primary goal of the Multimedia Router (MMR) project is the design and implementation of a router optimized for multimedia applications. The router is targeted for use in clust...