554 search results - page 51 / 111 » Approximability of OFDMA Scheduling |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
ECRTS
2008
IEEE
15 years 4 months ago
2008
IEEE
Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fi...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— The inherent spread spectrum nature in ultrawideband (UWB) communications can support simultaneous transmissions. Two nearby transmissions do not collide, but rather ge...
ISCA
2002
IEEE
15 years 2 months ago
2002
IEEE
An increasingly large portion of scheduler latency is derived from the monolithic content addressable memory (CAM) arrays accessed during instruction wakeup. The performance of th...
RTAS
1999
IEEE
15 years 2 months ago
1999
IEEE
Real-time media servers need to service hundreds and, possibly, thousands of clients, each with their own quality of service (QoS) requirements. To guarantee such diverse QoS requ...