Year: 1989
Type: conference-paper
Abstract: Previous attempts at vectorizing programs written in a sequential high level language focused on converting control dependences to data dependences using a mechanism known as IF-conversion. After IF-conversion vector optimizations are performed on a data dependence graph. However, IF-conversion is an irrevocable process which can introduce high run-time overhead if the input program is not amenable to vectorization.
DOI: 10.1145/75277.75278
Authors: W. Baxter, H. R. Bauer
Institution: University of Wyoming
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder: University of Wyoming
OpenAlex ID: W1986176500
