2714 search results - page 144 / 543 » Approximation Schemes for Scheduling |
94
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
102
click to vote
ECRTS
2006
IEEE
15 years 6 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
121
click to vote
ICCD
2006
IEEE
15 years 9 months ago
2006
IEEE
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...
85
Voted
TWC
2011
14 years 7 months ago
2011
—Achieving sufficient spatial capacity gain through the use of small cells requires careful consideration of intercell interference (ICI) management via BS power coordination co...
103
Voted
TWC
2010
14 years 7 months ago
2010
In this paper, we study the issue of scheduling transmission opportunities among nodes (peers) to achieve higher network throughput and lower transmission delay for network coding ...