International Conference on Parallel Processing

CONPAR 1981: Conpar 81 pp 37-47

Queue machines: An organization for parallel computation

  • M. Feller
  • M. D. Ercegovac
Matching The Structure Of Computations And Machine Architecture

DOI: 10.1007/BFb0105108

Volume 111 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1981

Authors and Affiliations

  • M. Feller
    • 1
  • M. D. Ercegovac
    • 1
  1. 1.UCLA Computer Science DepartmentUniversity of CaliforniaLos AngelesUSA