31 search results - page 5 / 7 » On the Complexity of Scheduling Conditional Real-Time Code |
151
Voted
TCOM
2010
15 years 3 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
155
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
174
click to vote
CODES
2003
IEEE
15 years 10 months ago
2003
IEEE
The growing complexity of embedded applications and pressure on time-to-market has resulted in the increasing use of embedded real-time operating systems. Unfortunately, RTOSes ca...
140
Voted
ECRTS
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
142
Voted
NCA
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop...