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

DOI10.1080/10637199508915523zbMATH Open1049.68542OpenAlexW1966225817MaRDI QIDQ4820122FDOQ4820122

Jenn-Yang Ke, Jong-Chuang Tsay

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• An Introduction to the Geometry of Numbers
• The Design of Optimal Systolic Arrays
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• The parallel execution of DO loops
• The Organization of Computations for Uniform Recurrence Equations

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)