The MUSE Machine -- an Architecture for Structured Data Flow Computation

Brailsford, David F. and Duckworth, R. James (1985) The MUSE Machine -- an Architecture for Structured Data Flow Computation. New Generation Computing, 3 (2). pp. 181-195.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
73Kb

Abstract

Computers employing some degree of data flow organisation are now well established as providing a possible vehicle for concurrent computation. Although data-driven computation frees the architecture from the constraints of the single program counter, processor and global memory, inherent in the classic von Neumann computer, there can still be problems with the unconstrained generation of fresh result tokens if a pure data flow approach is adopted. The advantages of allowing serial processing for those parts of a program which are inherently serial, and of permitting a demand-driven, as well as data-driven, mode of operation are identified and described. The MUSE machine described here is a structured architecture supporting both serial and parallel processing which allows the abstract structure of a program to be mapped onto the machine in a logical way.

Item Type:Article
Additional Information:Rebuilt final draft of paper which appeared in "New generation Computing" (1985)
Uncontrolled Keywords:Data Flow, Parallel Computation, non von Neumann architectures, demand-driven, data-driven
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:211
Deposited By:Brailsford, David
Deposited On:24 Oct 2005
Last Modified:09 Oct 2007 16:50

Repository Staff Only: item control page