Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, Hyeonjoong | - |
dc.contributor.author | Kim, Chulgoo | - |
dc.contributor.author | Sun, Joohyung | - |
dc.contributor.author | Easwaran, Arvind | - |
dc.contributor.author | Park, Ju-Derk | - |
dc.contributor.author | Choi, Byeong-Cheol | - |
dc.date.accessioned | 2021-08-31T14:56:22Z | - |
dc.date.available | 2021-08-31T14:56:22Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2020-01 | - |
dc.identifier.issn | 1045-9219 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/58445 | - |
dc.description.abstract | Recently, several parallel frameworks have emerged to utilize the increasing computational capacity of multiprocessors. Parallel tasks are distinguished from traditional sequential tasks in that the subtasks contained in a single parallel task can simultaneously execute on multiple processors. In this study, we consider the scheduling problem of minimizing the number of processors on which the parallel real-time tasks feasibly run. In particular, we focus on scheduling sporadic parallel real-time tasks, in which precedence constraints between subtasks of each parallel task are expressed using a directed acyclic graph (DAG). To address the problem, we formulate an optimization problem that aims to minimize the maximum processing capacity for executing the given tasks. We then suggest a polynomial solution consisting of three steps: (1) transform each parallel real-time task into a series of multithreaded segments, while respecting the precedence constraints of the DAG; (2) selectively extend the segment lengths; and (3) interpret the problem as a flow network to balance the flows on the terminal edges. We also provide the schedulability bound of the proposed solution: it has a capacity augmentation bound of 2. Our experimental results show that the proposed approach yields higher performance than one developed in a recent study. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.subject | EDF SCHEDULABILITY ANALYSIS | - |
dc.subject | GLOBAL EDF | - |
dc.subject | ALGORITHM | - |
dc.title | Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cho, Hyeonjoong | - |
dc.identifier.doi | 10.1109/TPDS.2019.2929048 | - |
dc.identifier.scopusid | 2-s2.0-85076580420 | - |
dc.identifier.wosid | 000535489700012 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.31, no.1, pp.171 - 186 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | - |
dc.citation.title | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | - |
dc.citation.volume | 31 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 171 | - |
dc.citation.endPage | 186 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | EDF SCHEDULABILITY ANALYSIS | - |
dc.subject.keywordPlus | GLOBAL EDF | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordAuthor | Real-time scheduling | - |
dc.subject.keywordAuthor | multicores | - |
dc.subject.keywordAuthor | multiprocessors | - |
dc.subject.keywordAuthor | linear programming | - |
dc.subject.keywordAuthor | flow networks | - |
dc.subject.keywordAuthor | maximum flow problem | - |
dc.subject.keywordAuthor | minimum cost flow problem | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
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.