Set-based particle swarm optimization for mapping and scheduling tasks on heterogeneous embedded systems

Xiao Xiao Xu, Xiao Min Hu, Wei Neng Chen, Yun Li

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

4 Citations (Scopus)

Abstract

Modern heterogeneous multiprocessor embedded platforms is important for the high volume markets that have strict performance. However, it presents many challenges that need to be addressed in order to be efficiently utilized for multitask applications. Since mapping and scheduling problems for multi processors belong to the classic of NP-Complete problems, common methods used to solve this kind of problem usually fail. In this paper, we present an algorithm based on the meta-heuristic optimization technique, set-based discrete particle swarm optimization (S-PSO), which efficiently solves scheduling and mapping problems on the target platform. This algorithm can simultaneously addressed the mapping and scheduling problems on a complex and heterogeneous MPSoC and it has better performance than other algorithms in dealing with large scale problems. This algorithm also reduces the execution time of the application by exploring various solutions for mapping and scheduling of tasks and communications. We compare our approach with other heuristics, Ant Colony Optimization (ACO), on the performance to reach the optimum value and on the potential to explore the target platform. The results show that our approach performs better than other heuristics.

LanguageEnglish
Title of host publicationProceedings of the 8th International Conference on Advanced Computational Intelligence, ICACI 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages318-325
Number of pages8
DOIs
Publication statusPublished - 7 Apr 2016
Event8th International Conference on Advanced Computational Intelligence, ICACI 2016 - Chiang Mai, Thailand
Duration: 14 Feb 201616 Feb 2016

Conference

Conference8th International Conference on Advanced Computational Intelligence, ICACI 2016
CountryThailand
CityChiang Mai
Period14/02/1616/02/16

Fingerprint

Embedded systems
Particle swarm optimization (PSO)
Scheduling
Ant colony optimization
Computational complexity
Communication

Keywords

  • communications
  • mapping
  • scheduling
  • set-based discrete particle swarm optimization (DPSO)

Cite this

