๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Dynamic scheduling of real-time tasks under precedence constraints

โœ Scribed by H. Chetto; M. Silly; T. Bouchentouf

Publisher
Springer US
Year
1990
Tongue
English
Weight
730 KB
Volume
2
Category
Article
ISSN
0922-6443

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fixed priority scheduling of tasks with
Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems
โœ Romulo Silva de Oliveira; Joni da Silva Fraga ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 219 KB

This paper considers the schedulability analysis of real-time distributed applications where tasks may present arbitrary precedence relations. It is assumed that tasks are periodic or sporadic and dynamically released. They have ยฎxed priorities and hard end-to-end deadlines that are equal to or less

Dynamic Real-Time Task Scheduling on Hyp
Dynamic Real-Time Task Scheduling on Hypercubes
โœ Prasant Mohapatra ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 293 KB

Multiprocesssor systems have emerged as an important computing means for real-time applications and have received increasing attention. However, until now, little research has been done on the problem of on-line scheduling of parallel tasks with deadlines in partitionable multiprocessor systems. Mes

Parallel tabu search message-passing syn
Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints
โœ Stella C. S. Porto; Celso C. Ribeiro ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Springer US ๐ŸŒ English โš– 999 KB

This paper presents parallelization strategies for a tabu search algorithm for the task scheduling problem on heterogeneous processors under task precedence constraints. Parallelization relies exclusively on the decompostion of the solution space exploration. Four different parallel strategies are p