A reduction architecture for the optimal scheduling of binary trees
暂无分享,去创建一个
Y. V. Venkatesh | K. R. Ramakrishnan | K. Ravikanth | P. S. Sastry | P. Sastry | K. Ramakrishnan | Y. Venkatesh | K. Ravikanth
[1] BackusJohn. Can programming be liberated from the von Neumann style , 1978 .
[2] F. Warren Burton,et al. Towards a Zero Assignment Parallel Processor , 1981, ICDCS.
[3] John W. Backus,et al. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.
[4] Carlo H. Séquin,et al. Doubly twisted torus networks for VLSI processor arrays , 1981, ISCA '81.
[5] Robert M. Keller,et al. A loosely-coupled applicative multi-processing system , 1899 .
[6] Alain J. Martin. The Torus: An Exercise in Constructing a Processing Surface , 1982 .
[7] Steven R. Vegdahl,et al. A Survey of Proposed Architectures for the Execution of Functional Languages , 1984, IEEE Transactions on Computers.
[8] Leonard M. Uhr. Algorithm-structured computer arrays and networks , 1984 .
[9] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .