Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Karrenberg, Ralf
Košta, Marek
Sturm, Thomas

dblp
dblp
dblp

Not MPG Author(s):

Karrenberg, Ralf

Editor(s):

Pascal Fontaine
Christophe Ringeissen
Renate A. Schmidt

dblp
dblp
dblp

Not MPII Editor(s):

Pascal Fontaine
Christophe Ringeissen
Renate A. Schmidt

BibTeX cite key*:

KarrenbergKostaSturm2013

Title, Booktitle

Title*:

Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages

Booktitle*:

Frontiers of Combining Systems

Event, URLs

URL of the conference:

http://frocos2013.loria.fr/

URL for downloading the paper:

http://link.springer.com/chapter/10.1007/978-3-642-40885-4_5

Event Address*:

Nancy, France

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

18 September 2013

Event End Date:

20 September 2013

Publisher

Name*:

Springer

URL:

http://www.springer.com/

Address*:

Berlin

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Artificial Intelligence

Volume:

8152

Number:


Month:

September

Pages:

56-70

Year*:

2013

VG Wort Pages:


ISBN/ISSN:

978-3-642-40884-7

Sequence Number:


DOI:

10.1007/978-3-642-40885-4_5



Note, Abstract, ©


(LaTeX) 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.

URL for the Abstract:

http://link.springer.com/chapter/10.1007/978-3-642-40885-4_5



Download
Access Level:

Internal

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Automation of Logic

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{KarrenbergKostaSturm2013,
AUTHOR = {Karrenberg, Ralf and Košta, Marek and Sturm, Thomas},
EDITOR = {Pascal Fontaine and Christophe Ringeissen and Renate A. Schmidt},
TITLE = {Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages},
BOOKTITLE = {Frontiers of Combining Systems},
PUBLISHER = {Springer},
YEAR = {2013},
VOLUME = {8152},
PAGES = {56--70},
SERIES = {Lecture Notes in Artificial Intelligence},
ADDRESS = {Nancy, France},
MONTH = {September},
ISBN = {978-3-642-40884-7},
DOI = {10.1007/978-3-642-40885-4_5},
}


Entry last modified by Marek Kosta, 03/26/2014
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
01/24/2014 09:44:52 AM
Revision
0.



Editor
Marek Kosta



Edit Date
01/24/2014 09:44:52 AM