Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Mapping affine loop nests

From MaRDI portal
Publication:1350129
Jump to:navigation, search

DOI10.1016/S0167-8191(96)00049-XzbMath0875.68187OpenAlexW2082600973WikidataQ126382635 ScholiaQ126382635MaRDI QIDQ1350129

Yves Robert, Michèle Dion

Publication date: 27 February 1997

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(96)00049-x


zbMATH Keywords

HeuristicsDistributed memory multiprocessorsCommunication graphsAffine mapping problemLoop nests


Mathematics Subject Classification ID

Computer system organization (68M99)


Related Items (6)

Optimization of data exchange in parallel computers with distributed memory ⋮ Sufficient conditions for the determination and use of data in the same granular parallel computation process ⋮ Parallelization of sequential programs: distribution of arrays among processors and structurization of communications ⋮ A consistent generation of pipeline parallelism and distribution of operations and data among processors ⋮ Quantifier elimination in automatic loop parallelization ⋮ Automatic array partitioning based on the Smith normal form




This page was built for publication: Mapping affine loop nests

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1350129&oldid=13484903"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki