Sciweavers

209 search results - page 33 / 42
» Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor...
Sort
View
RTAS
2009
IEEE
14 years 5 months ago
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
This paper presents a new algorithm for fixed-priority scheduling of sporadic task systems on multiprocessors. The algorithm is categorized to such a scheduling class that quali...
Shinpei Kato, Nobuyuki Yamasaki
RTS
2010
127views more  RTS 2010»
13 years 5 months ago
Scheduling of hard real-time garbage collection
Automatic memory management or garbage collection greatly simplifies development of large systems. However, garbage collection is usually not used in real-time systems due to the u...
Martin Schoeberl
RTCSA
2008
IEEE
14 years 5 months ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel
ISCA
2009
IEEE
137views Hardware» more  ISCA 2009»
14 years 5 months ago
A case for an interleaving constrained shared-memory multi-processor
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
Jie Yu, Satish Narayanasamy
EMSOFT
2010
Springer
13 years 9 months ago
Resource adaptations with servers for hard real-time systems
Many real-time applications are designed to work in different operating modes each characterized by different functionality and resource demands. With each mode change, resource d...
Nikolay Stoimenov, Lothar Thiele, Luca Santinelli,...