147 search results - page 18 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
168
click to vote
ECRTS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
180
click to vote
RTS
2008
15 years 5 months ago
2008
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
172
click to vote
ICC
2008
IEEE
16 years 15 days ago
2008
IEEE
Abstract—The downlink transmission in multi-user multipleinput multiple-output (MIMO) systems has been extensively studied from both communication-theoretic and information-theor...
165
click to vote
ECRTS
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
170
click to vote
INFOCOM
2008
IEEE
16 years 14 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...