Scheduling a system of nonsingular affine recurrence equations onto a processor array | Zendy

Yoav Yaacoby | Zendy; P. Cappello | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Scheduling a system of nonsingular affine recurrence equations onto a processor array

Author(s) -

Yoav Yaacoby,

P. Cappello

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/bf02477177

Subject(s) - affine transformation , schedule , scheduling (production processes) , invertible matrix , computation , mathematics , system of linear equations , affine coordinate system , computer science , recurrence relation , mathematical optimization , algorithm , pure mathematics , mathematical analysis , affine space , operating system

Most work on the problem of scheduling computations onto a systolic array is restricted to systems of uniform recurrence equations. In this paper, this restriction is relaxed to include systems of a‐ne recurrence equations. In this broader class, a su‐cient condition is given for the system to be com- putable. Necessary and su‐cient conditions are given for the existence of an a‐ne schedule, along with a procedure that constructs the schedule vector, when one exists. Key Words: a‐ne recurrence equation, computability, concurrent computation, data dependence,

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