Skip to main content

Emulating Digital Logic using Transputer Networks (Very High Parallelism = Simplicity = Performance)

Welch, Peter H. (1989) Emulating Digital Logic using Transputer Networks (Very High Parallelism = Simplicity = Performance). Parallel Computing, 9 (2). pp. 257-272. ISSN 0167-8191. (KAR id:20890)

Abstract

Modern VLSI technology has changed the economic rules by which the balance between processing

power, memory and communications is decided in computing systems. This will have a profound

impact on the design rules for the controlling software. In particular, the criteria for judging efficiency

of the algorithms will be somewhat different. This paper explores some of these implications through

the development of highly parallel and highly distributable algorithms based on occam and transputer

networks. The major results reported are a new simplicity for software designs, a corresponding ability

to reason (formally and informally) about their properties, the reusability of their components and some

real performance figures which demonstrate their practicality. Some guidelines to assist in these designs

are also given. As a vehicle for discussion, an interactive simulator is developed for checking the

functional and timing characteristics of digital logic circuits of arbitrary complexity.

Item Type: Article
Additional information: Published by North-Holland. This is an updated version of the paper of June 1987.
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 15 Jul 2009 11:41 UTC
Last Modified: 16 Nov 2021 09:59 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/20890 (The current URI for this page, for reference purposes)

University of Kent Author Information

Welch, Peter H..

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.