Sciweavers

INFOCOM
2010
IEEE
13 years 2 months ago
Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
Zhe Yang, Lin Cai, Wu-sheng Lu
WICON
2008
13 years 5 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek
EUROPAR
2008
Springer
13 years 6 months ago
Dynamic Grid Scheduling Using Job Runtime Requirements and Variable Resource Availability
We describe a scheduling technique in which estimated job runtimes and estimated resource availability are used to efficiently distribute workloads across a homogeneous grid of res...
Sam Verboven, Peter Hellinckx, Jan Broeckhove, Fra...