Synthesis aspects in the design of efficient processor arrays from affine recurrence equations

DOI10.1016/S0747-7171(06)80005-2zbMath0804.68011MaRDI QIDQ1322844

Catherine Mongenet, Philippe Clauss

Publication date: 22 January 1995

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

schedulingCholesky factorizationspace-time mappingcompilingaffine recurrence equationsprocessor arrays

Mathematics Subject Classification ID

Factorization of matrices (15A23) Theory of compilers and interpreters (68N20) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Synthesis of a new systolic architecture for the algebraic path problem
• Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• The mapping of linear recurrence equations on regular arrays
• The Organization of Computations for Uniform Recurrence Equations
• A New Version of the Euclidean Algorith
• Scheduling a system of nonsingular affine recurrence equations onto a processor array

This page was built for publication: Synthesis aspects in the design of efficient processor arrays from affine recurrence equations