Scatter search for real-time scheduling with timing, precedence and exclusion constraints

Tasks scheduling is one of the most important challenges in embedded hard-real-time systems. The problem is known to be NP-Hard and exhaustive search algorithms have no significant benefit in large-scale context. This paper proposes a scatter search based approach for mono-processor systems with tim...

Full description

Saved in:
Bibliographic Details
Main Authors: Bouridah, A, Drias, H, Laalaoui, Y
Format: Conference Proceeding
Language:English
Subjects:
Generators
meta-heuristic
pre-run-time scheduling
Processor scheduling
Real time systems
real-time
Scatter search
Search problems
Silicon
Synchronization
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Tasks scheduling is one of the most important challenges in embedded hard-real-time systems. The problem is known to be NP-Hard and exhaustive search algorithms have no significant benefit in large-scale context. This paper proposes a scatter search based approach for mono-processor systems with timing, precedence and exclusion constraints with no preemption. An empirical study is undertaken and comparison is done with results of previous works.
DOI:10.1109/ICMWI.2010.5648002