A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems

DOI10.1016/J.JPDC.2008.08.004MaRDI QIDQ897394zbMATHOpenAlexFDO

Authors Clémentin Tayou Djamegni, Patrice Quinton, Tanguy Risset, Sanjay V. Rajopadhye, Maurice Tchuente

Publication date 18 December 2015

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2008.08.004

zbMATH Keywords

systolic arraysdependence graphallocation functionparallel embedded systemsre-indexingspace-optimalityspace-time complexitytiming functiontiming surface

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 1535432
• Geometrical tools to map systems of affine recurrence equations on regular arrays
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Mapping uniform loop nests onto distributed memory architectures
• Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays

Cites work

• scientific article; zbMATH DE number 3976313 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 4094822 (Why is no real title available?)
• scientific article; zbMATH DE number 125141 (Why is no real title available?)
• scientific article; zbMATH DE number 1741001 (Why is no real title available?)
• Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules
• Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
• Dynamic programming on two-dimensional systolic arrays
• Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays
• On the Analysis and Synthesis of VLSI Algorithms
• PICO-NPA: High-level synthesis of nonprogrammable hardware accelerators
• Partitioning of processor arrays: a piecewise regular approach
• Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem
• The Organization of Computations for Uniform Recurrence Equations
• The mapping of linear recurrence equations on regular arrays
• The parallel execution of DO loops
• Time optimal linear schedules for algorithms with uniform dependencies
• Triangular matrix inversion of systolic arrays

Cited in

(1)

• Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays

This page was built for publication: A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897394)