Xu, X. X., Hu, X. M., Chen, W. N., & Li, Y. (2016). Set-based particle swarm optimization for mapping and scheduling tasks on heterogeneous embedded systems. In Proceedings of the 8th International Conference on Advanced Computational Intelligence, ICACI 2016 (pp. 318-325). [7449845] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICACI.2016.7449845
Xu, Xiao Xiao ; Hu, Xiao Min ; Chen, Wei Neng ; Li, Yun. / Set-based particle swarm optimization for mapping and scheduling tasks on heterogeneous embedded systems. Proceedings of the 8th International Conference on Advanced Computational Intelligence, ICACI 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 318-325
@inproceedings{f2f8ab7e85464e0695b2b21098c64d45,
title = "Set-based particle swarm optimization for mapping and scheduling tasks on heterogeneous embedded systems",
abstract = "Modern heterogeneous multiprocessor embedded platforms is important for the high volume markets that have strict performance. However, it presents many challenges that need to be addressed in order to be efficiently utilized for multitask applications. Since mapping and scheduling problems for multi processors belong to the classic of NP-Complete problems, common methods used to solve this kind of problem usually fail. In this paper, we present an algorithm based on the meta-heuristic optimization technique, set-based discrete particle swarm optimization (S-PSO), which efficiently solves scheduling and mapping problems on the target platform. This algorithm can simultaneously addressed the mapping and scheduling problems on a complex and heterogeneous MPSoC and it has better performance than other algorithms in dealing with large scale problems. This algorithm also reduces the execution time of the application by exploring various solutions for mapping and scheduling of tasks and communications. We compare our approach with other heuristics, Ant Colony Optimization (ACO), on the performance to reach the optimum value and on the potential to explore the target platform. The results show that our approach performs better than other heuristics.",
keywords = "communications, mapping, scheduling, set-based discrete particle swarm optimization (DPSO)",
author = "Xu, {Xiao Xiao} and Hu, {Xiao Min} and Chen, {Wei Neng} and Yun Li",
year = "2016",
month = "4",
day = "7",
doi = "10.1109/ICACI.2016.7449845",
language = "English",
pages = "318--325",
booktitle = "Proceedings of the 8th International Conference on Advanced Computational Intelligence, ICACI 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Xu, XX, Hu, XM, Chen, WN & Li, Y 2016, Set-based particle swarm optimization for mapping and scheduling tasks on heterogeneous embedded systems. in Proceedings of the 8th International Conference on Advanced Computational Intelligence, ICACI 2016., 7449845, Institute of Electrical and Electronics Engineers Inc., pp. 318-325, 8th International Conference on Advanced Computational Intelligence, ICACI 2016, Chiang Mai, Thailand, 14/02/16. https://doi.org/10.1109/ICACI.2016.7449845

Set-based particle swarm optimization for mapping and scheduling tasks on heterogeneous embedded systems. / Xu, Xiao Xiao; Hu, Xiao Min; Chen, Wei Neng; Li, Yun.

Proceedings of the 8th International Conference on Advanced Computational Intelligence, ICACI 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 318-325 7449845.

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

TY - GEN

T1 - Set-based particle swarm optimization for mapping and scheduling tasks on heterogeneous embedded systems

AU - Xu, Xiao Xiao

AU - Hu, Xiao Min

AU - Chen, Wei Neng

AU - Li, Yun

PY - 2016/4/7

Y1 - 2016/4/7

N2 - Modern heterogeneous multiprocessor embedded platforms is important for the high volume markets that have strict performance. However, it presents many challenges that need to be addressed in order to be efficiently utilized for multitask applications. Since mapping and scheduling problems for multi processors belong to the classic of NP-Complete problems, common methods used to solve this kind of problem usually fail. In this paper, we present an algorithm based on the meta-heuristic optimization technique, set-based discrete particle swarm optimization (S-PSO), which efficiently solves scheduling and mapping problems on the target platform. This algorithm can simultaneously addressed the mapping and scheduling problems on a complex and heterogeneous MPSoC and it has better performance than other algorithms in dealing with large scale problems. This algorithm also reduces the execution time of the application by exploring various solutions for mapping and scheduling of tasks and communications. We compare our approach with other heuristics, Ant Colony Optimization (ACO), on the performance to reach the optimum value and on the potential to explore the target platform. The results show that our approach performs better than other heuristics.

AB - Modern heterogeneous multiprocessor embedded platforms is important for the high volume markets that have strict performance. However, it presents many challenges that need to be addressed in order to be efficiently utilized for multitask applications. Since mapping and scheduling problems for multi processors belong to the classic of NP-Complete problems, common methods used to solve this kind of problem usually fail. In this paper, we present an algorithm based on the meta-heuristic optimization technique, set-based discrete particle swarm optimization (S-PSO), which efficiently solves scheduling and mapping problems on the target platform. This algorithm can simultaneously addressed the mapping and scheduling problems on a complex and heterogeneous MPSoC and it has better performance than other algorithms in dealing with large scale problems. This algorithm also reduces the execution time of the application by exploring various solutions for mapping and scheduling of tasks and communications. We compare our approach with other heuristics, Ant Colony Optimization (ACO), on the performance to reach the optimum value and on the potential to explore the target platform. The results show that our approach performs better than other heuristics.

KW - communications

KW - mapping

KW - scheduling

KW - set-based discrete particle swarm optimization (DPSO)

UR - http://www.scopus.com/inward/record.url?scp=84966495166&partnerID=8YFLogxK

U2 - 10.1109/ICACI.2016.7449845

DO - 10.1109/ICACI.2016.7449845

M3 - Conference contribution book

SP - 318

EP - 325

BT - Proceedings of the 8th International Conference on Advanced Computational Intelligence, ICACI 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Xu XX, Hu XM, Chen WN, Li Y. Set-based particle swarm optimization for mapping and scheduling tasks on heterogeneous embedded systems. In Proceedings of the 8th International Conference on Advanced Computational Intelligence, ICACI 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 318-325. 7449845 https://doi.org/10.1109/ICACI.2016.7449845