17 search results - page 1 / 4 » A Fast 5 2-Approximation Algorithm for Hierarchical Scheduli... |
EUROPAR
2010
Springer
13 years 4 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
DAC
1998
ACM
13 years 8 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
SIGCOMM
1996
ACM
13 years 8 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
ICDE
2002
IEEE
14 years 5 months ago
2002
IEEE
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...