Exploiting parallelism across program execution; A unification technique and its analysis

Journal Article · Mon Oct 01 04:00:00 EDT 1990 · IEEE Transactions on Parallel and Distributed Systems; (USA)

DOI:https://doi.org/10.1109/71.80170· OSTI ID:6502479

Rego, V J; Mathur, A P ^[1]

---

1. Purdue Univ., Lafayette, IN (USA). Dept. of Computer Science

This paper describes a new technique for source-to-source transformation of sequential programs. The authors show that the transformed programs so generated provide significant speedups over the original program on vector-processors and the vector-multiprocessors. They exploit the parallelism that arises when multiple instances of a program are executed on simultaneously available data sets. This is in contrast to the existing approaches that aim at detecting parallelism within a program. Analytic and simulation models of the authors technique clearly indicate the speedups that could be achieved when several data sets are available simultaneously, as in the case in many fields of interest.

• OSTI ID: 6502479
• Journal Information: IEEE Transactions on Parallel and Distributed Systems; (USA), Journal Name: IEEE Transactions on Parallel and Distributed Systems; (USA) Vol. 1:4; ISSN ITDSE; ISSN 1045-9219
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ARRAY PROCESSORS
COMPUTER CODES
COMPUTERIZED SIMULATION
PARALLEL PROCESSING
PROGRAMMING
SIMULATION
TECHNOLOGY UTILIZATION
VECTOR PROCESSING