Sciweavers

Share
IPPS
1998
IEEE

An Evolutionary Approach to Multiprocessor Scheduling of Dependent Tasks

11 years 5 months ago
An Evolutionary Approach to Multiprocessor Scheduling of Dependent Tasks
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are interrelated by mutual exclusion and precedence constraints. This paper presents an approach for pre-runtime scheduling of periodic tasks on multiple processors for a real-time system that must meet hard deadlines. The tasks can be related to each other by mutualexclusion and precedence forming an acyclic graph. The proposed scheduler is based on Genetic Algorithms, which relieves the user from knowing how to construct a solution. Consequently, the paper focuses on the problem encoding, i.e., the representation of the problem by genes and chromosomes, and the derivation of an appropriate tness function. The main bene t of the approach is that it is scalable to any number of processors and can easily be extended to incorporate further requirements.
Roman Nossal
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where IPPS
Authors Roman Nossal
Comments (0)
books