Efficient task scheduling for hard real-time tasks in asymmetric multicore processors

Sung Il Kim, Jong-Kook Kim, Hyoung Uk Ha, Tae Ho Kim, Kyu Hyun Choi

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

Abstract

In the future it is very likely that asymmetric multi-core processors (AMP) will be used because of their proposed power efficiency and higher performance. In order to use the device intelligently and efficiently, it is essential to exploit the heterogeneity of AMPs. To fully exploit AMP systems, intelligent scheduling of tasks or intelligent resource management becomes one of the critical issues. In this paper, an AMP system is emulated, SPEC CPU2006 benchmark applications are executed as tasks, and heuristic methods for task scheduling are designed. Tasks are independent, non-preemptive, and have deadline (hard real-time) constraints. They arrive aperiodically and task migration is enabled. The performance metric is the total number of tasks completed by their deadline. The heuristic methods that are designed are compared with classic methods and the naïve Linux scheduler. Experimental results show that our task scheduling method completed 2.8 times more tasks than the naïve Linux scheduler for the proposed AMP environment.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages187-196
Number of pages10
Volume7440 LNCS
EditionPART 2
DOIs
Publication statusPublished - 2012 Oct 1
Event12th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2012 - Fukuoka, Japan
Duration: 2012 Sep 42012 Sep 7

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume7440 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2012
CountryJapan
CityFukuoka
Period12/9/412/9/7

Fingerprint

Multi-core Processor
Task Scheduling
Heuristic methods
Scheduling
Real-time
Linux
Heuristic Method
Deadline
Scheduler
Intelligent systems
Performance Metrics
Intelligent Systems
Resource Management
Migration
High Performance
Likely
Benchmark
Experimental Results

Keywords

  • algorithms
  • asymmetric
  • heterogeneous
  • multicore
  • multiprocessor
  • real-time
  • task scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kim, S. I., Kim, J-K., Ha, H. U., Kim, T. H., & Choi, K. H. (2012). Efficient task scheduling for hard real-time tasks in asymmetric multicore processors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 2 ed., Vol. 7440 LNCS, pp. 187-196). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7440 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-33065-0_20

Efficient task scheduling for hard real-time tasks in asymmetric multicore processors. / Kim, Sung Il; Kim, Jong-Kook; Ha, Hyoung Uk; Kim, Tae Ho; Choi, Kyu Hyun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7440 LNCS PART 2. ed. 2012. p. 187-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7440 LNCS, No. PART 2).

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

Kim, SI, Kim, J-K, Ha, HU, Kim, TH & Choi, KH 2012, Efficient task scheduling for hard real-time tasks in asymmetric multicore processors. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 edn, vol. 7440 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 7440 LNCS, pp. 187-196, 12th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2012, Fukuoka, Japan, 12/9/4. https://doi.org/10.1007/978-3-642-33065-0_20
Kim SI, Kim J-K, Ha HU, Kim TH, Choi KH. Efficient task scheduling for hard real-time tasks in asymmetric multicore processors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 ed. Vol. 7440 LNCS. 2012. p. 187-196. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-642-33065-0_20
Kim, Sung Il ; Kim, Jong-Kook ; Ha, Hyoung Uk ; Kim, Tae Ho ; Choi, Kyu Hyun. / Efficient task scheduling for hard real-time tasks in asymmetric multicore processors. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7440 LNCS PART 2. ed. 2012. pp. 187-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{c25d275aa2c345bbb41b444379a52d19,
title = "Efficient task scheduling for hard real-time tasks in asymmetric multicore processors",
abstract = "In the future it is very likely that asymmetric multi-core processors (AMP) will be used because of their proposed power efficiency and higher performance. In order to use the device intelligently and efficiently, it is essential to exploit the heterogeneity of AMPs. To fully exploit AMP systems, intelligent scheduling of tasks or intelligent resource management becomes one of the critical issues. In this paper, an AMP system is emulated, SPEC CPU2006 benchmark applications are executed as tasks, and heuristic methods for task scheduling are designed. Tasks are independent, non-preemptive, and have deadline (hard real-time) constraints. They arrive aperiodically and task migration is enabled. The performance metric is the total number of tasks completed by their deadline. The heuristic methods that are designed are compared with classic methods and the na{\"i}ve Linux scheduler. Experimental results show that our task scheduling method completed 2.8 times more tasks than the na{\"i}ve Linux scheduler for the proposed AMP environment.",
keywords = "algorithms, asymmetric, heterogeneous, multicore, multiprocessor, real-time, task scheduling",
author = "Kim, {Sung Il} and Jong-Kook Kim and Ha, {Hyoung Uk} and Kim, {Tae Ho} and Choi, {Kyu Hyun}",
year = "2012",
month = "10",
day = "1",
doi = "10.1007/978-3-642-33065-0_20",
language = "English",
isbn = "9783642330643",
volume = "7440 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "187--196",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 2",

}

TY - GEN

T1 - Efficient task scheduling for hard real-time tasks in asymmetric multicore processors

AU - Kim, Sung Il

AU - Kim, Jong-Kook

AU - Ha, Hyoung Uk

AU - Kim, Tae Ho

AU - Choi, Kyu Hyun

PY - 2012/10/1

Y1 - 2012/10/1

N2 - In the future it is very likely that asymmetric multi-core processors (AMP) will be used because of their proposed power efficiency and higher performance. In order to use the device intelligently and efficiently, it is essential to exploit the heterogeneity of AMPs. To fully exploit AMP systems, intelligent scheduling of tasks or intelligent resource management becomes one of the critical issues. In this paper, an AMP system is emulated, SPEC CPU2006 benchmark applications are executed as tasks, and heuristic methods for task scheduling are designed. Tasks are independent, non-preemptive, and have deadline (hard real-time) constraints. They arrive aperiodically and task migration is enabled. The performance metric is the total number of tasks completed by their deadline. The heuristic methods that are designed are compared with classic methods and the naïve Linux scheduler. Experimental results show that our task scheduling method completed 2.8 times more tasks than the naïve Linux scheduler for the proposed AMP environment.

AB - In the future it is very likely that asymmetric multi-core processors (AMP) will be used because of their proposed power efficiency and higher performance. In order to use the device intelligently and efficiently, it is essential to exploit the heterogeneity of AMPs. To fully exploit AMP systems, intelligent scheduling of tasks or intelligent resource management becomes one of the critical issues. In this paper, an AMP system is emulated, SPEC CPU2006 benchmark applications are executed as tasks, and heuristic methods for task scheduling are designed. Tasks are independent, non-preemptive, and have deadline (hard real-time) constraints. They arrive aperiodically and task migration is enabled. The performance metric is the total number of tasks completed by their deadline. The heuristic methods that are designed are compared with classic methods and the naïve Linux scheduler. Experimental results show that our task scheduling method completed 2.8 times more tasks than the naïve Linux scheduler for the proposed AMP environment.

KW - algorithms

KW - asymmetric

KW - heterogeneous

KW - multicore

KW - multiprocessor

KW - real-time

KW - task scheduling

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

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

U2 - 10.1007/978-3-642-33065-0_20

DO - 10.1007/978-3-642-33065-0_20

M3 - Conference contribution

SN - 9783642330643

VL - 7440 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 187

EP - 196

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -