Paper Info
Title
Multiprocessor Scheduling of an SDF Graph with Library Tasks Considering the Worst Case Contention Delay.
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.
Year
DOI
Venue
2016
10.1145/2993452.2993567
ESTImedia
Keywords
Field
DocType
Synchronous dataflow, Library task, Worst-case contention delay, Multiprocessor scheduling
Multiprocessor scheduling,Computer science,Scheduling (computing),Parallel computing,Response time,Multiprocessing,Real-time computing,Dataflow,Software,Design space exploration,Genetic algorithm,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-5090-4163-3
0
0.34
References 
Authors
6
3
Name
Order
Citations
PageRank
Hanwoong Jung1192.81
Hyunok Oh245740.49
Soonhoi Ha31684174.65