Sciweavers

779 search results - page 1 / 156
» A Simple Program Transformation for Parallelism
Sort
View
SLP
1994
118views more  SLP 1994»
13 years 6 months ago
A Simple Program Transformation for Parallelism
Most of the research, to date, on optimizing program transformations for declarative languages has focused on sequential execution strategies. In this paper, we consider a class o...
Saumya K. Debray, Mudita Jain
APLAS
2005
ACM
13 years 10 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
IWFM
1998
117views Formal Methods» more  IWFM 1998»
13 years 6 months ago
A Case Study on Proving Transformations Correct: Data-Parallel Conversion
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
Stephen Kilpatrick, Maurice Clint, Peter Kilpatric...
ACSC
2005
IEEE
13 years 10 months ago
Optimising Parallel Pattern-matching by Source-level Program Transformation
Parallel pattern-matching (PPM) provides true commutative implementation of functions defined by cases in functional languages, because no argument is given precedence over any o...
R. Lyndon While, Tony Field
PARLE
1993
13 years 9 months ago
A Parallel Programming Style and Its Algebra of Programs
Abstract. We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The prim...
Chris Hankin, Daniel Le Métayer, David Sand...