19 search results - page 2 / 4 » On-demand Bounded Broadcast Scheduling with Tight Deadlines |
ICTCS
2005
Springer
13 years 11 months ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
INFOCOM
2008
IEEE
13 years 12 months ago
2008
IEEE
Abstract—Motivated by the increasing usage of wireless broadcast networks for multicast real-time applications like video, this paper considers a canonical real-time multicast sc...
INFORMATICALT
2010
13 years 3 months ago
2010
Abstract. As a means of supporting quality of service guarantees, aggregate multiplexing has attracted a lot of attention in the networking community, since it requires less comple...
ECRTS
2010
IEEE
13 years 5 months ago
2010
IEEE
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...
SAC
2004
ACM
13 years 11 months ago
2004
ACM
The amount of data handled by real-time and embedded applications is increasing. Also, applications normally have constraints with respect to freshness and timeliness of the data ...