Amanote Research

Amanote Research

    RegisterSign In

Communication-Minimal Partitioning and Data Alignment for Affine Nested Loops

Computer Journal - United Kingdom
doi 10.1093/comjnl/40.6.302
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer Science
Date

June 1, 1997

Authors
H.-J. Lee
Publisher

Oxford University Press (OUP)


Related search

Composable, Sound Transformations of Nested Recursion and Loops

2019English

Automatic Mapping of Nested Loops to FPGAS

2007English

Data-Only Flattening for Nested Data Parallelism

ACM SIGPLAN Notices
Computer Science
2013English

Pipelining-Dovetailing: A Transformation to Enhance Software Pipelining for Nested Loops

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

On the Optimality of Allen and Kennedy's Algorithm for Parallelism Extraction in Nested Loops

Parallel Algorithms and Applications
1997English

Generalising the Unimodular Approach to Restructure Imperfectly Nested Loops

Parallel Processing Letters
HardwareTheoretical Computer ScienceArchitectureSoftware
1996English

Exploiting Vectorization in High Level Synthesis of Nested Irregular Loops

Journal of Systems Architecture
HardwareArchitectureSoftware
2017English

DNestMap: Mapping Deeply-Nested Loops on Ultra-Low Power CGRAs

2018English

Partitioning and Communication Strategies for Sparse Non-Negative Matrix Factorization

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy