scispace - formally typeset
ReportDOI

Overview of the CHiP Computer

TLDR
It is argued on the basis asymptotic analysis that a constant corridor width is preferred even though such lattices cannot make full use of the processor elements for most complex interconnection patterns, e.g., universal interconnection structures like the cube connected cycles and shuffle exchange.
Abstract
: The main question under study is how wide the corridor width should be for the switch lattice of the Configurable, Highly Parallel (CHiP) computer. (The CHiP computer family is introduced and its use for parallel algorithm composition is motivated.) It is argued on the basis asymptotic analysis that a constant corridor width is preferred even though such lattices cannot make full use of the processor elements for most complex interconnection patterns, e.g., universal interconnection structures like the cube connected cycles and shuffle exchange, and for certain 'simple' ones, e.g., certain planar graphs. (Author)

read more

Citations
More filters
Journal ArticleDOI

Introduction to the configurable, highly parallel computer

TL;DR: To answer the role of polymorphism in parallel computation, the characteristics of parallel processing and the benefits and limitations of VLSI technology are reviewed.
Journal ArticleDOI

Wire-routing machines—New tools for VLSI physical design

Se June Hong, +1 more
TL;DR: The complexity of the wire routing process is examined, several new approaches to solving the problem using a parallel system architecture are discussed, and more general designs suited for broader applications are discussed.
Proceedings ArticleDOI

A layout strategy for VLSI which is provably good (Extended Abstract)

TL;DR: A new framework within which to study VLSI layout problems is introduced based on a straightforward generalization of the Lipton-Tarjan notion of a planar separator and leads to universally close upper and lower bounds on the layout area and crossing number of an arbitrary network.
Journal ArticleDOI

VLSI Array Design Under Constraint of Limited I/O Bandwidth

TL;DR: VLSI computing arrays for matrix multiplication and covariance matrix inversion have applications in many fields and a properly chosen configuration can significantly reduce the computing time of the multiplication array.
Proceedings ArticleDOI

How to assemble tree machines (Extended Abstract)

TL;DR: This paper explores how large tree machines may be assembled efficiently from smaller components and presents a restructurable linear-area layout of m processors with O(lg m) pins that can realize an arbitrary binary tree.