Sciweavers

113 search results - page 16 / 23
» Performance of algorithms for scheduling real-time systems w...
Sort
View
RTCSA
1995
IEEE
13 years 11 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
CODES
2007
IEEE
14 years 2 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...
CEE
2007
107views more  CEE 2007»
13 years 7 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
GLVLSI
2006
IEEE
126views VLSI» more  GLVLSI 2006»
14 years 1 months ago
Hardware/software partitioning of operating systems: a behavioral synthesis approach
In this paper we propose a hardware real time operating system (HW-RTOS) solution that makes use of a dedicated hardware in order to replace the standard support provided by the P...
Sathish Chandra, Francesco Regazzoni, Marcello Laj...
ISLPED
2007
ACM
123views Hardware» more  ISLPED 2007»
13 years 9 months ago
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
Sushu Zhang, Karam S. Chatha, Goran Konjevod