Constructing and exploiting linear schedules with prescribed parallelism

• Published in: ACM transactions on design automation of electronic systems 2002-01, Vol.7 (1), p.159-172
• Main Authors: Darte, Alain, Schreiber, Robert, Rau, B. Ramakrishna, Vivien, Frédéric
• Format: Article
• Language: English
• Subjects: Computer Science; Data Structures and Algorithms; Distributed, Parallel, and Cluster Computing
• ISSN: 1084-4309; 1557-7309
• DOI: 10.1145/504914.504921

We present two new results of importance in code generation for and synthesis of synchronously scheduled parallel processor arrays and multicluster VLIWs. The first is a new practical method for constructing a linear schedule for the iterations of a loop nest that schedules precisely one iteration per cycle on each of a prescribed set of processors. While this problem goes back to the era in which systolic computation was in vogue, it has defied practical solution until now. We provide a closed form solution that enables the enumeration of all such schedules. The second result is a new technique that reduces the cost of code or hardware whose function is to control the flow of data and predicate operations, and to generate memory addresses. The key idea is that by using the mathematical structure of any of the conflict-free schedules we construct, a very shallow recurrence can be developed to inexpensively update these quantities.