Title
Resource minimized static mapping and dynamic scheduling of SDF graphs
Abstract
In this paper, we focus on the throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes in contrast to the related work that assumes static scheduling. Since the scheduling order in dynamic scheduling is dependent on the priority assignment, three priority assignment methods are proposed and compared. If all task execution times do not vary at run-time, priority assignment is another way of storing a static schedule. We propose a static mapping technique to minimize the resource overhead considering both the processor cost and the total buffer size on all arcs under a given throughput constraint. Since the problem is NP-complete, a multi objective evolutionary algorithm is exploited to discover the mapping that minimizes the processor cost and the buffer requirement simultaneously. The experimental results show that the proposed technique requires fewer resources or higher average throughput than the previous approaches.
Year
DOI
Venue
2011
10.1109/ESTIMedia.2011.6088529
ESTIMedia
Keywords
Field
DocType
optimisation,parallel processing,dynamic scheduling,scheduling,throughput-constrained parallel execution,evolutionary computation,synchronous data flow graphs,data flow graphs,parallel execution,np-complete problem,mapping,sdf graphs,buffer size minimization,multiobjective evolutionary algorithm,static mapping technique,resource minimized static mapping,throughput,sdf graph,schedules
Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Deadline-monotonic scheduling,Parallel computing,Real-time computing,Schedule,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4577-2123-6
1
0.41
References 
Authors
19
4
Name
Order
Citations
PageRank
Jinwoo Kim11918168.52
Tae-ho Shin290.94
Soonhoi Ha31684174.65
Hyunok Oh445740.49