35 search results - page 2 / 7 » Scheduling flows with unknown sizes: approximate analysis |
QUESTA
2010
13 years 5 months ago
2010
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
DAM
2006
13 years 7 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
RTSS
2002
IEEE
14 years 7 days ago
2002
IEEE
In addition to real-time requirements, the program code size is a critical design factor for real-time embedded systems. To take advantage of the code size vs. execution time trad...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...