By Topic

Parallelizing sequential programs by algorithm-level transformations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bhansali, S. ; Sch. of Electr. Eng., Washington State Univ., Pullman, WA, USA ; Hagemeister, J.R. ; Raghavendra, C.S. ; Sivaraman, H.

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

Published in:

Program Comprehension, 1994. Proceedings., IEEE Third Workshop on

Date of Conference:

14-15 Nov 1994