Skip to main content

Research Repository

Advanced Search

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

Brailsford, David F.; Duckworth, R. James

Authors

David F. Brailsford

R. James Duckworth



Contributors

T. Moto-oka
Editor

K. Fuchi
Editor

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.

Citation

Brailsford, D. F., & Duckworth, R. J. (1985). The MUSE Machine -- an Architecture for Structured Data Flow Computation. New Generation Computing, 3(2),

Journal Article Type Article
Publication Date Jan 1, 1985
Deposit Date Oct 24, 2005
Publicly Available Date Oct 9, 2007
Journal New Generation Computing
Print ISSN 0288-3635
Publisher Humana Press
Peer Reviewed Peer Reviewed
Volume 3
Issue 2
Keywords Data Flow, Parallel Computation, non von Neumann architectures, demand-driven, data-driven
Public URL http://eprints.nottingham.ac.uk/id/eprint/211
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf
Additional Information Rebuilt final draft of paper which appeared in "New generation Computing" (1985)

Files


muse.pdf (75 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





Downloadable Citations