Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming

DOI10.1016/S0010-4655(01)00231-4zbMath0985.68101MaRDI QIDQ5950530

Wolfgang Achtziger, Karl-Heinz Zimmermann

Publication date: 18 December 2001

Published in: Computer Physics Communications (Search for Journal in Brave)

zbMATH Keywords

systolic arrayuniform recurrence equation

Mathematics Subject Classification ID

Quadratic programming (90C20) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• NLPQL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spacetime representations of computational structures
• Automatic design and partitioning of systolic/wavefront arrays for VLSI
• On time optimal implementation of uniform recurrences onto array processors via quadratic programming
• A unifying lattice-based approach for the partitioning of systolic arrays via LPGS and LSGP
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Synthesizing linear array algorithms from nested FOR loop algorithms
• A New Class of Parallel Algorithms for Solving Systems of Linear Equations
• Partitioned Matrix Algorithms for VLSI Arithmetic Systems
• Time optimal linear schedules for algorithms with uniform dependencies
• The Organization of Computations for Uniform Recurrence Equations

This page was built for publication: Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming