Algorithmic concept recognition support for skeleton based parallel programming

Parallel skeletons have been proposed as a possible programming model for parallel architectures. One of the problems with this approach is the choice of the skeleton which is best suited to the characteristics of the algorithm/program to be developed/parallelized, and of the target architecture, in...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings International Parallel and Distributed Processing Symposium p. 10 pp.
Main Author: Di Martino, B.
Format: Conference Proceeding
Language:English
Published: IEEE 2003
Subjects:
Character generation
Concrete
Concurrent computing
Distributed processing
Government
ISDN
Parallel architectures
Parallel programming
Personal communication networks
Skeleton
ISBN:0769519261, 9780769519265
ISSN:1530-2075
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Parallel skeletons have been proposed as a possible programming model for parallel architectures. One of the problems with this approach is the choice of the skeleton which is best suited to the characteristics of the algorithm/program to be developed/parallelized, and of the target architecture, in terms of performance of the parallel implementation. Another problem arising with parallelization of legacy codes is the attempt to minimize the effort needed for program comprehension, and thus to achieve the minimum restructuring of the sequential code when producing the parallel version. In this paper we propose automated program comprehension at the algorithmic level as a driving feature in the task of selection of the proper parallel skeleton, best suited to the characteristics of the algorithm/program and of the target architecture. Algorithmic concept recognition can automate or support the generation of parallel code through instantiation of the selected parallel skeleton(s) with template based transformations of recognized code segments.
ISBN:0769519261
9780769519265
ISSN:1530-2075
DOI:10.1109/IPDPS.2003.1213256