Queue machines: An organization for parallel computation
- First Online:
- Cite this paper as:
- Feller M., Ercegovac M.D. (1981) Queue machines: An organization for parallel computation. In: Brauer W. et al. (eds) Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.