✦ LIBER ✦

The implementation of a functional machine on a transputer network

✍ Scribed by O Boudillet; S.C Winter; D.R Wilson

Publisher: Elsevier Science
Year: 1988
Weight: 614 KB
Volume: 24
Category: Article
ISSN: 0165-6074
DOI: 10.1016/0165-6074(88)90084-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Implementation of Forth on a network of

Implementation of Forth on a network of transputers

✍ Lionel Waring 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 511 KB

Notes on implementing a language for tra

Notes on implementing a language for transputer networks

✍ D Crookes; P.J Morrow; P Milligan; N.S Scott; P.L Kilpatrick 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 426 KB

On the implementation of parallel iterat

On the implementation of parallel iterated Runge-Kutta methods on a transputer network

✍ H. De Meyer; M. Van Daele; G. Vanden Berghe 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 684 KB

Network topology A critical factor in th

Network topology A critical factor in the implementation of algorithms intended for efficient execution on a transputer network

✍ P Milligan; N.S Scott; D Crookes; P.L Kilpatrick; P.J Morrow 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 279 KB

Implementation of Apply on a transputer

Implementation of Apply on a transputer array

✍ Wang, Han ;Dew, Peter M. ;Webb, Jon A. 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 711 KB

Apply is a machine-independent, low-level image proressing language for expressing local window operations. It has two main advantages: (1) It significantly reduces the prcqpuumiq effort, and (2) it can be mapped onto a wide range of parallel computers. In this paper we report our recent experience

Implementation of arbitrary Boolean func

Implementation of arbitrary Boolean functions on a CNN Universal Machine

✍ Nemes, L.; Chua, L. O.; Roska, T. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 836 KB

The demand for implementing arbitrary N-variable logic functions on perceptron-like structures arises quite often in practice. It is well known, that only the linearly separable class of Boolean functions can be implemented in a single step on these structures. This class however, constitutes only a