Abstract
An architecture involving at least one master CPU and many auxiliary processors is proposed to restore the balance between processor and store systems in multi-programming systems.
The outline of the processor/store connections is given and the mode of operation is discussed. Parallelism is achieved by either parallel processing one task or running many tasks in parallel.
It is shown that the system will run current high level programs making its own decisions as to whether it is feasible to subtask a portion of the program. If anything is subtasked it is treated as a virtual instruction to run on its own processor. This virtual instruction is mapped onto the auxiliary processors by an associative memory.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. V. Ramamoorthy and M. J. Gonzalez, "A Survey of Techniques for Recognizing Parallel Processable Streams in Computer Programs," in 1969 Fall Joint Comput. Conf., AFIPS Conf. Proc., vol. 35, Montvale, N.J.: AFIPS Press 1969, pp. 1–7.
R. Turn, "Computers in the 1980's — Trends in Hardware Technology," Information Processing 74, North Holland, Amsterdam, 1974, pp. 137–140.
C. H. Kaplinsky, "The Universal Peripheral Controller — an intelligent buffered channel" Proceedings of the European Computing Conference, Online, 1974, pp. 659–670.
W. Walkenshaw and A. J. Oxley (Ed), Computing and Automation Division Quarterly Report, 31 December 73–31 March 74, Computing and Automation Div., Rutherford Laboratory, RL-74-072 C78.
M. J. Gonzalez and C. V. Ramamoorthy, "Parallel Task Execution in a Decentralized System," IEEE Trans. Comput. C.21, December 1972, pp. 1310–1322.
A. J. Bernstein, "Analysis of Program for Parallel Processing," IEEE Trans. Electron. Comput. vol. EC-15, October 1966, pp. 757–763.
W. H. Burkhart, "Automation of Program Speed-up on Parallel-Processor Computers," Computing 3, 1968, pp. 297–310.
C. V. Ramamoorthy, J. H. Park and H. F. Li, "Compilation Techniques for Recognition of Parallel Processable Tasks in Arithmetic Expressions," IEEE Trans. Comput., C-22, November 1973, pp. 986–997.
D. Knuth, "An Empirical Study of FORTRAN Programs," Software — Practice and Experience, vol. 1, 1971, pp. 105–133.
K. Kennedy, "A Global Flow Analysis Algorithm," International Journal of Computer Math., vol. 3, December 1971, pp. 5–15.
F. E. Allen, "Interprocedural Data Flow Analysis," Information Processing 74, vol. 2, North Holland 1974, pp. 398–402.
M. E. Conway, "Design of a Seperable Transition-Diagram Compiler," Com of ACM, vol. 6, July 1963, pp. 396–408.
J. E. Juliussen and F. J. Mowle, "Multiple Micro processors with Common Main and Control Memories," IEEE Trans. Comput., C-22, November 1973, pp. 999–1007.
P. S. Roberts and C. S. Wallace, "A Micro programmed Lexical Processor," Information Processing 71, North Holland 1972, pp. 577–581.
J. R. Spirn and P. J. Denning, "Experiments with Program Locality," Proc. AFIPS Conf. Fall Joint Computer Conference, 1972, pp. 611–621.
I. Masuda, H. Shiota, K. Noguchi and T. Ohki, "Optimization of Program Organization by Cluster Analysis," Information Process 74, North Holland 1974, pp. 261–265.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaplinsky, C. (1975). Parallel processing by virtual instruction. In: Feng, Ty. (eds) Parallel Processing. SCC 1974. Lecture Notes in Computer Science, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07135-0_132
Download citation
DOI: https://doi.org/10.1007/3-540-07135-0_132
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07135-8
Online ISBN: 978-3-540-37408-4
eBook Packages: Springer Book Archive