By Topic

IEEE Transactions on Computers

Issue 2 • Feb. 1983

Filter Results

Displaying Results 1 - 18 of 18
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 1983, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (451 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1983, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (274 KB)
    Freely Available from IEEE
  • Totally Preset Checking Experiments for Sequential Machines

    Publication Year: 1983, Page(s):101 - 108
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2705 KB)

    In this paper, we intoduce a new class of checking experiments, called uniform checking experiments, in which the entire input sequence, including the initialization part, is preset. The input sequence of a uniform checking experiment is called a uniform checking sequence. It is shown that every sequential machine possesses a uniform checking sequence. Trivially, if the machine has a synchronizing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial Planning: A Configuration Space Approach

    Publication Year: 1983, Page(s):108 - 120
    Cited by:  Papers (1004)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4986 KB)

    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 approach presented here is based on characterizing the position and orientation of an object as a single point in a configuration space, in which each coordi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured Specification of Communicating Systems

    Publication Year: 1983, Page(s):120 - 133
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5133 KB)

    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 interconnection between several subprocesses within a process are specified using the concept of ports, which are specified separately. Step-wise refinement of p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile Nodes

    Publication Year: 1983, Page(s):133 - 147
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4883 KB)

    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-, two-or three-dimensional) configurations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum Mean Running Time Function Generation Using Read-Only Memory

    Publication Year: 1983, Page(s):147 - 156
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4040 KB)

    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 evaluated by piecewise polynomials of the same low degree whose coefficients are stored in ROM. Four basic architectures for such a scheme are considered. A n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Execution Architecture: The DELtran Experiment

    Publication Year: 1983, Page(s):156 - 175
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6548 KB)

    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 instruction set architectures. We focus on general techniques for synthesizing DEL's rather than performance questions per se, however. There are fou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer

    Publication Year: 1983, Page(s):175 - 189
    Cited by:  Papers (339)  |  Patents (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5640 KB)

    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 approximate the ideal behavior of Schwartz's paracomputer model of computation and to implement efficiently the important fetch-and-add synchronization primiti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing

    Publication Year: 1983, Page(s):190 - 194
    Cited by:  Papers (105)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2300 KB)

    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}, if one keeps track of the bit patterns appearing at the corresponding positions k1, &#... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers

    Publication Year: 1983, Page(s):194 - 198
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2259 KB)

    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(√N), matches, within a constant factor, the known theoretical Ω(N2) lower bound to the area × (time)2measure of complexity in the VLSI model of computation. The network, which is based on the discrete Fourier ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing by Verifying Walsh Coefficients

    Publication Year: 1983, Page(s):198 - 201
    Cited by:  Papers (74)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (851 KB)

    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 fault in appropriately designed networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Addendum to "Optimum Golomb Rulers"

    Publication Year: 1983, Page(s): 201
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB)

    The optimum Golomb ruler1 with 13 marks has been found. This shortest ruler as well as another new ruler is reported. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Parallel Solution of Triangular Systems of Equations

    Publication Year: 1983, Page(s):201 - 204
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (791 KB)

    In this paper, methods are presented for the parallel solution of (n × n) lower triangular linear systems suitable for a p processor MIMD computer system where n/2 < p < (n − 1). The methods are based on the principle of allocating the processors as soon as they become available, thus creating a wavefront through the triangular array. The algorithms are shown to run in time (4n &#... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Microprocessor Solution of Ordinary Differential Equations Using Integer Arithmetic

    Publication Year: 1983, Page(s):204 - 207
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (691 KB)

    Integer arithmetic is a numerical method which exploits the architecture and instruction set of a microcomputer in a way analogous to that of computational techniques which utilize the capabilities of analog and digital computers. Exact solutions of phase plane trajectories for ordinary differential equations are obtained by coupling a pair of F space difference terms to a pair of bit slice microp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers

    Publication Year: 1983, Page(s): 207
    Request permission for commercial reuse | PDF file iconPDF (200 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1983, Page(s): 207
    Request permission for commercial reuse | PDF file iconPDF (197 KB)
    Freely Available from IEEE
  • The 1983 International Symposium on Multiple-Valued Logic

    Publication Year: 1983, Page(s): 207
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org