Parallelizing of Seqential Programs on the Basis of Pipeline and Speculative Features of the Operators

Authors:
Alexander B. Godlevsky;Martin Gazák;Ladislav Hluchý
Affiliations:
-;-;-
Venue:
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Year:
1999

Citing 4
Cited 0

PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing

PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Strategy-accurate parallel Buchberger algorithms

Journal of Symbolic Computation - Special issue on parallel symbolic computation
Pipelining with futures

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Automatic Parallelization of Irregular and Pointer-Based Computations: Perspectives from Logic and Constraint Programming

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to dynamic parallelizing of coarse grained program where the parallelization sources are both dataflow analysis and the features pointed out in the program by annotating is proposed. Program annotating enables to hold two additional types of parallel computations which cannot be found out only from the analysis of dataflow dependences. Firstly, there are speculative computations based on anticipating alternative branches of the program's computational process. Secondly, there are pipeline computations that sometimes may be initialised for operators at the moment when their input data are not complete. Automated program analysis of this type of concurrence is either very hard or it generates a lot of surplus computation, thus absorbing the effect of program parallelization. The implementation of the system of dynamic program parallelization for clusters of PCs and results of some experiments performed on it are described.