17 search results - page 3 / 4 » New Response Time Bounds for Fixed Priority Multiprocessor S... |
ECRTS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
ADAEUROPE
2005
Springer
14 years 16 days ago
2005
Springer
: In previous papers we had presented an application program interface (API) that enabled applications to use application-defined scheduling algorithms for Ada tasks in a way compa...
RTSS
1998
IEEE
13 years 11 months ago
1998
IEEE
Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed...
RTSS
2007
IEEE
14 years 1 months ago
2007
IEEE
Schedulability analysis is a cornerstone of modern real-time scheduling theory development. Utilizationbound based schedulability test is considered one of most efficient and effe...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...