Back to search

NJIT

Efficient multiprocessor scheduling based on genetic algorithms

Abstract

dc:description.abstract

<p>The problem of multiprocessor scheduling can be stated as finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimized. This scheduling problem in known to be NP-hard and methods based on heuristic search have been proposed to obtain optimal and sub-optimal solutions to the problem. Genetic algorithms have recently received much attention as robust stochastic searching algorithms for various optimization problems. In this thesis, we propose an efficient method based on genetic algorithms to solve the multiprocessor scheduling problem. The representation of the search node will be based on the schedule of the tasks in each individual processor. The genetic operator proposed is based on the precedence relations between the tasks in the task graph. The proposed genetic algorithms will be applied to the problem of scheduling the robot inverse dynamics computations and randomly generated task graphs.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Science in Electrical Engineering - (M.S.)
Discipline thesis:degree_discipline
Electrical and Computer Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ren, Hong
Contributors dc:contributor
  • Edwin Hou
  • Nirwan Ansari
  • Sotirios Ziavras

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/2605

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ren, Hong. Efficient multiprocessor scheduling based on genetic algorithms. https://digitalcommons.njit.edu/theses/2605