149 search results - page 7 / 30 » Optimal Scheduling of Contract Algorithms with Soft Deadline... |
107
click to vote
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
IJCAI
2003
14 years 11 months ago
2003
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
93
Voted
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization an...
RTAS
2010
IEEE
14 years 8 months ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
ECRTS
2003
IEEE
15 years 3 months ago
2003
IEEE
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an ...