GTS: parallelization and vectorization of tight recurrences
Eduard Ayguadé, Jesús Labarta, Jordi Torres, Patricia Borensztejn · 1989
In this paper we present a new method for extracting the maximum parallelism or vector operations out of DO loops with tight recurrences using sequential programming languages. We have named the method Graph Traverse Scheduling (GTS). It is devised to produce code for shared memory multiprocessors or vector machines. When parallelizing, hardware support for fast synchronization is assumed.