On non-preemptive scheduling of period and sporadic tasks

2002 ◽  
Author(s):  
K. Jeffay ◽  
D.F. Stanat ◽  
C.U. Martel
Keyword(s):  
Preemptive Scheduling ◽  
Sporadic Tasks

Energy-aware preemptive scheduling algorithm for sporadic tasks on DVS platform

2013 ◽  
Vol 37 (1) ◽  
pp. 99-112 ◽  
Author(s):  
Jing Mei ◽  
Kenli Li ◽  
Jingtong Hu ◽  
Shu Yin ◽  
Edwin H.-M. Sha
Keyword(s):  
Scheduling Algorithm ◽  
Preemptive Scheduling ◽  
Sporadic Tasks ◽  
Energy Aware

Implementing analysable hard real-time sporadic tasks in Ada 9X

1994 ◽  
Vol XIV (1) ◽  
pp. 38-49 ◽  
Author(s):  
A. Burns ◽  
A. J. Wellings
Keyword(s):  
Real Time ◽  
Sporadic Tasks ◽  
Hard Real Time

Preemptive Scheduling for Two-Processor Systems

1988 ◽  
Vol 11 (1) ◽  
pp. 1-19
Author(s):  
Andrzej Rowicki
Keyword(s):  
Execution Time ◽  
Preemptive Scheduling ◽  
Total Execution Time ◽  
Schedule Length ◽  
Execution Times ◽  
Dependent Tasks

The purpose of the paper is to consider an algorithm for preemptive scheduling for two-processor systems with identical processors. Computations submitted to the systems are composed of dependent tasks with arbitrary execution times and contain no loops and have only one output. We assume that preemptions times are completely unconstrained, and preemptions consume no time. Moreover, the algorithm determines the total execution time of the computation. It has been proved that this algorithm is optimal, that is, the total execution time of the computation (schedule length) is minimized.

Non-Preemptive Scheduling to Maximize the Minimum Global Inter-Completion Time (MGICT) 1

1998 ◽  
Vol 31 (14) ◽  
pp. 135-140
Author(s):  
Carlos C. Amaro ◽  
Sanjoy K. Baruah ◽  
Alexander D. Stoyen ◽  
Wolfgang A. Halang
Keyword(s):  
Completion Time ◽  
Preemptive Scheduling
Sign in / Sign up

Export Citation Format

Share Document