Work

Dynamic program parallelization

Year: 1992

Type: conference-paper

Abstract: Static program analysis limits the performance improvements possible from compile-time parallelization. Dynamic program parallelization shifts a portion of the analysis from complie-time to run-time, thereby enabling optimizations whose static detection is overly expensive or impossible. Lambda tagging and heap resolution are two new techniques for finding loop and non-loop parallelism in imperative, sequential languages with first-class procedures and destructive heap operations (e.g., ML and Scheme).

Source: ACM Conference on LISP and Functional Programming (LFP)

DOI: 10.1145/141471.141567

Authors: Lorenz Huelsbergen, James R. Larus

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2033571435

FWCI: 2.096

Cites: 23

Cited by: 13

Related to: 10