Efficient multiprocessor scheduling based on genetic algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Abstract

An efficient method, based on genetic algorithms, for solving the multiprocessor scheduling problem is propsed. The representation of the search node is based on the schedule of the tasks in each individual processor. The genetic operator is based on the precedence relations between the tasks in the task graph. The genetic algorithm is applied to the problem of scheduling robot inverse dynamics computations.

Original languageEnglish (US)
Title of host publicationPower Electronics Emerging Technologies
PublisherPubl by IEEE
Pages1239-1243
Number of pages5
ISBN (Print)0879426004
StatePublished - Dec 1 1990
Event16th Annual Conference of IEEE Industrial Electronics Society - IECON'90 - Pacific Grove, CA, USA
Duration: Nov 27 1990Nov 30 1990

Publication series

NameIECON Proceedings (Industrial Electronics Conference)
Volume2

Other

Other16th Annual Conference of IEEE Industrial Electronics Society - IECON'90
CityPacific Grove, CA, USA
Period11/27/9011/30/90

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Efficient multiprocessor scheduling based on genetic algorithms'. Together they form a unique fingerprint.

Cite this