Mapping of affine loop nests onto independent processors
From MaRDI portal
Publication:2487903
DOI10.1023/A:1025773814022zbMATH Open1100.68538MaRDI QIDQ2487903FDOQ2487903
Authors: N. A. Likhoded
Publication date: 12 August 2005
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Recommendations
Cited In (12)
- Title not available (Why is that?)
- Three mapping loop strategies for the upper diagonal matrix-vector product
- Optimization of data exchange in parallel computers with distributed memory
- A consistent generation of pipeline parallelism and distribution of operations and data among processors
- Sufficient conditions for the determination and use of data in the same granular parallel computation process
- Title not available (Why is that?)
- Obtaining affine transformations to improve locality of loop nests
- Mapping loop nests to multipipelined architecture
- Title not available (Why is that?)
- An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays
- Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
- Efficient implementation of nested-loop multimedia algorithms
This page was built for publication: Mapping of affine loop nests onto independent processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487903)