English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Presburger Arithmetic in Memory Access Optimization for Data-parallel Languages

Karrenberg, R., Košta, M., & Sturm, T. (2013). Presburger Arithmetic in Memory Access Optimization for Data-parallel Languages. In P. Fontaine, C. Ringeissen, & R. A. Schmidt (Eds.), Frontiers of Combining Systems (pp. 56-70). Berlin: Springer. doi:10.1007/978-3-642-40885-4_5.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0015-7A11-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-921B-7
Genre: Conference Paper

Files

show Files
hide Files
:
frocos-paper.pdf (Any fulltext), 592KB
 
File Permalink:
-
Name:
frocos-paper.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Karrenberg, Ralf1, Author
Košta, Marek2, Author           
Sturm, Thomas2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              

Content

show
hide
Free keywords: -
 Abstract: Data-parallel languages like OpenCL and CUDA are an important means to exploit the computational power of today's computing devices. We consider the compilation of such languages for CPUs with SIMD instruction sets. To generate efficient code, one wants to statically decide whether or not certain memory operations access consecutive addresses. We formalize the notion of consecutivity and algorithmically reduce the static decision to satisfiability problems in Presburger Arithmetic. We introduce a preprocessing technique on these SMT problems, which makes it feasible to apply an off-the-shelf SMT solver. We show that a prototypical OpenCL CPU driver based on our approach generates more efficient code than any other state-of-the-art driver.

Details

show
hide
Language(s): eng - English
 Dates: 2013-092013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: Other: Local-ID: 19E92F4A98DEF6D4C1257C6A00300DB4-KarrenbergKostaSturm2013
DOI: 10.1007/978-3-642-40885-4_5
BibTex Citekey: KarrenbergKostaSturm2013
 Degree: -

Event

show
hide
Title: 9th International Symposium on Frontiers of Combining Systems
Place of Event: Nancy, France
Start-/End Date: 2013-09-18 - 2013-09-20

Legal Case

show

Project information

show

Source 1

show
hide
Title: Frontiers of Combining Systems
  Abbreviation : FroCoS 2013
  Subtitle : 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings
Source Genre: Proceedings
 Creator(s):
Fontaine, Pascal1, Editor
Ringeissen, Christophe1, Editor
Schmidt, Renate A.1, Editor           
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 56 - 70 Identifier: ISBN: 978-3-642-40884-7

Source 2

show
hide
Title: Lecture Notes in Artificial Intelligence
  Abbreviation : LNAI
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 8152 Sequence Number: - Start / End Page: - Identifier: ISSN: 0302-9743