NDLI: Affinity-based cluster assignment for unrolled loops

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

Leveraging cache coherence in active memory systems

Critical power slope: understanding the runtime effects of frequency scaling

A deterministic fault-tolerant and deadlock-free routing protocol in 2-D meshes based on odd-even turn model

A comparative study of modulo scheduling techniques

BProc: the Beowulf distributed process space

Profile-guided post-link stride prefetching

An interleaved cache clustered VLIW processor

Compiler supported high-level abstractions for sparse disk-resident datasets

A voxel-based parallel collision detection algorithm

Can the earth simulator change the way humans think?

The architecture of the DIVA processing-in-memory chip

Latency and energy aware value prediction for high-frequency processors

A network-failure-tolerant message-passing system for terascale clusters

Affinity-based cluster assignment for unrolled loops

DualFS: a new journaling file system without meta-data duplication

Boosting trace cache performance with nonhead miss speculation

Dual path instruction processing

Computation regrouping: restructuring programs for temporal data cache locality

Parallelization and performance of 3D ultrasound imaging beamforming algorithms on modern clusters

Challenges and opportunities in autonomic computing

Heterogeneous multi-computer system: a new platform for multi-paradigm scientific simulation

Low-complexity reorder buffer architecture

Search and replication in unstructured peer-to-peer networks

Optimal software pipelining of loops with control flows

Markov model prediction of I/O requests for scientific applications

Bloom filtering cache misses for accurate data speculation and prefetching

Using predicate path information in hardware to determine true dependences

Instance-wise points-to analysis for loop-based dependence testing

Experiences tuning SMG98: a semicoarsening multigrid benchmark based on the hypre library

Clustered approaches to HPC via commodity HW + highly evolved SW

Active buffering plus compressed migration: an integrated solution to parallel simulations' data transport needs

Execution history guided instruction prefetching

Hybrid analysis: static & dynamic memory reference analysis

Near-optimal adaptive control of a large grid application

Affinity-based cluster assignment for unrolled loops

Content Provider	ACM Digital Library
Author	Stotzer, Eric J. Krishnamurthy, Gayathri Granston, Elana D.
Abstract	To compete performance-wise, modern VLIW processors must have fast clock rates and high instruction-level parallelism (ILP). Partitioning resources (functional units and registers) into clusters allows the processor to be clocked faster, but operand transfers across clusters can easily become a bottleneck. Increasing the number of functional units increases the potential ILP, but only helps if the functional units can be kept busy.To support these features, optimizations such as loop unrolling must be applied to expose ILP, and instructions must be explicitly assigned to clusters to minimize cross-cluster transfers. In an architecture with homogeneous clusters, the number of functional units of a given type is typically a multiple of the number of clusters. Thus, it is common to unroll a loop so that the number of copies of the loop body is a multiple of the number of clusters. The result is that there is a natural mapping of instructions to clusters, which is often the best mapping. While this mapping can be obvious by inspection, we have found that existing cluster assignment algorithms often miss this natural split. The consequence is an excessive number of inter-cluster transfers, which slows down the loop.Because we were unable to find an existing cluster-assignment algorithm that performed well for unrolled loops, we developed our own. Our Affinity-Based Clustering (ABC) algorithm has been implemented in a production compiler for the Texas Instruments TMS320C6000, a two-cluster VLIW architecture. It is tailored for exploiting the patterns that result from either manual or compiler-based unrolling. As demonstrated experimentally, it performs well, even when post-unrolling optimizations partially obscure the natural split.
Starting Page	107
Ending Page	116
Page Count	10
File Format	PDF
ISBN	1581134835
DOI	10.1145/514191.514209
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2002-06-22
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Cluster assignment Vliw architectures Affinity-based clustering (abc) algorithms Loop unrolling Loop scheduling Partitioned register files Loop optimizations Homogeneous clusters Software pipelining
Content Type	Text
Resource Type	Article

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

Unrolling-based optimizations for modulo scheduling

Partitioned Schedules for Clustered VLIW Architectures (1998)

Using Value Cloning to Improve Code Generation for Software Pipelined Loops on Vliw Architectures with Partitioned Register Files

CAeSaR: Unified cluster-assignment scheduling and communication reuse for clustered VLIW processors

Enabling compiler flow for embedded VLIW DSP processors with distributed register files

Loop-carried dependence and the general URPR software pipelining approach (unrolling, pipelining and rerolling)

Unrolling-based optimizations for modulo scheduling.

Unified cluster assignment and instruction scheduling for clustered vliw microarchitectures.

Using value cloning to improve code generation for software pipelined loops on vliw architectures with partitioned register files (1998).

Affinity-based cluster assignment for unrolled loops

Similar Documents

Unrolling-based optimizations for modulo scheduling

Partitioned Schedules for Clustered VLIW Architectures (1998)

Using Value Cloning to Improve Code Generation for Software Pipelined Loops on Vliw Architectures with Partitioned Register Files

CAeSaR: Unified cluster-assignment scheduling and communication reuse for clustered VLIW processors

Enabling compiler flow for embedded VLIW DSP processors with distributed register files

Loop-carried dependence and the general URPR software pipelining approach (unrolling, pipelining and rerolling)

Unrolling-based optimizations for modulo scheduling.

Unified cluster assignment and instruction scheduling for clustered vliw microarchitectures.

Using value cloning to improve code generation for software pipelined loops on vliw architectures with partitioned register files (1998).

Affinity-based cluster assignment for unrolled loops