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., "Can Programming Be Liberated from the Von Neumann Style? A Functional Style and Its Algebra of Programs," CACM 21:8 (August 1978), 613–641.
- Blikle, A. J., "Investigations in the Theory of Addressless Computers," Polska Akademia Nauk (Serie des sciences math., astr., et phys.) 14:14 (April 1966), 203–208.
- Dennis, J.B., "The Avrieties of Data Flow Computers," Proc. International Conference on Distributed Systems, Huntsville, Alabama, 1979.
- Feller, M., "A Parallel Queue Organization for High-Speed Computing," (thesis) UCLA, Los Angeles, California, 1980.
- 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., G. Lindstrom, and S. Patil, "A Loosely-Coupled Applicative Multiprocessor System," Proc. AFIPS NCC, Vol. 48 (June 1979), 613–622.
- Kuck, D. J., "A Survey of Parallel Machine Organization and Programming," ACM Computing Surveys 9:1 (March 1977), 29–59. CrossRef
- Lang, T., "Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network," IEEE Trans. Comput. C-25:5 (May 1976), 496–503.
- Pawlak, Z., "New Class of Mathematical Languages and Organization of Addressless Computers," (in) Colloquium on the Foundation of Mathematics, Budapest: Akademiai Kiado, 1965, 1965, 227–238.
- Stone, H.S., "A Pipeline Push-Down Stack Computer," (in) L.C. Hobbs et al., eds., Parallel Processor Systems, Technologies, and Applications. New York: Spartan 1970, 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.