Work

Code Optimizations for Parallelization of Programs using Data Dependence Identifier

Year: 2021

Type: article

Abstract: In a Parallelizing Compiler, code transformations help to reduce the data dependencies and identify parallelism in a code. In our earlier paper, we proposed a model Data Dependence Identifier (DDI), in which a program P is represented as graph GP . Using 􀀀􀀀 , we could identify data dependencies in a program and also perform transformations like dead code elimination and constant propagation. In this paper, we present algorithms for loop invariant code motion, live range analysis, node splitting and loop fusion code transformations using DDI in polynomial time.

Source: International Journal of Advanced Computer Science and Applications

DOI: 10.14569/ijacsa.2021.0121093

Authors: Kavya Alluru, Jeganathan L

Institution: Vellore Institute of Technology University

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W3210159238

FWCI: 0.157

Cites: 14

Cited by: 1

Related to: 10