• Publications
  • Influence
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels, which is used to develop deadlocked routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.
The torus routing chip
The torus routing chip (TRC) is a selftimed chip that performs deadlock-freecut-through routing ink-aryn-cube multiprocessor interconnection networks using a new method of deadlock avoidance
Multicomputers: message-passing concurrent computers
A status report is provided on the architecture and programming of a family of concurrent computers that are organized as ensembles of small programmable computers called nodes, connected by a
The cosmic cube
  • C. Seitz
  • Computer Science, Physics
  • 2 January 1985
This “Cosmic Cube” computer is a hardware simulation of a future VLSI implementation that will consist of single-chip nodes and offers high degrees of concurrency in applications and suggests that future machines with thousands of nodes are both feasible and attractive.
A framework for adaptive routing in multicomputer networks
This thesis examines the possibility of performing adaptive routing as an approach to further improving upon the performance and reliability of message-passing concurrent computers by exploiting the inherent path redundancy found in richly connected networks in order to perform fault-tolerant routing.
Self-Timed VLSI Systems
This short paper is intended to explain why the subject of self-timed logic is relevant to a conference on VLSI. Scaling down feature size and scaling up chip area not only increases the
Concurrent VLSI Architectures
  • C. Seitz
  • Computer Science
    IEEE Transactions on Computers
  • 1 December 1984
This tutorial paper addresses some of the principles and provides examples of concurrent architectures and designs that have been inspired by VLSI technology. The circuit density offered by VLSI
Variants of the Chandy-Misra-Bryant Distributed Discrete-Event Simulation Algorithm
A family of variants of the Chandy-Misra-Bryant (CMB) distributed discrete-event simulation algorithm are investigated, including lazy message-sending, demand-driven operation with backward demand messages, and adaptive adjustment of the parameters that control the laziness.
Cantor User Report: Version 2.0
Cantor is an object-oriented programming notation for describing concurrent computations in terms of small concurrent objects, comprised of a set of private variables, called the "persistent variables" or "acquaintances", a message list used to identify the contents of a message.
The C Programmer''s Abbreviated Guide to Multicomputer Programming
This abbreviated programmer''s guide describes the essentials of writing multipleprocess message-passing C programs on UNIX hosts under a runtime system called the Cosmic Environment (version 7.2),