Two program comprehension tools for automatic parallelization

The authors compare two program-comprehension systems targeted to support automatic parallelization: PARAMAT (PARAllelization by pattern MATching) and the PAP (Parallelizable Algorithmic Patterns) Recognizer. The authors illuminate the main differences of each method, discussing the tradeoff between...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE concurrency Jg. 8; H. 1; S. 37 - 47
Hauptverfasser: Di Martino, B., Kessler, C.W.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.01.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithm design and analysis
Algorithms
Automatic control
Computation
Computer programs
Concurrency
Libraries
Linear algebra
Matching
Microwave integrated circuits
Parallel algorithms
Parallel processing
Partial differential equations
Pattern recognition
Program processors
Recognition
Runtime
ISSN:1092-3063, 1558-0849
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The authors compare two program-comprehension systems targeted to support automatic parallelization: PARAMAT (PARAllelization by pattern MATching) and the PAP (Parallelizable Algorithmic Patterns) Recognizer. The authors illuminate the main differences of each method, discussing the tradeoff between the speed of the first and the generality of the second.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1092-3063
1558-0849
DOI:10.1109/4434.824311