By Topic

Hard real-time multiobjective scheduling in heterogeneous systems using genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Miryani, M.R. ; Dept. of Comput. Eng., Ferdowsi Univ. of Mashhad, Mashhad, Iran ; Naghibzadeh, M.

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.

Published in:

Computer Conference, 2009. CSICC 2009. 14th International CSI

Date of Conference:

20-21 Oct. 2009