Proceedings of the Second International Symposium on Parallel Symbolic Computation - PASCO '97 1997
DOI: 10.1145/266670.266697
|View full text |Cite
|
Sign up to set email alerts
|

Deriving efficient parallel programs for complex recurrences

Abstract: We propose a method to synthesize parallel divideand-conquer programs from non-trivial sequential recurrences. 'Ikaditionally, such derivation methods are based on schematic rules which attempt to match each given sequential program to a prescribed set of program schemes that have parallel counterparts. Instead of relying on specialized program schemes, we propose a new approach to parallelization based on techniques built using elementary transformation rules.Our approach requires an induction to recover para… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

1998
1998
2017
2017

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…This lay the foundation for semi-automatic programming [5,6,27]. Later, these concepts have been applied to divide-and-conquer in a disciplined way in [7,31]; these address divide-andconquer in the classical sense of [13] (Chapter 4), focusing on parallelism. In Bellmania, more focus is put on re-ordering of array reads and writes, following and mechanizing techniques related to DP from [8,9].…”
Section: Related Workmentioning
confidence: 99%
“…This lay the foundation for semi-automatic programming [5,6,27]. Later, these concepts have been applied to divide-and-conquer in a disciplined way in [7,31]; these address divide-andconquer in the classical sense of [13] (Chapter 4), focusing on parallelism. In Bellmania, more focus is put on re-ordering of array reads and writes, following and mechanizing techniques related to DP from [8,9].…”
Section: Related Workmentioning
confidence: 99%
“…They have been well researched in the context of optimizing compilers. The work in this area focused on a variety of issues (loosely categorized as follows) including detection of reductions [1,4,12,17], parallelization/scheduling strategies [9,18,22,27,28,34,35], speculative approaches [6,7,21,39], and architectural support [10]. The earlier techniques were often limited to loops in which the reduction variables and operators were fully analyzable by the compiler (even if the loop bounds were unknown).…”
Section: Related Workmentioning
confidence: 99%