Hint

Swipe to navigate through the chapters of this book

2012 | OriginalPaper | Chapter

7. Working with Sequential Versions

Author: Yosi Ben-Asher

Publisher: Springer London

Published in: Multicore Programming Using the ParC Language

» Get access to the full version

Abstract

In here we propose a programming methodology for developing efficient parallel programs. We basically advocate the idea that the parallel program is obtained from its sequential version by a sequence of gradual changes as follows:

Most of the developing stages are made sequentially and in gradual stages.
Each stage can be debugged sequentially, such that many bugs are found and removed before the parallel program is tested. Clearly, debugging a parallel program is harder than a sequential one, due to the fact that for a parallel program all possible execution orders must be tested.
Dependence analysis of the sequential program can reveal potential ways to invoke more parallelism to the desired parallel program.

Please log in to get access to this content

To get access to this content you need the following product:

Computer Science Explorer

Purchase now

Parc provides the number of processors in a variable named proc_no. We use P here for short.

Bacon, D.F., Graham, S.L., Sharp, O.J.: Compiler transformations for high-performance computing. ACM Comput. Surv. 26(4), 345–420 (1994). citeseer.ist.psu.edu/bacon93compiler.html CrossRef

Banerjee, U.: Loop Transformations for Restructuring Compilers: The Foundations. Springer, Berlin (1993). ISBN 079239318X MATHCrossRef

Ben-Asher, Y., Stein, E.: Basic results in automatic transformations of shared memory parallel programs into sequential programs. J. Supercomput. 17(2), 143–165 (2000) MATHCrossRef

Dowling, M.L.: Optimal code parallelization using unimodular transformations. Parallel Comput. 16(2–3), 157–171 (1990) MathSciNetMATHCrossRef

Kuck, D.J., Kuhn, R.H., Leasure, B., Wolfe, M.: The structure of an advanced retargetable vectorizer. In: Proc. COMPSAC ’80 (1980). A revised version appeared in K. Hwang, Supercomputers: Design and Applications, pp. 163–178, IEEE Computer Society, 1984

Lamport, L.: The parallel execution of do loops. Commun. ACM 17, 83–93 (1974) MathSciNetMATHCrossRef

McKinley, K.S., Carr, S., Tseng, C.W.: Improving data locality with loop transformations. ACM Trans. Program. Lang. Syst. 18(4), 453 (1996) CrossRef

Padua, D.A., Wolfe, M.J.: Advanced compiler optimizations for supercomputers. Commun. ACM 29(12), 1184–1201 (1986) CrossRef

Whitfield, D., Soffa, M.L.: An approach to ordering optimizing transformations. In: Symp. Principles & Practice of Parallel Programming, pp. 137–146 (1990)

Wolf, M.E., Lam, M.S.: A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. Parallel Distrib. Syst., 452–471 (1991)

Wolf, M.E., Lam, M.S.: A data locality optimizing algorithm. ACM SIGPLAN Not. 26(6), 30–44 (1991) CrossRef

Title

Working with Sequential Versions

Book

Multicore Programming Using the ParC Language

Print ISBN: 978-1-4471-2163-3

Electronic ISBN: 978-1-4471-2164-0

https://doi.org/10.1007/978-1-4471-2164-0

DOI

https://doi.org/10.1007/978-1-4471-2164-0_7

Author:

Yosi Ben-Asher

Publisher

Springer London

Sequence number

Chapter number

Chapter 7