Abstract
A new method of parallelism between statements is exploited. The method is to decompose a process into separate sequential processes that are connected through queues of message buffers. The conditions for decomposition are analyzed, and a decomposition algorithm is developed. PL/I is used to describe processes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. L. Baer, “A survey of some theoretical aspects of multiprocessing,”Comput. Surv. 5(1): 31–80 (March 1973).
A. J. Bernstein, “Analysis of programs for parallel processing,”IEEE Trans. Electron. Comput. EC-15: 757–762 (October 1966).
P. Brinch Hansen,Operating System Principles (Prentice-Hall, Englewood Cliffs, N.J., 1973).
E. G. Dijkstra, “GO TO statement considered harmful,” Letters to the Editor,Commun. ACM 11(3): 147–148 (March 1968).
L. Kleinrock, “Sequential processing machines (S.P.M.) analyzed with a queuing theory model,”J. ACM. 13(2):179–193 (April 1966).
D. J. Kuck, Y. Muraoka, and S.-C. Chen, “On the number of operations simultaneously executable inFortran-like programs and their resulting speedup,”IEEE Trans. Comput. C-21(12):1293–1310 (December 1972).
C. V. Ramamoorthy and M. J. Gonzalez, “Recognition and Representation of Parallel Processable Streams in Computer Programs II (task/process parallelism),” InProc. ACM 24th Nat. Conf., ACM., New York (1969), pp. 387–397.
E. W. Reigel, “Parallelism Exposure and Exploitation in Digital Computing Systems,” Ph.D. thesis, University of Pennsylvania, Philadelphia (1969).
E. C. Russell, “Automatic Program Analysis,” Ph.D. thesis, Department of Electrical Engineering, University of California, Los Angeles (1969).
S. A. Volansky, “Graph Model Analysis and Implementation of Computational Sequences,” Ph.D. thesis, Department of Electrical Engineering, University of California, Los Angeles (1970).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Maekawa, M. Detection of parallelism between statements by decomposing into separate sequential processes. International Journal of Computer and Information Sciences 5, 239–255 (1976). https://doi.org/10.1007/BF00991837
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00991837