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

DOI10.1016/J.JPDC.2008.08.004zbMATH Open1327.68048OpenAlexW2004091032MaRDI QIDQ897394FDOQ897394

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

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

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)

Cites Work

• Title not available (Why is that?)
• The parallel execution of DO loops
• Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
• The Organization of Computations for Uniform Recurrence Equations
• Title not available (Why is that?)
• The mapping of linear recurrence equations on regular arrays
• Time optimal linear schedules for algorithms with uniform dependencies
• Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem
• On the Analysis and Synthesis of VLSI Algorithms
• Dynamic programming on two-dimensional systolic arrays
• PICO-NPA: High-level synthesis of nonprogrammable hardware accelerators
• Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays
• Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules
• Partitioning of processor arrays: a piecewise regular approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)