Genetic list scheduling for soft real-time parallel applications

2004 ◽  
Author(s):  
Y.S. Dandass
Keyword(s):  
Real Time ◽  
Parallel Applications ◽  
List Scheduling

REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE

1999 ◽  
Vol 10 (03) ◽  
pp. 313-327 ◽  
Author(s):  
AXEL W. KRINGS ◽  
MOSHE DROR
Keyword(s):  
Real Time ◽  
Theoretical Concept ◽  
Precedence Constraints ◽  
List Scheduling ◽  
Task Duration ◽  
Precedence Relation ◽  
The Past ◽  
Precedence Graph ◽  
Run Time

This paper introduces a new graph theoretical concept called strong precedence which is used to address the problem of scheduling instability is non-preemptive static list scheduling. Scheduling instability occurs when a reduction in task duration of one or more tasks causes other tasks to miss their deadline. This problem has been addressed in the past by introducing additional precedence constraints into the precedence graph representing the workload, or by limiting the depth the dispatchers scan at run-time. We present an alternative stabilization approach based on the concept of strong and weak precedence. By defining a strong precedence relation on selected subgraphs, the workload becomes inherently stable without requiring the introduction of new edges into the graph.

CAP: Communication-Aware Allocation Algorithm for Real-Time Parallel Applications on Many-Cores

2015 ◽  
Author(s):  
Milo Panic ◽  
Eduardo Quinones ◽  
Carles Hernandez ◽  
Jaume Abella ◽  
Francisco J. Cazorla
Keyword(s):  
Real Time ◽  
Parallel Applications ◽  
Allocation Algorithm
Sign in / Sign up

Export Citation Format

Share Document