A framework for automatic parallelization of sequential programs
W. Ambrus
Abstract
W. Ambrus
Abstract
With the dropping prices of multiprocessor desktop computers and high-performance clusters these systems are more and more available to the average user. Thus there is a growing need for applications that take advantage of multiprocessor systems. Automatic parallelization allows preexisting sequential programs to utilize multiple processors. Automatic parallelization requires thorough analysis of the sequential program. In this paper multiprocessor systems, and challenges of automatic parallelization are briefly covered. Also, a framework for developing and running automatic parallelization algorithms is introduced.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
With the dropping prices of multiprocessor desktop computers and high-performance clusters these systems are more and more available to the average user. Thus there is a growing need for applications that take advantage of multiprocessor systems. Automatic parallelization allows preexisting sequential programs to utilize multiple processors. Automatic parallelization requires thorough analysis of the sequential program. In this paper multiprocessor systems, and challenges of automatic parallelization are briefly covered. Also, a framework for developing and running automatic parallelization algorithms is introduced.
Key concepts: Automatic parallelization, Multiprocessing, Computer science, Parallel computing, Symmetric multiprocessor system, Programming language, Compiler