Sciweavers

97 search results - page 3 / 20
» On the complexity of schedule control problems for knockout ...
Sort
View
MOBIHOC
2006
ACM
14 years 7 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
RTSS
2003
IEEE
14 years 1 months ago
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
Dakai Zhu, Daniel Mossé, Rami G. Melhem
ISCA
2012
IEEE
279views Hardware» more  ISCA 2012»
11 years 10 months ago
Staged memory scheduling: Achieving high performance and scalability in heterogeneous systems
When multiple processor (CPU) cores and a GPU integrated together on the same chip share the off-chip main memory, requests from the GPU can heavily interfere with requests from t...
Rachata Ausavarungnirun, Kevin Kai-Wei Chang, Lava...
WIOPT
2010
IEEE
13 years 5 months ago
Energy efficient scheduling with power control for wireless networks
Scheduling of transmissions is one of the most fundamental problems in the context of wireless networks. In this article, we consider the problem of computing power efficient sched...
Bastian Katz, Markus Völker, Dorothea Wagner
TWC
2010
13 years 2 months ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang