Sciweavers

130 search results - page 18 / 26
» Algorithms and Complexity for Periodic Real-Time Scheduling
Sort
View
CODES
2007
IEEE
15 years 3 months ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...
DAC
2005
ACM
15 years 10 months ago
Race-condition-aware clock skew scheduling
The race conditions often limit the smallest feasible clock period that the optimal clock skew scheduling can achieve. Therefore, the combination of clock skew scheduling and dela...
Shih-Hsu Huang, Yow-Tyng Nieh, Feng-Pin Lu
RTAS
2005
IEEE
15 years 3 months ago
Energy-Aware Task Allocation for Rate Monotonic Scheduling
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
Tarek A. AlEnawy, Hakan Aydin
RTCSA
1995
IEEE
15 years 1 months ago
A soft aperiodic task scheduling algorithm in dynamic-priority systems
In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed...
Sungyoung Lee, Hyungill Kim, Jongwon Lee
RTS
2006
115views more  RTS 2006»
14 years 9 months ago
Resource access control for dynamic priority distributed real-time systems
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...
Chen Zhang, David Cordes