Compiling techniques for first-order linear recurrences on a vector computer

✍ Scribed by Yoshikazu Tanaka; Kyouko Iwasawa; Yukio Umetani; Shizuo Gotou

• Publisher: Springer US
• Year: 1990
• Tongue: English
• Weight: 703 KB
• Volume: 4
• Category: Article
• ISSN: 0920-8542
• DOI: 10.1007/bf00162343

✦ Synopsis

Linear recurrences arc the most important class of nonvectorizable problems in typical scientific/engineering calculations. This work discusses high-performance methods for solving first-order linear recurrences on a vector computer, investigates automatic transformations, and develops compiling techniques for first-order linear recurrence problems. The results show that the improved vector code generated by the vectorizing compiler on the HITAC S-820 supercomputer runs at the rote of 150 MFLOPS (million floating operations per second) for moderate loop lengths (>1000) and over 200 MFLOPS for long loop lengths (>10000). Also, overall performance improvements of 69% in the 14 Lawrence Livermore Loops and 25% in the 24 Lawrence Livermore Loops, as measured by the harmonic mean, are attained.