Time optimal linear schedules for algorithms with uniform dependencies

DOI10.1109/12.90251zbMath1395.68077OpenAlexW2122804176WikidataQ114629652 ScholiaQ114629652MaRDI QIDQ5375403

Weijia Shang, José A. B. Fortes

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.90251

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems ⋮ On minimizing register usage of linearly scheduled algorithms with uniform dependencies ⋮ A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing ⋮ Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming ⋮ Optimal systolic array algorithms for tensor product

This page was built for publication: Time optimal linear schedules for algorithms with uniform dependencies