A NEW APPROACH TO FINDING OPTIMAL LINEAR SCHEDULES FOR UNIFORM DEPENDENCE ALGORITHMS†

DOI10.1080/10637199508915523MaRDI QIDQ4820122zbMATH OpenOpenAlexFDO

Authors Jong-Chuang Tsay, Jenn-Yang Ke

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199508915523

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• An Introduction to the Geometry of Numbers
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• The Design of Optimal Systolic Arrays
• The Organization of Computations for Uniform Recurrence Equations
• The parallel execution of DO loops

This page was built for publication: A NEW APPROACH TO FINDING OPTIMAL LINEAR SCHEDULES FOR UNIFORM DEPENDENCE ALGORITHMS†

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