Summary
The present paper tries to define automatic procedures for detecting inherent paralellism during the compilation of programs in procedural language for parallel-processor computers. This parallelism should be used on a static and a dynamic basis. During compilation several independent paths are detected, generated and properly identified for parallel execution. Also, a scheme is described for an executive routine in this environment.
Zusammenfassung
Der vorliegende Beitrag versucht automatische Methoden für die Auffindung innewohnender Gleichzeitigkeit in Programmen während der Übersetzung für Parallel-Rechner abzugrenzen. Solche Gleichzeitigkeit sollte auf statische und auf dynamische Weise verwendet werden. Während der Übersetzung werden mehrere unabhängige Rechenwege erzeugt und für parallele Ausführung entsprechend gekennzeichnet. In diesem Zusammenhang wird ein Schema für ein Kontrollprogramm angegeben.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Gosden, J. A.: Explicit Parallel Processing Description and Control in Programs for Multi-and Uni-Processor Computers. Proc. FJCC1966, 651–660. (See also for further references.)
Opler, A.: Procedure-oriented Language Statements to Facilitate parallel Processing. Comm. ACM8, 306–307 (1965).
Thorlin, J. F.: Code Generation for PIE (Parallel Instruction Execution) Computers. Proc. SJCC1967, 641–643.
Buchholz, W. (Editor): Planning a Computer System. New York: McGraw-Hill. 1962.
Anderson, J. P.: Program Structures for Parallel Processing. Comm. ACM8, 786–788 (1965).
Wirth, N.: A Note on Program Structures for Parallel Processing. Comm. ACM9, 320–321 (1966).
Conway, M. E.: A Multi-Processor System Design. Proc. FJCC1963, 139–146.
Author information
Authors and Affiliations
Additional information
With 5 Figures
Rights and permissions
About this article
Cite this article
Burkhardt, W.H. Automation of program speed-up on parallel-processor computers. Computing 3, 297–310 (1968). https://doi.org/10.1007/BF02235396
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02235396