Time optimal linear schedules for algorithms with uniform dependencies

DOI10.1109/12.90251MaRDI QIDQ5375403zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• On the optimality of linear schedules
• Approximation Algorithms For Scheduling On Uniform Processors
• Linear time algorithms for parallel machine scheduling
• Algorithmic Applications in Management
• Uniform parallel-machine scheduling with time dependent processing times
• On the optimality of exact and approximation algorithms for scheduling problems
• scientific article; zbMATH DE number 6378894
• Approximation algorithms for time-constrained scheduling on line networks
• On minimizing register usage of linearly scheduled algorithms with uniform dependencies

Cited in

(8)

• Optimal systolic array algorithms for tensor product
• Automatic synthesis of parallel algorithms
• Linear approximation of execution-time constraints
• On minimizing register usage of linearly scheduled algorithms with uniform dependencies
• A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems
• scientific article; zbMATH DE number 6378894 (Why is no real title available?)
• 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

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

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