Multiprocessor Scheduling of an SDF Graph with Library Tasks Considering the Worst Case Contention Delay

Title
Multiprocessor Scheduling of an SDF Graph with Library Tasks Considering the Worst Case Contention Delay
Author
오현옥
Keywords
Synchronous dataflow; Library task; Worst-case contention delay; Multiprocessor scheduling
Issue Date
2016-10
Publisher
ACM/IEEE
Citation
2016 14th ACM/IEEE Symposium on Embedded Systems For Real-time Multimedia (ESTIMedia), Page. 84-93
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.
URI
https://ieeexplore.ieee.org/document/7746770?arnumber=7746770&SID=EBSCO:edseeehttp://repository.hanyang.ac.kr/handle/20.500.11754/81246
ISBN
978-1-4503-4543-9
ISSN
2325-1301
DOI
10.1145/2993452.2993567
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > INFORMATION SYSTEMS(정보시스템학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE