Saved in:
Bibliographic Details
Main Authors: Takuna, Uemura, Sumikawa, Yasunobu
Format: Recurso digital
Language:
Published: Zenodo 2024
Online Access:https://doi.org/10.5281/zenodo.13363792
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • <p>This repository contains the implementation programs for the compiler code optimization technique known as profile-guided demand-driven partial redundancy elimination (PDPRE). These programs are used as SSA optimization methods within the COINS compiler.</p> <p> </p> <p>A brief description of each file is as follows:</p> <ul> <li><strong>Lattice.java</strong> performs operations on a lattice, which defines the answer space for queries related to redundancy analysis.</li> <li><strong>GVN.java</strong> executes the global value numbering (GVN) code optimization technique.</li> <li><strong>PDPRE.java</strong> executes the PDPRE optimization technique.</li> <li><strong>ssa-external-spec.pdf</strong> contains documentation related to the COINS compiler's SSA optimization methods, including those relevant to PDPRE. The texts are written in Japanese only.</li> <li><strong>coins-1.5-en.jar</strong> contains all programs of the COINS compiler.</li> </ul> <p> </p> <p>Related papers:</p> <ol> <li>Yasunobu Sumikawa and Munehiro Takimoto, <a href="https://ipsj.ixsq.nii.ac.jp/ej/index.php?active_action=repository_view_main_item_detail&page_id=13&block_id=8&item_id=94939&item_no=1">Effective Demand-driven Partial Redundancy Elimination</a>, IPSJ Trans. Programming, Vol.6, No.2, pp. 33-44, 2013.</li> <li>Yuya Yanase and Yasunobu Sumikawa, <a href="https://www.jstage.jst.go.jp/article/ipsjjip/31/0/31_459/_article">Lazy Demand-driven Partial Redundancy Elimination</a>, Journal of Information Processing, Vol. 31, pp. 459-468, 2023.</li> <li>Takuna Uemura and Yasunobu Sumikawa, <a href="https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_198/_article/-char/ja">Demand-driven PRE using Profile Information</a>, Journal of Information Processing, Vol. 66, No. 3, pp. 198-209, 2025.</li> </ol>