Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
NOMeS: Near-Optimal Metaheuristic Scheduling for MPSoCs
Abo Akad Univ, Turku, Finland..
Malardalen Univ, Vasteras, Sweden..
Univ Turku, Turku, Finland..
Show others and affiliations
2017 (English)In: 2017 19TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND DIGITAL SYSTEMS (CADS), IEEE , 2017, p. 70-75Conference paper, Published paper (Refereed)
Abstract [en]

The task scheduling problem for Multiprocessor System-on-Chips (MPSoC), which plays a vital role in performance, is an NP-hard problem. Exploring the whole search space in order to find the optimal solution is not time efficient, thus metaheuristics are mostly used to find a near-optimal solution in a reasonable amount of time. We propose a novel metaheuristic method for near-optimal scheduling that can provide performance guarantees for multiple applications implemented on a shared platform. Applications are represented as directed acyclic task graphs (DAG) and are executed on an MPSoC platform with given communication costs. We introduce a novel multi-population method inspired by both genetic and imperialist competitive algorithms. It is specialized for the scheduling problem with the goal to improve the convergence policy and selection pressure. The potential of the approach is demonstrated by experiments using a Sobel filter, a SUSAN filter, RASTA-PLP and JPEG encoder as real-world case studies.

Place, publisher, year, edition, pages
IEEE , 2017. p. 70-75
Series
CSI International Symposium on Computer Architecture and Digital Systems, ISSN 2325-9361
Keywords [en]
parallel imperialist competitive algorithm (PICA), multi-population technique, evolutionary computing (EC), task graph scheduling, multi-objective optimization
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:kth:diva-228176ISI: 000428738600013ISBN: 978-1-5386-4379-2 OAI: oai:DiVA.org:kth-228176DiVA, id: diva2:1209271
Conference
19th International Symposium on Computer Architecture and Digital Systems (CADS), DEC 21-22, 2017, Iran Univ Sci & Technol, IRAN
Note

QC 20180522

Available from: 2018-05-22 Created: 2018-05-22 Last updated: 2018-05-22Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Moghaddami Khalilzad, Nima

Search in DiVA

By author/editor
Moghaddami Khalilzad, Nima
By organisation
KTH
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 4 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf