IEEE Transactions on Computers

Issue 9 • Sept. 1986

Filter Results

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

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

    Publication Year: 1986, Page(s): c2
    Request permission for commercial reuse | |PDF file iconPDF (175 KB)
    Freely Available from IEEE
  • On the Height of Multidimensional Height-Balanced Trees

    Publication Year: 1986, Page(s):773 - 780
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2091 KB)

    It is shown that the worst case height of a k- dimensional height-balanced tree, k ≥ 2, is the same as that of an AVL-tree, to within an additive factor of 2k − 2. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The VLSI Design of an Error-Trellis Syndrome Decoder for Certain Convolutional Codes

    Publication Year: 1986, Page(s):781 - 789
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2544 KB)

    In this paper a recursive algorithm using the error-trellis decoding technique is developed to decode certain convolutional codes (CC's). An example, illustrating the VLSI architecture of such a decoder, is given for a dual-k CC. It is demonstrated that such a decoder can be realized readily on a single chip with NMOS technology. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Architecture of SM3: A Dynamically Partitionable Multicomputer System

    Publication Year: 1986, Page(s):790 - 802
    Cited by:  Papers (22)  |  Patents (32)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3717 KB)

    The architecture of a multicomputer system with switchable main memory modules (SM3) is presented. This architecture supports the efficient execution of parallel algorithms for nonnumeric processing by 1) allowing the sharing of switchable main memory modules between computers, 2) supporting dynamic partitioning of the system, and 3) employing global control lines to efficiently support interproce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Aggregation Technique for the Transient Analysis of Stiff Markov Chains

    Publication Year: 1986, Page(s):803 - 814
    Cited by:  Papers (102)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3237 KB)

    An approximation algorithm for systematically converting a stiff Markov chain into a nonstiff chain with a smaller state space is discussed in this paper. After classifying the set of all states into fast and slow states, the algorithm proceeds by further classifying fast states into fast recurrent subsets and a fast transient subset. A separate analysis of each of these fast subsets is done and e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Instruction Issuing Approach to Enhancing Performance in Multiple Functional Unit Processors

    Publication Year: 1986, Page(s):815 - 828
    Cited by:  Papers (48)  |  Patents (124)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (4054 KB)

    Processors with multiple functional units, such as CRAY-1, Cyber 205, and FPS 164, have been used for high-end scientific computation tasks. Much effort has been put into increasing the throughput of such systems. One critical consideration in their design is the identification and implementation of a suitable instruction issuing scheme. Existing approaches do not issue enough instructions per mac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Direct Implementation of Discrete and Residue-Based Functions Via Optimal Encoding: A Programmable Array Logic Approach"

    Publication Year: 1986, Page(s):829 - 830
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (514 KB)

    An analytic expression for the lower bound on the complexity of residue multiplication is developed. Significant reduction of the required stored logic in a content-addressable memory is noted. Errors in Figs. 5(a), 7, and 8 of the above paper1 are corrected. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signature Analysis for Multiple-Output Circuits

    Publication Year: 1986, Page(s):830 - 837
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1468 KB)

    A scheme of a good signature analysis by a linear feedback shift register (LFSR) is presented. It works for k-output circuits, even if k is greater than the register length. It is built according to rules which are presented in the correspondence, taking into account error models which are introduced. The rules are derived from a property which is formally shown for one kind of LFSR. However, some... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Diagnosable System Design Using Full-Difference Triangles

    Publication Year: 1986, Page(s):837 - 839
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (722 KB)

    In the literature on diagnosable multiprocessor systems, regular testing structures which isolate up to t1 faulty processors to within a set of t1 processors have been studied. These structures are called D(n, t0, X) systems and are said to be t1/t1-diagnosable. In this correspondence, the problem of designing regular testing structures which isolate the largest number of faulty processors is show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Crash Recovery Scheme for a Memory-Resident Database System

    Publication Year: 1986, Page(s):839 - 843
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1375 KB)

    Database systems normally have been designed with the assumption that main memory is too small to hold the entire database. With the decreasing cost and increasing performance of semiconductor memories, future database systems may be constructed that keep most or all of the data for the database in main memory. The challenge in the design of these systems is to provide fast transaction processing,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Rotation Problems in Channel Routing

    Publication Year: 1986, Page(s):843 - 847
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1341 KB)

    In the channel routing problem, a problem arising in the design of layout systems, two rows of terminals which are opposite each other, have to be connected. We study what effect the rotation of one row of terminals has on the cost measures of the routing phase. The cost measures we consider are the density, which is proportional to the width of the channel, the crossing number, which is closely r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An O(20.304n) Algorithm for Solving Maximum Independent Set Problem

    Publication Year: 1986, Page(s):847 - 851
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (796 KB)

    A faster algorithm for finding a maximum independent set in a graph is presented. The algorithm is an improved version of the one by Tarjan and Trojanowski [7]. A technique to further accelerate this algorithm is also described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Corrections to "Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection"

    Publication Year: 1986, Page(s): 851
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (231 KB)

    In the above Paper [1] the following typographical errors should be corrected. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calls for Papers Special Issue on Real-Time Systems

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

    Publication Year: 1986, Page(s): 852
    Request permission for commercial reuse | |PDF file iconPDF (183 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1986, Page(s): 852
    Request permission for commercial reuse | |PDF file iconPDF (202 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