35 search results - page 1 / 7 » Scheduling flows with unknown sizes: approximate analysis |
SIGMETRICS
2002
ACM
13 years 4 months ago
2002
ACM
CJ
2008
13 years 4 months ago
2008
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
ICC
2009
IEEE
13 years 11 months ago
2009
IEEE
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...
ECRTS
2004
IEEE
13 years 8 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...