An introduction to compilation issues for parallel machines
From MaRDI portal
Publication:973430
DOI10.1007/BF00155803zbMATH Open1187.68140OpenAlexW2022867548MaRDI QIDQ973430FDOQ973430
Authors: William Carlson, Maya B. Gokhale
Publication date: 31 May 2010
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00155803
Recommendations
Cites Work
- Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling expressions on a pipelined processor with a maximal delay of one cycle
- Postpass Code Optimization of Pipeline Constraints
- Title not available (Why is that?)
- Automatic translation of FORTRAN programs to vector form
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Prime Memory System for Array Access
- Title not available (Why is that?)
Cited In (21)
- Volume driven selection of loop and data transformations for cache-coherent parallel processors
- Spectral Analysis of an Oscillating Thermoviscoelastic Plate in a Transverse Magnetic Field
- Using knowledge‐based systems for research on parallelizing compilers
- Performance aspects on high performance computers -- from microprocessors to highly parallel SMP systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Data dependence in simple and compound program pipelines
- A program auto-parallelizer based on the component technology of optimizing compiler construction
- High Performance Computing for Computational Science - VECPAR 2004
- The importance of prepass code scheduling for superscalar and superpipelined processors
- Title not available (Why is that?)
- Title not available (Why is that?)
- A theory of compaction-based parallelization
- An APL Compiler for a Vector Processor
- Parallel program analysis and restructuring by detection of point-to-point interaction patterns and their transformation into collective communication constructs
- Title not available (Why is that?)
- Compiler algorithms for optimizing locality and parallelism on shared and distributed-memory machines
- An interleaving transformation for parallelizing reductions for distributed-memory parallel machines
Uses Software
This page was built for publication: An introduction to compilation issues for parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973430)