License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07361.5
URN: urn:nbn:de:0030-drops-13748
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1374/
|
Go to the corresponding Portal |
Größlinger, Armin
Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures
Abstract
The model-based transformation of loop programs is a way of
detecting fine-grained parallelism in sequential programs. One of
the challenges is to agglomerate the parallelism to a coarser grain,
in order to map the operations of the program to the available cores
in a multicore architecture. We consider shared-memory multicores as
target architecture for space-time mapped loop programs and make
some observations concerning code generation, load balancing and
cache effects.
BibTeX - Entry
@InProceedings{grolinger:DagSemProc.07361.5,
author = {Gr\"{o}{\ss}linger, Armin},
title = {{Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures}},
booktitle = {Programming Models for Ubiquitous Parallelism},
pages = {1--12},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2008},
volume = {7361},
editor = {Albert Cohen and Mar{\'\i}a J. Garzar\'{a}n and Christian Lengauer and Samuel P. Midkiff},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2008/1374},
URN = {urn:nbn:de:0030-drops-13748},
doi = {10.4230/DagSemProc.07361.5},
annote = {Keywords: Multicore, automatic parallelization, loop transformations, polyhedron model}
}
|
Keywords: |
|
Multicore, automatic parallelization, loop transformations, polyhedron model |
|
Collection: |
|
07361 - Programming Models for Ubiquitous Parallelism |
|
Issue Date: |
|
2008 |
|
Date of publication: |
|
06.02.2008 |
