Paper Info
Title
Static dataflow with access patterns: semantics and analysis
Abstract
Signal processing and multimedia applications are commonly modeled using Static/Cyclo-Static Dataflow (SDF/CSDF) models. SDF/CSDF explicitly specifies how much data is produced and consumed per firing during computation. This results in strong compile-time analyzability of many useful execution properties such as deadlock absence, channel boundedness, and throughput. However, SDF/CSDF is limited in its ability to capture how data is accessed in time. Hence, using these models often leads to implementations that are sub-optimal (i.e., use more resources than necessary) or even incorrect (i.e., use insufficient resources). In this work, we advance a new model called Static Dataflow with Access Patterns (SDF-AP) that captures the timing of data accesses (for both production and consumption). This paper formalizes the semantics of SDF-AP, defines key properties governing model execution, and discusses algorithms to check these properties under correctness and resource constraints. Results are presented to evaluate these analysis algorithms on practical applications modeled by SDF-AP.
Year
DOI
Venue
2012
10.1145/2228360.2228479
DAC
Keywords
Field
DocType
channel boundedness,static dataflow,useful execution property,analysis algorithm,deadlock absence,new model,access pattern,data access,model execution,cyclo-static dataflow,access patterns,semantics,computational modeling,signal processing,dataflow,throughput
Signal processing,Computer science,Parallel computing,Deadlock,Correctness,Communication channel,Real-time computing,Dataflow,Throughput,Semantics,Computation
Conference
ISSN
Citations 
PageRank 
0738-100X
3
0.38
References 
Authors
15
8
Name
Order
Citations
PageRank
Arkadeb Ghosal116511.54
Rhishikesh Limaye21517.81
Kaushik Ravindran320416.09
Stavros Tripakis42181138.07
Ankita Prasad530.38
Guoqiang Wang6131.35
Trung N. Tran791.54
Hugo Andrade8142.06