Untitled

Bhattacharyya, Shuvra S.; Murthy, Praveen K.; Lee, Edward A.

doi:10.1023/a:1008806425898

Cited by 38 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A simple path is the one which does not visit any node along the path more than once. A method to cluster SDF actors is presented in [2] which introduced the Pairwise Grouping of Adjacent Nodes for Acyclic graph (APGAN) algorithm. Considering an acyclic SDF graph G = ⟨A, F ⟩ where A is a set of stateless actors and F is a set of FIFO, the algorithm can be summarized as follows: A cluster hierarchy is constructed by clustering exactly two adjacent vertices at each step.…”

Section: Cluster Of Sdf Actorsmentioning

confidence: 99%

SCAPE: HW-Aware Clustering of Dataflow Actors for Tunable Scheduling Complexity

Renaud

Gageot²,

Desnos

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper introduces a fast method to generate high performance parallelized code from a dataflow specification of an application. Dataflow Models of Computation (MoCs) are efficient programming paradigms for expressing the parallelism of an application. Traditionally, mapping and scheduling methods for dataflow MoCs rely on complex graph transformations to explicit their parallelism which can result in complex graph for embarrassingly parallel applications. For such applications, state-of-the-art mapping and scheduling techniques are prohibitively complex, while the exposed parallelism often exceeds the parallel processing capabilities of the target architecture. We propose SCAPE, an automated method to control the complexity of the pre-scheduling graph transformation by using information from the architecture and application models. By decreasing the complexity of the graph, the mapping scheduling task is accelerated at the potential expense of the produced schedule. Our method offers a limited and controlled decrease of the schedule quality while enabling mapping and scheduling execution time between 1 and 2 orders of magnitude faster than state-of-the-art techniques.

show abstract

Section: Cluster Of Sdf Actorsmentioning

confidence: 99%