Sciweavers

287 search results - page 32 / 58
» Test of preemptive real-time systems
Sort
View
RTCSA
2006
IEEE
15 years 6 months ago
Algorithms for Determining the Demand-Based Load of a Sporadic Task System
The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time...
Nathan Fisher, Theodore P. Baker, Sanjoy K. Baruah
104
Voted
RTS
2011
123views more  RTS 2011»
14 years 7 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
IPPS
2006
IEEE
15 years 6 months ago
Fault tolerance with real-time Java
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...
Damien Masson, Serge Midonnet
92
Voted
WSC
2000
15 years 1 months ago
Simulation as educational support for production and logistics in industrial engineering
The proposed implementation is a monitor system able to train operators for on-line real time manufacturing control in order to analyze the performance of a production process. Th...
Agostino G. Bruzzone, Pietro Giribone, Roberto Rev...
94
Voted
FORTE
1997
15 years 1 months ago
On-Line Timed Protocol Trace Analysis Based on Uncertain State Descriptions
This paper presents a new approach to the task of passive protocol tracing. The method called FollowSM for the first time meets all requirements of practical in-field use, inclu...
Marek Musial