The mapping of linear recurrence equations on regular arrays | Zendy

Patrice Quinton | Zendy; Vincent Van Dongen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The mapping of linear recurrence equations on regular arrays

Author(s) -

Patrice Quinton,

Vincent Van Dongen

Publication year - 1989

Publication title -

the journal of vlsi signal processing systems for signal image and video technology

Language(s) - English

Resource type - Journals

eISSN - 1573-109X

pISSN - 0922-5773

DOI - 10.1007/bf02477176

Subject(s) - generalization , affine transformation , polyhedron , regular polygon , system of linear equations , algorithm , gauss , mathematics , linear equation , gaussian elimination , recurrence relation , space (punctuation) , computer science , mathematical optimization , mathematical analysis , combinatorics , pure mathematics , geometry , gaussian , physics , quantum mechanics , operating system

The parallelization of many algorithms can be obtained using space-time transformationswhich are applied on nested do-loops or on recurrence equations. In this paper, we analyzesystems of linear recurrence equations, a generalization of uniform recurrence equations.The first part of the paper describes a method for finding automatically whether such asystem can be scheduled by an affine timing function, independent of the size parameter ofthe algorithm. In the second part, we describe a...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research