Instruction set design issues relating to a static dataflow computer

ABSTRACT

In an effort to minimize traffic in the distribution network of a static dataflow machine the design of the system includes alternate data paths so that data movement may take place over “shorter” paths when it is permissible to do so. The main emphasis of this approach is to allow rapid transfer of data in sequential code segments residing in single memory blocks. This decreases crowding in the more expensive distribution network utilized by data that fans out to two or more blocks as required when more concurrent activity is to be initiated during the execution of the program. The objective of data movement minimization has also influenced the design of the instruction set. In this case, composite, that is, “multi-actor” instructions have been proposed as an effective strategy. This has been done without compromizing the utility of the instructions or overly increasing the time and space requirements of their execution. In the paper, these principles are illustrated by defining controlled instructions that are especially useful in the management of loops.

REFERENCES

• 1: Arvind, Kathail, V. and Pinagali, K., "A Dataflow Architecture with Tagged Tokens," MIT/LCS/TM-174, MIT Laboratory for Computer Science, Sept. 1980.
• 2: Arvind, Gostelow, K. P. and Plouffe, W., "An Asynchronous Programming Language and Computing Machine," Tech. rep.#114A, Dept. of Information and Computer Science, Univ. of California, Irvine, Dec. 1978.
• 3: F. J. Burkowski, A multi-user data flow architecture, Proceedings of the 8th annual symposium on Computer Architecture, p.327-340, May 12-14, 1981, Minneapolis, Minnesota, United States
• 4: Davis, A., "A Dataflow Evaluation System Based on the Concept of Recursive Locality," Proceedings of the ACM 1979 National Computer Conference, June 1979, pp. 1079-1086.
• 5: Dennis, J. B., "The Varieties of Dataflow Computers," Proceedings of the First International Conference on Distributed Computing Systems, Oct. 1979, pp. 430-439.
• 6: Jack B. Dennis , G. Andrew Boughton , Clement K.C. Leung, Building blocks for data flow prototypes, Proceedings of the 7th annual symposium on Computer Architecture, p.1-8, May 06-08, 1980, La Baule, United States [doi>10.1145/800053.801902]
• 7: Dennis, J. B., "Dataflow Supercomputers," Computer, Nov. 1980, pp. 48-56.
• 8: 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
• 9: Watson, I. and Gurd, J., "A Prototype Dataflow 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.0 GENERAL
      Subjects: Instruction set design (e.g., RISC, CISC, VLIW)

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Distributed networks

General Terms:
Design