Results 161 to 170 of about 2,490 (199)

Robust and sustainable schedulability analysis of embedded software

ACM SIGPLAN Notices, 2008
For real-time systems, most of the analysis involves efficient or exact schedulability checking. While this is important, analysis is often based on the assumption that the task parameters such as execution requirements and inter-arrival times between ...
Insup Lee, Leeinsup
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

EDZL scheduling analysis

Real-Time Systems, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
T. P. BAKER, M. CIRINEI, BERTOGNA, Marko
openaire   +2 more sources

EDZL Scheduling Analysis

19th Euromicro Conference on Real-Time Systems (ECRTS'07), 2007
A schedulability test is derived for the global earliest deadline zero laxity (EDZL) scheduling algorithm on a platform with multiple identical processors. The test is sufficient, but not necessary, to guarantee that a system of independent sporadic tasks with arbitrary deadlines will be successfully scheduled, with no missed deadlines, by the ...
Michele Cirinei, Theodore P. Baker
openaire   +1 more source

Traffic scheduling coprocessor with schedulability analysis capability

Proceedings Euromicro Symposium on Digital Systems Design, 2002
The low processing power of typical fieldbus nodes used in real-time applications usually limits the sort of message scheduling that can be done, and precludes any kind of on-line schedulability analysis. Moving these computationally intensive tasks to dedicated hardware is an effective way to remove this limitation and achieve the best temporal ...
Ernesto Martins, José Alberto Fonseca
openaire   +1 more source

Schedulability criterion and performance analysis of coordinated schedulers

IEEE/ACM Transactions on Networking, 2001
Inter-server coordinated scheduling is a mechanism for downstream nodes to increase or decrease a packet's priority according to the congestion incurred at upstream nodes. In this paper, we derive an end-to-end schedulability condition for a broad class of coordinated schedulers that includes Core-stateless Jitter Virtual Clock (CJVC) and Coordinated ...
Chengzhi Li, Edward W. Knightly
openaire   +1 more source

From instantaneous schedulability to worst case schedulability: a significant moment approach

Cyber-Physical Systems
The method of significant moment analysis has been used to derive instantaneous schedulability tests for real-time tasks. However, the instantaneous schedulability can only be checked within a finite time window.
Ningshi Yao, Fumin Zhang
exaly   +2 more sources

A Schedulability Analysis of Deferrable Scheduling Using Patterns

2008 Euromicro Conference on Real-Time Systems, 2008
The schedulability testing for the deferrable scheduling algorithm for fixed priority transactions (DS-FP) remainsan open problem since its introduction. In this paper, wetake the first step towards investigating necessary and sufficient conditions for the DS-FP schedulability.
Song Han 0002, Deji Chen 0001, Ming Xiong, Aloysius K. Mok   +3 more
openaire   +1 more source

Interval Analysis in Scheduling

2005
This paper reconsiders the most basic scheduling problem, that of minimizing the makespan of a partially ordered set of activities, in the context of incomplete knowledge. While this problem is very easy in the deterministic case, its counterpart when durations are interval-valued is much trickier, as standard results and algorithms no longer apply ...
Jérôme Fortin, Pawel Zielinski 0001, Didier Dubois, Hélène Fargier   +3 more
openaire   +1 more source

Schedulability analysis of global memory-predictable scheduling

Proceedings of the 14th International Conference on Embedded Software, 2014
The use of multicore CPUs in real-time systems poses significant challenges in estimating their temporal behavior. A factor that has a large impact on this issue is the contention for access to main memory among multiple cores. To overcome this problem, an execution model called PREM has been previously introduced to co-schedule CPU execution and ...
Ahmed Alhammad, Rodolfo Pellizzoni
openaire   +1 more source

Sensitivity analysis of scheduling algorithms

European Journal of Operational Research, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Penz, Bernard, Rapine, Christophe, Trystram, Denis   +2 more
openaire   +3 more sources