37 search results - page 5 / 8 » Rate monotonic scheduling re-analysed |
118
Voted
PRDC
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
62
Voted
RTCSA
2000
IEEE
15 years 2 months ago
2000
IEEE
Large-scale distributed real-time systems are increasingly difficult to analyze within the Rate Monotonic Analysis framework. This is due partly to their heterogeneity, complex i...
81
Voted
RTCSA
2007
IEEE
15 years 4 months ago
2007
IEEE
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
99
Voted
ISORC
2002
IEEE
15 years 3 months ago
2002
IEEE
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. Aperiodic task handling, guarantees, etc., are integrated wit...
93
Voted
RTCSA
2008
IEEE
15 years 4 months ago
2008
IEEE
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...