GTS: Extracting full parallelism out of DO loops
Si trova su / Altri legami
In this paper we present a new method for extracting the maximum parallelism out of DO loops with tight recurrences in a sequential programming language. We have named the method Graph Traverse Scheduling (GTS). It is devised for producing code for shared memory multiprocessors. Hardware support for fast synchronization is assumed
| # | Istituto/Sede | Collocazione | Inventario patrimoniale |
|---|---|---|---|
| Area della ricerca di Genova, Servizio di Documentazione Scientifica | Sede di Genova |
