Results 291 to 300 of about 106,211 (332)

Deadline scheduling in the Linux kernel

Software: Practice and Experience, 2015
SummaryDuring the last decade, there has been a considerable interest in using Linux in real‐time systems, especially for industrial control. The simple and elegant design of Linux guarantees reliability and very good performance, while its open‐source license allows to modify and change the source code according to the user needs.
Juri Lelli, Claudio Scordino, Luca Abeni, Dario Faggioli   +3 more
openaire   +2 more sources

Deadline based channel scheduling

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002
The use of deadline based channel scheduling in support of real time delivery of application data units (ADU's) is investigated. Of interest is priority scheduling where a packet with a smaller ratio of delivery deadline over number of hops to destination is given a higher priority.
Yanni Ellen Liu, Johnny W. Wong
openaire   +1 more source

Scheduling tasks with variable deadlines

Proceedings Seventh IEEE Real-Time Technology and Applications Symposium, 2002
Traditional real time scheduling algorithms typically assume that deadlines of tasks do not change with time. Task deadlines in many real time command, control and communication applications change over time. Deadlines of some tasks in these applications depend on the states of the objects monitored and controlled by the applications.
Chi-Sheng Shih 0001, Lui Sha, Jane W.-S. Liu   +2 more
openaire   +1 more source

Improved on-line broadcast scheduling with deadlines

Journal of Scheduling, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stanley P. Y. Fung, Feifeng Zheng, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong   +5 more
openaire   +6 more sources

Deadline Monotonic Scheduling on Uniform Multiprocessors [PDF]

, 2008
The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, in the form of a processor speedup bound.
Baruah, Sanjoy, Goossens, Joël
openaire   +1 more source

Feasibility intervals for the deadline driven scheduler with arbitrary deadlines

Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306), 2003
In this paper, we extend the determination of feasibility intervals to task sets with arbitrary deadlines, both in the synchronous and the asynchronous case. Meanwhile we also improve the arguments and results generally found in the literature.
Goossens, Joël, Devillers, Raymond
openaire   +2 more sources

Deadline-Aware Programming and Scheduling

2014
Deadlines are the most important events in real-time systems. Real-time programs must therefore be aware of deadlines, and be able to identify and react to missed deadlines. Moreover, Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems.
Alan Burns 0001, Andy J. Wellings
openaire   +1 more source

Scheduling with tails and deadlines

Journal of Scheduling, 2001
This paper discusses scheduling problems that combine tails and deadlines or, equivalently, due dates and deadlines. This approach is illustrated to be of practical interest to strengthen some lower bounds in shop scheduling problems. We show that both deadlines and tails can efficiently be modelled via a non-decreasing cost function of the completion ...
Sourd, Francis, Nuijten, Wim
openaire   +4 more sources

Optimal scheduling for jobs with progressive deadlines

2015 IEEE Conference on Computer Communications (INFOCOM), 2015
This paper considers the problem of server-side scheduling for jobs composed of multiple pieces with consecutive (progressive) deadlines. One example is server-side scheduling for video service, where clients request flows of content from a server with limited capacity, and any content not delivered by its deadline is lost. We consider the simultaneous
Kristen Gardner 0001, Sem C. Borst, Mor Harchol-Balter   +2 more
openaire   +1 more source

Scheduling Messages with Earliest Deadline Techniques

Real-Time Systems, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marco Di Natale, Antonio Meschi
openaire   +2 more sources