NDLI: Author retrospective for code scheduling and register allocation in large basic blocks

Please wait, while we are loading the content...

Author retrospective for PTRAN's analysis and optimization techniques

Strategies for cache and local memory management by global program transformation

Author retrospective for code scheduling and register allocation in large basic blocks

An overview of the PTRAN analysis system for multiprocessing

Author retrospective for array expansion, array shrinking, or there and back again

Analysis of interprocedural side effects in a parallel programming environment

Author retrospective for a global resource-constrained parallelization technique

Code scheduling and register allocation in large basic blocks

Author retrospective for compiler-directed data prefetching in multiprocessors with memory hierarchies

Array expansion

Author retrospective for semantical interprocedural parallelization: an overview of the PIPS project

A global resource-constrained parallelization technique

Author retrospective for optimizing for parallelism and data locality

The Tera computer system

Author retrospective for PYRROS: static task scheduling and code generation for message passing multiprocessors

Compiler-directed data prefetching in multiprocessors with memory hierarchies

Author's retrospective for array privatization for parallel execution of loops

Semantical interprocedural parallelization: an overview of the PIPS project

Author retrospective for increasing the instruction fetch rate via multiple branch prediction and a branch address cache

Optimizing for parallelism and data locality

Author retrospective for anatomy of a message in the alewife multiprocessor

PYRROS: static task scheduling and code generation for message passing multiprocessors

Author retrospective: compilation techniques for block-cyclic distributions

Array privatization for parallel execution of loops

Author retrospective for the dual data cache

Increasing the instruction fetch rate via multiple branch prediction and a branch address cache

Author retrospective for optimum modulo schedules for minimum register requirements

Anatomy of a message in the Alewife multiprocessor

Author retrospective for counting solutions to linear and nonlinear constraints through ehrhart polynomials: applications to analyze and transform scientific programs

Compilation techniques for block-cyclic distributions

Author retrospective improving data cache performance by pre-executing instructions under a cache miss

A data cache with multiple caching strategies tuned to different types of locality

Author retrospective for optimizing matrix multiply using PHiPAC: a portable high-performance ANSI C coding methodology

Optimum modulo schedules for minimum register requirements

Author retrospective for software trace cache

Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs

Author retrospective of Dynamic application scheduling using on-line analytics: then and now

Improving data cache performance by pre-executing instructions under a cache miss

Author's retrospective for: improving the performance of speculatively parallel applications on the hydra CMP

Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology

Author retrospective for characterizing processor architectures for programmable network interfaces

Software trace cache

Author retrospective for synthesizing transformations for locality enhancement of imperfectly-nested loop nests

Application level scheduling of gene sequence comparison on metacomputers

Author retrospective for adaptive reduction parallelization techniques

Improving the performance of speculatively parallel applications on the Hydra CMP

Author retrospective for analytical cache models with applications to cache partitioning

Characterizing processor architectures for programmable network interfaces

Author retrospective for search and replication in unstructured peer-to-peer networks

Synthesizing transformations for locality enhancement of imperfectly-nested loop nests

Author retrospective for bloom filtering cache misses for accurate data speculation and prefetching

Adaptive reduction parallelization techniques

Author retrospective AEGIS: architecture for tamper-evident and tamper-resistant processing

Analytical cache models with applications to cache partitioning

Author retrospective on energy conservation techniques for disk array-based servers

Search and replication in unstructured peer-to-peer networks

Author retrospective for a NUCA substrate for flexible CMP cache sharing

Bloom filtering cache misses for accurate data speculation and prefetching

Author retrospective for design tradeoffs for tiled CMP on-chip networks

AEGIS: architecture for tamper-evident and tamper-resistant processing

Author retrospective for cooperative cache partitioning for chip multiprocessors

Energy conservation techniques for disk array-based servers

Author's retrospective for biomedical image analysis on a cooperative cluster of gpus and multicores

A NUCA substrate for flexible CMP cache sharing

Design tradeoffs for tiled CMP on-chip networks

Cooperative cache partitioning for chip multiprocessors

Biomedical image analysis on a cooperative cluster of GPUs and multicores

Author retrospective for code scheduling and register allocation in large basic blocks

Content Provider	ACM Digital Library
Author	Hsu, Wei Chung Goodman, James R.
Abstract	In 1987 we were working at the University of Wisconsin-Madison with Jim Smith, J. T. Hsieh, Koujuch Liou and Andrew Pleszkun on PIPE [4], an unorthodox 'decoupled access-execute processor.' The driving innovation of PIPE was the separation of instructions dealing with memory through a separate and independent instruction stream racing ahead, initiating load and store instructions in-order, synchronized only with other instructions through architectural queues. The queues eliminated the need for allocating and managing temporary registers. While the problems of register allocation and instruction scheduling were traditionally treated independently, the genesis of this paper came while developing an optimizing compiler for PIPE, with the insight that in a conventional architecture these two closely related problems have conflicting goals that could be played off against each other to maximize benefit: Code scheduling uses as many temporary registers as possible to achieve a higher level of instruction-level parallelism (ILP), while register allocation minimizes the use of temporary registers so that more data items could be allocated to the available registers. As we gained more experience in optimizing for parallel programs, we came to understand that such conflicting goals were commonplace in the trade-off between parallelism and locality [2]. This work introduced the concept of the DAG-driven register allocation. We defined two terms, width and height of a DAG, in the context of code scheduling. The width of a DAG is the maximal number of mutually independent nodes requiring a destination (i.e. target) register and the height of a DAG is the length of its critical path. The shape of the DAG can be changed due to register allocation. For example, while the width can be reduced by reusing registers, the height could be increased. The purpose of DAG-driven register allocation is to minimize the height while keeping the width smaller than the number of available registers.
Starting Page	4
Ending Page	5
Page Count	2
File Format	PDF
ISBN	9781450328401
DOI	10.1145/2591635.2591640
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-06-10
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in