297 search results - page 48 / 60 » A non-preemptive scheduling algorithm for soft real-time sys... |
RTS
2006
14 years 9 months ago
2006
Many of today's complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this dem...
ISLPED
2007
ACM
14 years 11 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...
78
Voted
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
High-performance microprocessors, e.g., multithreaded and multicore processors, are being implemented in embedded real-time systems because of the increasing computational require...
76
Voted
ADAEUROPE
2004
Springer
15 years 3 months ago
2004
Springer
Abstract: A framework for application-defined scheduling and its corresponding application program interface (API) were defined during the last International Real-Time Ada Workshop...
RTCSA
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...