liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Extending smart containers for data locality-aware skeleton programming
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-5241-0026
2019 (English)In: Concurrency and Computation, ISSN 1532-0626, E-ISSN 1532-0634, Vol. 31, no 5, article id e5003Article in journal (Refereed) Published
Abstract [en]

We present an extension for the SkePU skeleton programming framework to improve the performance of sequences of transformations on smart containers. By using lazy evaluation, SkePU records skeleton invocations and dependencies as directed by smart container operands. When a partial result is required by a different part of the program, the run-time system will process the entire lineage of skeleton invocations; tiling is applied to keep chunks of container data in the working set for the whole sequence of transformations. The approach is inspired by big data frameworks operating on large clusters where good data locality is crucial. We also consider benefits other than data locality with the increased run-time information given by the lineage structures, such as backend selection for heterogeneous systems. Experimental evaluation of example applications shows potential for performance improvements due to better cache utilization, as long as the overhead of lineage construction and management is kept low.

Place, publisher, year, edition, pages
WILEY , 2019. Vol. 31, no 5, article id e5003
Keywords [en]
lazy evaluation; loop tiling; skeleton programming; SkePU; smart containers
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-154530DOI: 10.1002/cpe.5003ISI: 000457796200005OAI: oai:DiVA.org:liu-154530DiVA, id: diva2:1290544
Conference
10th International Symposium on High-Level Parallel Programming and Applications (HLPP)
Note

Funding Agencies|Swedish e-Science Research Centre; Swedish National Graduate School in Computer Science

Available from: 2019-02-20 Created: 2019-02-20 Last updated: 2019-02-20

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Ernstsson, AugustKessler, Christoph
By organisation
Software and SystemsFaculty of Science & Engineering
In the same journal
Concurrency and Computation
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 16 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf