scientific article; zbMATH DE number 2079652

MaRDI QIDQ4471687zbMATH OpenFDO

Authors Patrice Quinton, Tanguy Risset

Publication date 30 July 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2268/22680112.htm

zbMATH Keywords

automatic synthesis of parallel architecturesparallel VLSI architecturesparallelization of loop nestsschedulingstructured recurrence equations

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS
• Scheduling a system of nonsingular affine recurrence equations onto a processor array
• Scalable and structured scheduling
• Parallel scheduling of recursively defined arrays: Revisited

Cited in

(8)

• Parallel scheduling of recursively defined arrays
• Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques
• LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS
• Scheduling recurrent construction
• Scheduling a system of nonsingular affine recurrence equations onto a processor array
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Scalable and structured scheduling
• Mathematical model for scheduling operations in cascaded continuous processing units

Describes a project that uses

Uses Software

• LUSTRE
• Alpha

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471687)