554 search results - page 12 / 111 » Approximability of OFDMA Scheduling |
RTSS
2002
IEEE
15 years 2 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
105
click to vote
TON
2010
14 years 4 months ago
2010
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
ECRTS
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper targets energy-efficient scheduling of tasks over multiple processors, where tasks share a common deadline. Distinct from many research results on heuristics-based ener...
101
click to vote
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— Cooperative relay networks combined with Orthogonal Frequency Division Multiplexing Access (OFDMA) technology has been widely recognized as a promising candidate for fu...
ISORC
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a simple protocol that provides application processes with an approximate real-time notion. This time notion is very versatile. At one extreme, it behaves at l...