Queue machines: An organization for parallel computation
We explore parallel system organizations based on a representation of programs which allows execution using a queue as a working store. The main advantage of such a representation, called Q-notation, is that multiple processors can be used in a very regular manner, so that a simple and natural mapping of parallel computations onto parallel processors is achieved. The proposed machines are characterized by very efficient and fast instruction issue, modularity with useful fault-tolerance properties, and simplified interconnection requirements. We define a Q-notation for program representation and discuss in general its capabilities and limitations in executing ordinary (sequential) and concurrent programs.
- Arvind, "Decomposing a Program for Multiple Processor Systems," International Conference on Parallel Processing, 1980.
- Backus, J. (1978) Can Programming Be Liberated from the Von Neumann Style? A Functional Style and Its Algebra of Programs. CACM 21: pp. 613-641
- Blikle, A. J. (1966) Investigations in the Theory of Addressless Computers. Polska Akademia Nauk (Serie des sciences math., astr., et phys.) 14: pp. 203-208
- Dennis, J.B., "The Avrieties of Data Flow Computers," Proc. International Conference on Distributed Systems, Huntsville, Alabama, 1979.
- Feller, M. (1980) A Parallel Queue Organization for High-Speed Computing. UCLA, Los Angeles, California
- Flynn, M. J. and J. L. Hennessy, "Parallelism and Representation Problems in Distributed Systems," Proc. International Conference on Distributed Systems, Huntsville, Alabama, 1979.
- Keller, R.M., Lindstrom, G., Patil, S. (1979) A Loosely-Coupled Applicative Multiprocessor System. Proc. AFIPS NCC 48: pp. 613-622
- Kuck, D. J. (1977) A Survey of Parallel Machine Organization and Programming. ACM Computing Surveys 9: pp. 29-59 CrossRef
- Lang, T. (1976) Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network. IEEE Trans. Comput C-25: pp. 496-503
- Pawlak, Z. (1965) New Class of Mathematical Languages and Organization of Addressless Computers. Colloquium on the Foundation of Mathematics. Akademiai Kiado, Budapest, pp. 227-238
- Stone, H.S. A Pipeline Push-Down Stack Computer. In: Hobbs, L.C. eds. (1970) Parallel Processor Systems, Technologies, and Applications. Spartan, New York, pp. 235-249
- Queue machines: An organization for parallel computation
- Book Title
- Conpar 81
- Book Subtitle
- Conference on Analysing Problem Classes and Programming for Parallel Computing Nürnberg, June 10–12, 1981 Proceedings
- pp 37-47
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.