Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages

2013 ◽  
pp. 56-70
Author(s):  
Ralf Karrenberg ◽  
Marek Košta ◽  
Thomas Sturm
Keyword(s):  
Memory Access ◽  
Presburger Arithmetic ◽  
Data Parallel ◽  
Parallel Languages

scholarly journals Opus: A Coordination Language for Multidisciplinary Applications

1997 ◽  
Vol 6 (4) ◽  
pp. 345-362 ◽  
Author(s):  
Barbara Chapman ◽  
Matthew Haines ◽  
Piyush Mehrotra ◽  
Hans Zima ◽  
John Van Rosendale
Keyword(s):  
High Performance ◽  
Data Repository ◽  
Task Parallelism ◽  
Central Concept ◽  
Coordination Language ◽  
Data Parallel ◽  
High Performance Fortran ◽  
Parallel Languages ◽  
Wide Range ◽  
And Task

Data parallel languages, such as High Performance Fortran, can be successfully applied to a wide range of numerical applications.However, many advanced scientific and engineering applications are multidisciplinary and heterogeneous in nature, and thus do not fit well into the data parallel paradigm. In this paper we present Opus, a language designed to fill this gap. The central concept of Opus is a mechanism called ShareD Abstractions (SDA). An SDA can be used as a computation server, i.e., a locus of computational activity, or as a data repository for sharing data between asynchronous tasks. SDAs can be internally data parallel, providing support for the integration of data and task parallelism as well as nested task parallelism. They can thus be used to express multidisciplinary applications in a natural and efficient way. In this paper we describe the features of the language through a series of examples and give an overview of the runtime support required to implement these concepts in parallel and distributed environments.

A formal approach to the compilation of data-parallel languages

1995 ◽  
pp. 155-169
Author(s):  
J. A. Trescher ◽  
L. C. Breebaart ◽  
P. F. G. Dechering ◽  
A. B. Poelman ◽  
J. P. M. de Vreught ◽  
...  
Keyword(s):  
Formal Approach ◽  
Data Parallel ◽  
Parallel Languages

scholarly journals Supporting irregular distributions using data-parallel languages

1995 ◽  
Vol 3 (1) ◽  
pp. 12-24 ◽  
Author(s):  
R. Ponnusamy ◽  
Yuan-Shin Hwang ◽  
R. Das ◽  
J.H. Saltz ◽  
A. Choudhary ◽  
...  
Keyword(s):  
Data Parallel ◽  
Parallel Languages ◽  
Using Data

DENOTATIONAL SEMANTICS OF AN HPF-LIKE DATA-PARALLEL LANGUAGE MODEL

2001 ◽  
Vol 11 (02n03) ◽  
pp. 363-374 ◽  
Author(s):  
MINYI GUO
Keyword(s):  
Programming Language ◽  
Language Model ◽  
Denotational Semantics ◽  
Semantic Model ◽  
Denotational Semantic ◽  
Parallel Language ◽  
Data Parallel ◽  
Data Alignment ◽  
Parallel Languages ◽  
Simple Language

It is important for programmers to understand the semantics of a programming language. However, little work has been done about the semantic descriptions of HPF-like data-parallel languages. In this paper, we first define a simple language [Formula: see text], which includes the principal facilities of a data-parallel language such as HPF. Then we present a denotational semantic model of [Formula: see text]. It is useful for understanding the components of an HPF-like language, such as data alignment and distribution directives, forall data-parallel statements.

A linear-time algorithm for computing the memory access sequence in data-parallel programs

1995 ◽  
Vol 30 (8) ◽  
pp. 102-111 ◽  
Author(s):  
Ken Kennedy ◽  
Nenad Nedeljkovic ◽  
Ajay Sethi
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Parallel Programs ◽  
Memory Access ◽  
Linear Time Algorithm ◽  
Data Parallel
Sign in / Sign up

Export Citation Format

Share Document