DocumentCode :
2242486
Title :
Parallelizing sequential programs by algorithm-level transformations
Author :
Bhansali, S. ; Hagemeister, J.R. ; Raghavendra, C.S. ; Sivaraman, H.
Author_Institution :
Sch. of Electr. Eng., Washington State Univ., Pullman, WA, USA
fYear :
1994
fDate :
14-15 Nov 1994
Firstpage :
100
Lastpage :
107
Abstract :
We address a significant problem in parallel processing research, namely, how to port existing sequential programs to run efficiently on parallel machines (the “dusty deck” problem). Conventional domain-independent techniques are inadequate for solving this problem because they miss significant opportunities of parallelism. We present experimental evidence to support our claim, analyze why current techniques are inadequate, and propose a knowledge-based reverse engineering approach for attacking this problem
Keywords :
parallel programming; reverse engineering; software portability; domain-independent techniques; dusty deck problem; knowledge-based reverse engineering; parallel machines; parallel processing; reverse engineering; sequential programs; Application software; Biochemical analysis; Computer aided manufacturing; Computer science; Computer vision; Concurrent computing; Parallel machines; Parallel processing; Physics computing; Reverse engineering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Program Comprehension, 1994. Proceedings., IEEE Third Workshop on
Conference_Location :
Washington, DC
ISSN :
1092-8138
Print_ISBN :
0-8186-5647-6
Type :
conf
DOI :
10.1109/WPC.1994.341257
Filename :
341257
Link To Document :
بازگشت