Sciweavers

824 search results - page 1 / 165
» Fast performance prediction for periodic task systems
Sort
View
CODES
2000
IEEE
13 years 9 months ago
Fast performance prediction for periodic task systems
During design exploration, many implementations of the same system specification may need to be evaluated. In this paper, we present an approach to construct sufficient and nece...
Xiaobo Sharon Hu, Gang Quan
RTAS
2010
IEEE
13 years 3 months ago
DARTS: Techniques and Tools for Predictably Fast Memory Using Integrated Data Allocation and Real-Time Task Scheduling
—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...
Sangyeol Kang, Alexander G. Dean
COCOA
2008
Springer
13 years 6 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
TC
2008
13 years 4 months ago
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in ...
Patricia Balbastre, Ismael Ripoll, Alfons Crespo
RTCSA
1995
IEEE
13 years 8 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