75 search results - page 2 / 15 » Quality and Utility - Towards a Generalization of Deadline a... |
AAIM
2007
Springer
13 years 10 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 ...
ISLPED
2007
ACM
13 years 6 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
DELTA
2004
IEEE
13 years 8 months ago
2004
IEEE
In this report we address the problem of static scheduling of realtime systems that include both hard and soft tasks. We consider systems in which both hard and soft tasks are per...
RTAS
2005
IEEE
13 years 10 months ago
2005
IEEE
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
DATE
2010
IEEE
13 years 9 months ago
2010
IEEE
—The admission control problem is concerned with determining whether a new task may be accepted by a system consisting of a set of running tasks, such that the already admitted a...