Optimising earliest deadline first scheduling for parallel real-time tasks on multiprocessors
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, C. | - |
dc.contributor.author | Cho, H. | - |
dc.contributor.author | Sung, Y. | - |
dc.date.accessioned | 2021-08-31T20:25:03Z | - |
dc.date.available | 2021-08-31T20:25:03Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2019-12-12 | - |
dc.identifier.issn | 0013-5194 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/60928 | - |
dc.description.abstract | Multiprocessors have become prevalent in real-time systems owing to their higher throughput. Various types of scheduling algorithms have been proposed for parallel real-time tasks, which differ from traditional tasks in that their subtasks execute in parallel. A parallel task is frequently modelled as a directed acyclic graph (DAG) that expresses the precedence constraints between its subtasks. In this Letter, the authors propose a decomposition algorithm to improve the Earliest Deadline First schedulability for DAG tasks, based on convex optimisation theory. Their experimental results demonstrate that their algorithm outperforms the two most recently published algorithms. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | INST ENGINEERING TECHNOLOGY-IET | - |
dc.title | Optimising earliest deadline first scheduling for parallel real-time tasks on multiprocessors | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cho, H. | - |
dc.identifier.doi | 10.1049/el.2019.3017 | - |
dc.identifier.scopusid | 2-s2.0-85076566831 | - |
dc.identifier.wosid | 000517832500012 | - |
dc.identifier.bibliographicCitation | ELECTRONICS LETTERS, v.55, no.25, pp.1343 - + | - |
dc.relation.isPartOf | ELECTRONICS LETTERS | - |
dc.citation.title | ELECTRONICS LETTERS | - |
dc.citation.volume | 55 | - |
dc.citation.number | 25 | - |
dc.citation.startPage | 1343 | - |
dc.citation.endPage | + | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordAuthor | multiprocessing systems | - |
dc.subject.keywordAuthor | real-time systems | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | optimisation | - |
dc.subject.keywordAuthor | processor scheduling | - |
dc.subject.keywordAuthor | directed graphs | - |
dc.subject.keywordAuthor | earliest deadline first scheduling | - |
dc.subject.keywordAuthor | real-time tasks | - |
dc.subject.keywordAuthor | multiprocessors | - |
dc.subject.keywordAuthor | real-time systems | - |
dc.subject.keywordAuthor | scheduling algorithms | - |
dc.subject.keywordAuthor | traditional tasks | - |
dc.subject.keywordAuthor | subtasks | - |
dc.subject.keywordAuthor | parallel task | - |
dc.subject.keywordAuthor | directed acyclic graph | - |
dc.subject.keywordAuthor | decomposition algorithm | - |
dc.subject.keywordAuthor | Earliest Deadline First schedulability | - |
dc.subject.keywordAuthor | DAG tasks | - |
dc.subject.keywordAuthor | convex optimisation theory | - |
dc.subject.keywordAuthor | recently published algorithms | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.