147 search results - page 7 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
116
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
101
click to vote
RTSS
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
187
click to vote
TON
2010
14 years 6 months ago
2010
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
134
click to vote
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...