Building blocks for data flow prototypes

ABSTRACT

A variety of proposed architectures for data flow computers have been advanced. Evaluation of the practical potential of these proposals is being studied through analysis and simulation, but these techniques cannot be used to study a machine design in sufficient detail to make accurate predictions of performance. As a basis for extrapolating cost/performance of these architectures, and for developing a methodology for data flow program preparation, the construction of prototype machines is needed. In this paper we present our plan for realizing experimental data flow machines as packet communication systems using two types of hardware elements: a microprogrammed processing element with provision for packet transmission and reception; and a router unit used to build networks to support packet communication among processing elements.

REFERENCES

• 1: W. B. Acherman , J. B. Dennis , William B Ackerman, VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL, Massachusetts Institute of Technology, Cambridge, MA, 1979
• 2: Arvind and R. E. Bryant, Parallel Computers for Partial Differential Equation Simulation, Laboratory for Computer Science, M.I.T., CSG Memo 178 (May 1979), 10 pp.
• 3: G. A. Boughton, Routing Networks in Packet Communication Architectures, Dept. of Electrical Engineering and Computer Science, S.M. Thesis, M.I.T. (June 1978), 93 pp.
• 4: M. Cornish, Private communication, Texas Instruments Company, Austin, Texas.
• 5: A. Davis, "A Data Flow Evaluation System Based on the Concept of Recursive Locality," Proceedings of the ACM 1979 National Computer Conference (June 1979), pp. 1079-1086.
• 6: J. B. Dennis, First version of a data flow procedure language, Programming Symposium, Proceedings Colloque sur la Programmation, p.362-376, April 09-11, 1974
• 7: J. B. Dennis, "Packet Communication Architecture," Proceedings of the 1975 Sagamore Computer Conference on Parallel Processing (August 1975), pp. 224-229.
• 8: J. B. Dennis, C. K. C. Leung, and D. P. Misunas, A Highly Parallel Processor Using a Data Flow Machine Language, Laboratory for Computer Science, M.I.T., CSG Memo 134-1 (June 1979), 33 pp. Submitted to the IEEE Transactions. on Computers.
• 9: J. B. Dennis, and K. Weng, "An Abstract Implementation for Concurrent Computation With Streams," Proceedings of the 1979 International Conference on Parallel Processing (August 1979), pp. 35-45.
• 10: J. B. Dennis, "The Varieties of Data Flow Computers," Proceedings of the First International Conference on Distributed Computing Systems (October 1979), pp. 430-439.
• 11: A. M. Feridun, Data Flow Cell Block and Functional Unit Emulation, Report in progress, Laboratory for Computer Science, M.I.T.
• 12: A. Hopper and D. J. Wheller, "Binary Routing Networks," IEEE Transactions. on Computers, Vol. C-28, No. 10 (October 1979), pp. 699-703.
• 13: P. Ressler, Simulation of a Highly Parallel Processor, Dept. of Electrical Engineering and Computer Science, S.B. Thesis, M.I.T. (January 1979), 40 pp.
• 14: Anand R. Tripathi , G. Jack Lipovski, Packet switching in banyan networks, Proceedings of the 6th annual symposium on Computer architecture, p.160-167, April 23-25, 1979 [doi>10.1145/800090.802905]
• 15: E. Vishniac, A Processor Module for Data Flow Computer Development, Laboratory for Computer Science, M.I.T., CSG Memo 176 (May 1979), 55 pp.
• 16: I. Watson and J. Gurd, "A Prototype Data Flow Computer With Token Labelling," Proceedings of the ACM 1979 National Computer Conference (June 1979), pp. 623-628.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES
      C.1.3 Other Architecture Styles
          Subjects: Data-flow architectures

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Packet-switching networks
      C.2.6 Internetworking
          Subjects: Routers

General Terms:
Design, Performance