Paper Info
Title
Hard real-time multiobjective scheduling in heterogeneous systems using genetic algorithms
Abstract
Optimal tasks allocation is one of the most important problems in multiprocessing. Optimal assignment of tasks to a multiprocessor is an NP-hard problem in general cases, and precedence task graph makes it more complex. Many factors affect optimal tasks allocation. One of them is cache reload time in multiprocessor systems. These problems exist in real-time systems, too. Due to high sensitivity of `time' in real-time systems, scheduling with respect to time constraints becomes very important. This paper proposes a suboptimal scheduler for hard realtime heterogeneous multiprocessor systems considering time constraints and cache reload time simultaneously, using multiobjective genetic algorithm. In addition, it tries to propose a generalized method for real-time multiobjective scheduling in multiprocessor systems using genetic algorithms.
Year
DOI
Venue
2009
10.1109/CSICC.2009.5349619
Tehran
Keywords
Field
DocType
computational complexity,genetic algorithms,real-time systems,resource allocation,scheduling,task analysis,np-hard problem,cache reload time,hard real time multiobjective scheduling,heterogeneous system,multiobjective genetic algorithm,multiprocessor system,optimal tasks allocation,suboptimal scheduler,tasks optimal assignment,time constraint,genetic algorithm,np hard problem,encoding,real time,real time systems
Multiprocessor scheduling,Cache,Computer science,Scheduling (computing),Symmetric multiprocessor system,Multiprocessing,Resource allocation,Genetic algorithm,Computational complexity theory,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4244-4262-1
3
0.41
References 
Authors
8
2
Name
Order
Citations
PageRank
Mohammad Reza Miryani141.44
Mahmoud Naghibzadeh243634.43