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 uniform loop nests onto distributed memory architectures

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

DOI10.1016/0167-8191(94)90001-9zbMath0805.68019OpenAlexW2037978818MaRDI QIDQ1323636

Alain Darte, Yves Robert

Publication date: 1 June 1994

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

Full work available at URL: https://doi.org/10.1016/0167-8191(94)90001-9


zbMATH Keywords

mappingpartitioningschedulingarray alignmentautomatic parallelizationloop transformationsdistributed-memory machinesuniform loop nests


Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)


Related Items

Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies ⋮ A consistent generation of pipeline parallelism and distribution of operations and data among processors ⋮ Some efficient solutions to the affine scheduling problem. I: One- dimensional time ⋮ Geometrical tools to map systems of affine recurrence equations on regular arrays



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1323636&oldid=13445116"
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 13:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki