209 search results - page 29 / 42 » Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor... |
RTCSA
2008
IEEE
14 years 5 months ago
2008
IEEE
—The convergence of application domains in new systems-on-chip (SoC) results in systems with many applications with a mix of soft and hard real-time requirements. To reduce cost,...
RTAS
2010
IEEE
13 years 9 months ago
2010
IEEE
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
RTSS
2005
IEEE
14 years 4 months ago
2005
IEEE
Modern operating systems frequently support applications with a variety of timing constraints including hard real-time, soft real-time, and best-effort. To guarantee performance, ...
EMSOFT
2008
Springer
14 years 20 days ago
2008
Springer
This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. Th...
IPPS
2003
IEEE
14 years 4 months ago
2003
IEEE
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...