Multiprocessor scheduling of an SDF graph with library tasks considering the worst case contention delay
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jung, Hanwoong | - |
dc.contributor.author | Oh, Hyunok | - |
dc.contributor.author | Ha, Soonhoi | - |
dc.date.accessioned | 2021-08-03T03:27:45Z | - |
dc.date.available | 2021-08-03T03:27:45Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2016-08 | - |
dc.identifier.issn | 2325-1301 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/33046 | - |
dc.description.abstract | Recently a novel extension of a dataflow model with a library task has been proposed to overcome the severe limitation of dataflow models to handle shared resources. The library task that contains library functions and shared data inside plays the role of a server task when dataflow tasks as clients call library functions. In this paper, we propose a meta-heuristic technique based on a multi-objective genetic algorithm to find Pareto-optimal solutions in terms of resource requirement and the worst-case response time (WCRT) of the extended synchronous dataflow (SDF) graph with library tasks. For a given task graph, the proposed technique determines not only the mapping and scheduling in a heterogeneous multiprocessor system, but also task priorities and library task duplication. When multiple tasks request the service of the library task simultaneously, a task may experience a significant contention delay. For fast design space exploration, a fast and conservative method to estimate the contention delay of library tasks is devised. With synthetic examples and two real-life applications, the viability of the proposed technique is verified. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery, Inc | - |
dc.title | Multiprocessor scheduling of an SDF graph with library tasks considering the worst case contention delay | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Oh, Hyunok | - |
dc.identifier.doi | 10.1145/2993452.2993567 | - |
dc.identifier.scopusid | 2-s2.0-84995965393 | - |
dc.identifier.bibliographicCitation | Proceedings of the 14th ACM/IEEE Symposium on Embedded Systems for Real-Time Multimedia, ESTIMedia 2016, pp.84 - 93 | - |
dc.relation.isPartOf | Proceedings of the 14th ACM/IEEE Symposium on Embedded Systems for Real-Time Multimedia, ESTIMedia 2016 | - |
dc.citation.title | Proceedings of the 14th ACM/IEEE Symposium on Embedded Systems for Real-Time Multimedia, ESTIMedia 2016 | - |
dc.citation.startPage | 84 | - |
dc.citation.endPage | 93 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Embedded systems | - |
dc.subject.keywordPlus | Genetic algorithms | - |
dc.subject.keywordPlus | Heuristic methods | - |
dc.subject.keywordPlus | Multiprocessing systems | - |
dc.subject.keywordPlus | Pareto principle | - |
dc.subject.keywordPlus | Real time systems | - |
dc.subject.keywordPlus | Response time (computer systems) | - |
dc.subject.keywordPlus | Scheduling | - |
dc.subject.keywordPlus | Heterogeneous multiprocessor systems | - |
dc.subject.keywordPlus | Meta-heuristic techniques | - |
dc.subject.keywordPlus | Multi processor scheduling | - |
dc.subject.keywordPlus | Multi-objective genetic algorithm | - |
dc.subject.keywordPlus | Pareto optimal solutions | - |
dc.subject.keywordPlus | Synchronous Dataflow | - |
dc.subject.keywordPlus | Worst case response time | - |
dc.subject.keywordPlus | Worst-case contention delay | - |
dc.subject.keywordPlus | Data flow analysis | - |
dc.subject.keywordAuthor | Library task | - |
dc.subject.keywordAuthor | Multiprocessor scheduling | - |
dc.subject.keywordAuthor | Synchronous dataflow | - |
dc.subject.keywordAuthor | Worst-case contention delay | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/2993452.2993567 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.