Allan Gottlieb, Ralph Grishman, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, Marc Snir
We present the design for the NYU Ultracomputer, a shared-memory MIMD parallel machine composed of thousands of autonomous processing elements. This machine uses an enhanced message switching network with the geometry of an Omega-network to ...
This paper presents algorithms for computing constraints on the position of an object due to the presence of ther objects. This problem arises in applications that require choosing how to arrange or how to move objects without collisions. The ...
Zeev Barzilai, Don Coppersmith, Arnold L. Rosenberg
One has a shift register of length n and a collection of designated subsets of {0, 1,???, n-1}. The problem is to devise a method for feeding a string of bits into the shift register in such an order that, for each designated subset S = {k1,???, kr}, ...
Michael J. Flynn, Lee W. Hoevel
Execution architectures include Directly Executed Languages, or DEL's, which are tailored to particular combinations of software and hardware technologies. In this paper, we review the general notion of DEL's, and show how they compare to traditional ...
Testing of logic networks by verifying the Walsh coefricients of the outputs is explored. Measurement of one of these can detect arbitrarily many input leads stuck, and just two measurements, requiring little hardware, can detect any single stuck-at ...
This paper describes a VLSI network for the multiplication of two N-bit integers, for very large N. The network, with its area 0(N) and operation time 0(vN), matches, within a constant factor, the known theoretical O(N2) lower bound to the area ? ...
Gilles H. Garcia, William J. Kubitz
High-speed hardware function generation using table look-up in ROM and high-speed multiplication is considered. The reduced interval of interest, [a, b], is split into several large partitions. Within each large partition the functionf(x) is ...
Yaron I. Gold, William R. Franta, Shlomo Moran
We present a theoretical description and analysis of a collision-free channel-access protocol for a shared channel with "mobile" nodes that are all within range and in line-of-sight of each other, in arbitrarily changing spatial (one-, ...
Gregor von Bochmann, Michel Raynal
Specification methods for distributed systems is the underlying theme of this paper. A model of communicating processes with rendezvous interactions is assumed as a basis for the discussion. The possible interactions by a process, and the ...