NDLI: Worst-Case Throughput Analysis of SDF-Based Parametrized Dataflow

Content Provider	IEEE Xplore Digital Library
Author	Skelin, M. Geilen, M. Catthoor, F. Hendseth, S.
Copyright Year	2015
Description	Author affiliation: Norwegian Univ. of Sci. & Technol., Norwegian, Netherlands (Skelin, M.; Hendseth, S.) \|\| Eindhoven Univ. of Technol., Eindhoven, Netherlands (Geilen, M.) \|\| IMEC vzw, Eindhoven, Netherlands (Catthoor, F.)
Abstract	Dynamic dataflow models of computation (MoCs) have been introduced to provide designers with enough expressive power to capture increasing levels of dynamism in modern streaming applications. Among dynamic dataflow MoCs, parametrized dataflow MoCs hold an important place as they integrate dynamic parameters and run-time adaptation of parameters in a structured way. In this work, we analyze the temporal behaviour of an important class of parametrized dataflow MoCs based on synchronous dataflow (SDF). We refer to such models as SDF-based parametrized dataflow (SDF-PDF). We show that our analysis allows to derive tighter worst-case throughput guarantees than the existing techniques. To achieve this, we introduce the (max,+) algebraic semantics of the model. Thereafter, we model run-time parameter adaptation using the theory of (max,+) automata, where the maximum cycle mean (MCM) analysis of the (max,+) automaton structure immediately yields the worst-case throughput value. We evaluate our approach on a representative case study from the multimedia domain.
Starting Page	17
Ending Page	24
File Size	382736
Page Count	8
File Format	PDF
e-ISBN	9781467380355
DOI	10.1109/DSD.2015.25
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-08-26
Publisher Place	Portugal
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Delays Yttrium Throughput Computational modeling Schedules Decoding Semantics worst-case throughput synchronous dataflow (SDF) SDF-based parametrized dataflow (SDF-PDF) (max +) algebra
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Worst-case latency analysis of SDF-based parametrized dataflow MoCs

Parametrized dataflow scenarios

Parametrized dataflow scenarios

Performance analysis of weakly-consistent scenario-aware dataflow graphs

Worst-case performance analysis of synchronous dataflow scenarios

Worst-case performance analysis of Synchronous Dataflow scenarios

Worst-case performance analysis of synchronous dataflow scenarios (2010)

Iteration-Based Trade-Off Analysis of Resource-Aware SDF

Modeling static-order schedules in synchronous dataflow graphs

Worst-Case Throughput Analysis of SDF-Based Parametrized Dataflow

Similar Documents

Worst-case latency analysis of SDF-based parametrized dataflow MoCs

Parametrized dataflow scenarios

Parametrized dataflow scenarios

Performance analysis of weakly-consistent scenario-aware dataflow graphs

Worst-case performance analysis of synchronous dataflow scenarios

Worst-case performance analysis of Synchronous Dataflow scenarios

Worst-case performance analysis of synchronous dataflow scenarios (2010)

Iteration-Based Trade-Off Analysis of Resource-Aware SDF

Modeling static-order schedules in synchronous dataflow graphs

Worst-Case Throughput Analysis of SDF-Based Parametrized Dataflow