论文信息 - The FFP machine

The FFP machine

The FFP machine directl11 e:tecutes programs written in a general purpose high level functional programming language. It is a small-grain reduction machine which dynamicallJI creates independent submachines of varJ!ing size consisting of conglomerations of processor. for each available subcomputation. Buau..e the machine performs problem decomposition and resource alloeation without e:tplicit programmer or software control, it is appropriate for d11namic and irregular computations. We descn"be an implementation that consists of a binarJI tree of onl11 two kinds of processors; this implementation iB u:tensible and well-suited to VLSI implementation.

Gyula A. Mago

[1] John W. Backus,et al. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[2] Gyula A. Magó,et al. Making Parallel Computations Simple: The FFP Machine , 1985, COMPCON.

[3] Bruce Smith. Logic Programming on an FFP Machine , 1984, SLP.

[4] Donald F. Stanat,et al. Minimizing maximum flows in linear graphs , 1979, Networks.

[5] Donald MacDavid Tolle. Implanting FFP trees in binary trees: An architectural proposal , 1981, FPCA '81.

[6] David A. Plaisted,et al. An Architecture for fast Data Movement in the FFP Machine , 1985, FPCA.

[7] Scott Danforth,et al. DOT, A Distributed Operating System Model of a Tree-Structured Multiprocessor , 1983, ICPP.

[8] Klaus J. Berkling. Reduction languages for reduction machines , 1974, ISCA '75.

[9] Donald Macdavid Tolle. Coordination of computation in a binary tree of processors: an architectural proposal , 1981 .