Results 151 to 160 of about 2,490 (199)

A novel dynamic scheduling model for application in multimode approach. [PDF]

Sci Rep
Elqabli Z, Kamach O, Khatab A, Chater Y.
europepmc   +1 more source

Cross-Layer Analysis of Machine Learning Models for Secure and Energy-Efficient IoT Networks. [PDF]

Sensors (Basel)
Mustafa R, Sarkar NI, Mohaghegh M, Pervez S, Vohra O.   +4 more
europepmc   +1 more source

Optimized transmission of multi-path low-latency routing for electricity internet of things based on SDN task distribution. [PDF]

PLoS One
Jin Q.
europepmc   +1 more source

Schedulability analysis for Java finalizers

Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems, 2010
Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact on the schedulability analysis.
Thomas Bøgholm, René Rydhof Hansen, Anders P. Ravn, Bent Thomsen, Hans Søndergaard   +4 more
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Schedulability analysis of global edf

Real-Time Systems, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sanjoy Baruah, Baruah Sanjoy
exaly   +2 more sources

Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised [PDF]

Real-Time Systems, 2007
Controller Area Network (CAN) is used extensively in automotive applications, with in excess of 400 million CAN enabled microcontrollers manufactured each year.
Robert I Davis, Alan Burns, Reinder J Bril   +2 more
exaly   +2 more sources

Analysis of a Feedback Scheduler

SIAM Journal on Computing, 1974
A flexible feedback queueing model for a computer system is described. The model consists of a single server and a queue into which jobs are inserted at positions which are functions of their attained service. Special cases of the model include both the round robin and the first-come-first-served disciplines, but a wide variety of other algorithms ...
Yap Siong Chua, Arthur J. Bernstein
openaire   +1 more source

Approximate schedulability analysis

23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002., 2003
The schedulability analysis problem for many realistic task models is intractable. Therefore, known algorithms either have exponential complexity or at best can be solved in pseudo-polynomial time, thereby restricting application of the concerned models to a large extent. We introduce the notion of "approximate schedulability analysis" and show that if
Samarjit Chakraborty, Simon Künzli 0001, Lothar Thiele   +2 more
openaire   +1 more source

Tests for global EDF schedulability analysis

Journal of Systems Architecture, 2011
Several schedulability tests have been proposed for global EDF scheduling on identical multiprocessors. All these tests are sufficient, rather than exact. These different tests were, for the most part, independently developed.
Marko Bertogna, Sanjoy Baruah
exaly   +2 more sources

Sustainable Scheduling Analysis

2006 27th IEEE International Real-Time Systems Symposium (RTSS'06), 2006
A schedulability test is defined to be sustainable if any task system deemed schedulable by the test remains so if it behaves "better" than mandated by its system specifications. We provide a formal definition of sustainability, and subject the concept to systematic analysis in the context of the uniprocessor scheduling of periodic and sporadic task ...
Sanjoy K. Baruah, Alan Burns 0001
openaire   +1 more source