Control of parallelism in the Manchester dataflow machine

  • Carlos A. Ruggiero
  • John Sargeant
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 274)


Fine-grain parallel machines, such as tagged-token dataflow machines, allow very high degrees of program parallelism to be exploited for many applications. In fact, so much parallelism can be generated that it is necessary to control parallelism in order to bound store usage.

This paper reviews software mechanisms for parallelism control, which rely on merely planting extra code to control execution order. Such methods are found to be inadequate, so a fundamental architectural mechanism known as a throttle is considered necessary. Various attempts to design a throttle for the Manchester Dataflow Machine are described. The eventual solution, a coarse-grain, process-based throttle, is explained, and simulation results are presented which demonstrate its effectiveness.


Parallel Machine Loop Cycle 13th Annual Symposium Recursive Tree Activation Name 

7 References

  1. Amam86.
    Amamiya et al, Implementation and Evaluation of a List-Processing-Oriented Data Flow Machine, 13th Annual Symposium on Computer Architecture, June 1986Google Scholar
  2. ArCu85.
    Arvind and Culler D.E., Managing Resources in a Parallel Machine, in Fifth Generation Computer Architectures, ed. J.V. Woods, North Holland, pp. 103–121, April 1986Google Scholar
  3. ArGo78.
    Arvind and Gostelow K.P., Some Relationships between Asynchronous Interpreters of a Dataflow Language, Formal Description of Programming Concepts, ed. Neuhold E.J., North Holland, pp. 95–119, 1978Google Scholar
  4. BaGu85.
    Barahona P.M.C.C. and Gurd J.R., Processor Allocation in a Multi-Ring Dataflow Machine, Technical Report UMCS-85-10-3, University of Manchester, October 1985.Google Scholar
  5. BoSa85.
    Bohm A.P.W. and Sargeant J., Efficient Dataflow Code Generation for SISAL, Proceedings International Conference on Parallel Computing, September 1985Google Scholar
  6. BuGu85.
    Bush V.J. and Gurd J.R., Transforming Recursive Programs for Execution on Parallel Machines, Lecture Notes in Computer Science, Vol. 201, pp. 350–367, September 1985Google Scholar
  7. DaRe81.
    Darlington, J. and Reeve, M, ALICE — A Multiprocessor Reduction Machine for the Evaluation of Applicative Languages, Proc. conf. on functional programming languages and computer architecture, 1981.Google Scholar
  8. GKWa85.
    Gurd J.R., Kirkham C.C. and Watson I., The Manchester Prototype Dataflow Computer, Communications of the ACM, Vol. 28, no. 1, pp. 34–52, January 1985Google Scholar
  9. Gurd85.
    Gurd J.R., The Manchester Dataflow Machine, Computer Physics Communications, Vol. 37, no. 1, pp. 49–62, July 1985Google Scholar
  10. GWGl78.
    Gurd J.R., Watson I. and Glauert J.R.W., A Multilayered Dataflow Computer Architecture, Internal Report, Department of Computer Science, University of Manchester, January 1978 (1st edition), March 1980 (3rd edition)Google Scholar
  11. ItoN86.
    Ito N. et al, The Architecture and Preliminary Evaluation Results of the Experimental Parallel Inference Machine PIM-D, 13th Annual Symposium on Computer Architecture, June 1986.Google Scholar
  12. KaGu86.
    Kawakami K, Gurd J.R., A Scalable Dataflow Structure Store, Proc. of the 13th Annual Int. Symposium on Computer Architecture, June 1986Google Scholar
  13. MSAg83.
    McGraw J.R., Skedzielewski S.K., Allan S., Grit D., Oldehoeft R., Glauert J.R.W., Dobes I. and Hohensee P., SISAL — Streams and Iteration in a Single-Assignment Language, Language Reference Manual, Version 1.0, Lawrence Livermore National Laboratory, July 1983Google Scholar
  14. Ruggie.
    Ruggiero C., Throttle Mechanisms for the Manchester Dataflow Computer, Computer Science Dept., University of Manchester, Ph.D. thesis, in preparationGoogle Scholar
  15. SaKi86.
    Sargeant J. and Kirkham C.C., Stored Data Structures on the Manchester Dataflow Machine, Proc. of the 13th Annual Int. Symposium on Computer Architecture, Vol. 14, no. 2, pp. 235–242, June 1986Google Scholar
  16. SiWa83.
    da Silva J.G.D. and Watson I., A Pseudo-Associative Matching Store with Hardware Hashing, Proc of the IEE, Vol. 130E, no. 1, pp. 19–24, January 1983Google Scholar
  17. Shim86.
    Shimada T. et al, Evaluation of a Prototype Data Flow Processor of the Sigma-1 for Scientific Computations, 13th Annual Symposium on Computer Architecture, June 1986Google Scholar
  18. WaWo86.
    Watson, I, Watson, P. and Woods, J.V., Parallel Data-Driven Graph Reduction, in Fifth Generation Computer Architectures, ed. J.V. Woods, North Holland, April 1986Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Carlos A. Ruggiero
    • 1
  • John Sargeant
    • 1
  1. 1.Department of Computer ScienceUniversity of ManchesterManchesterEngland

Personalised recommendations