By Topic

IEEE Transactions on Computers

Issue 7 • Date July 1985

Filter Results

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

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

    Publication Year: 1985, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (186 KB)
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1985, Page(s):585 - 587
    Request permission for commercial reuse | PDF file iconPDF (376 KB)
    Freely Available from IEEE
  • Efficient Computing of Relational Algebraic Primitives in a Database Machine Architecture

    Publication Year: 1985, Page(s):588 - 595
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2439 KB)

    Algorithms are described and analyzed for the efficient evaluation of the primitive operators of a relational algebra on a database machine architecture. The architecture contains a RAM divided up into partitions, each partition having a separate server. Tuples from the first operand relation are stored in linked lists in the partitioned RAM via bit and pointer arrays based on hashed column values... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Totally Self-Checking Checkers for Low-Cost Arithmetic Codes

    Publication Year: 1985, Page(s):596 - 601
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2142 KB)

    This paper presents totally self-checking (TSC) checkers for low-cost AN codes with generator A = 2r −1. These checkers are composed of two different parts. The first part is a TSC residue generator modulo (22r − 1), and the second part is a TSC checker for the same low-cost AN code with code length 2r. There are r output lines with two code output states: the all O's and the all 1's s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Conservativeness of Reliability Estimates Based on Instantaneous Coverage

    Publication Year: 1985, Page(s):602 - 609
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2452 KB)

    In order to remain tractable, mhany reliability models do not include the states and transitions necessary to represent fault/error-handling details. Instead, the effectiveness of fault/ error-handling mechanisms is represented by the use of instantaneous coverage probabilities. This paper investigates the effect of the error introduced by the assumption of instantaneous coverage probabilities on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated Synthesis of Combinational Logic Using Theorem-Proving Techniques

    Publication Year: 1985, Page(s):610 - 632
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4955 KB)

    Recent findings indicate that logic design still constitutes 50 percent of the total design effort, and yet few automated tools are being used in industry. The use of an automated theorem-proving system in the logic design process presents an intriguing addition to traditional design automation tools. This paper deals with the automated synthesis of combinational logic. The method consists of a th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process Scheduling in a Computer System

    Publication Year: 1985, Page(s):633 - 645
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3147 KB)

    A computer system is modeled by an exponential queueing network with different classes of customers and a general class of service policies. The mean cost per unit time is taken as the loss function. Three lower bounds of the loss function under the whole class of service policies, as well as an upper bound of the minimal loss, are derived. The loss function is expressed in a convenient form from ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding

    Publication Year: 1985, Page(s):646 - 651
    Cited by:  Papers (56)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2315 KB)

    Two conversion techniques based on the Chinese remainder theorem are developed for use in residue number systems. The new implementations are fast and simple mainly because adders modulo a large and arbitrary integer M are effectively replaced by binary adders and possibly a lookup table of small address space. Although different in form, both techniques share the same principle that an appropriat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systolic Sorting on a Mesh-Connected Network

    Publication Year: 1985, Page(s):652 - 658
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1214 KB)

    A parallel algorithm for sorting n data items in O(n) steps is presented. Its simple structure and the fact that it needs local communication only make it suitable for an implementation in VLSI technology. The algorithm is based on a merge algorithm that merges four subfiles stored in a mesh-connected processor array. This merge algorithm is composed of the perfect shuffle and odd-even-transpositi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Practical Approach to Fault Simulation and Test Generation for Bridging Faults

    Publication Year: 1985, Page(s):658 - 663
    Cited by:  Papers (67)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1225 KB)

    In this correspondence we prepent a practical approach to fault simulation and test generation for bridging faults in combinational circuits. Unlike previous work, we consider Unrestricted bridging faults, including those that introduce feedback. Our approach is based on extending fault simulation and test generation for stuck faults to cover bridging faults as well. We consider combinational test... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Symmetry Detection

    Publication Year: 1985, Page(s):663 - 666
    Cited by:  Papers (98)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (941 KB)

    A straight line is an axis ofsymmetry of a planar figure if the figure is invariant to reflection with respect to that line. The purpose of this correspondence is to describe an O( n log n) time algorithm for enumerating all the axes of symmetry of a planar figure which is made up of (possibly intersecting) segments, circles, points, etc. The solution involves a reduction of the problem to a combi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Shift X Parity Watch Algorithm for Raster Scan Displays

    Publication Year: 1985, Page(s):666 - 673
    Cited by:  Papers (3)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1466 KB)

    The Shift X Parity Watch algorithm is a practical method for achieving polygon filling on a raster scan display, at video rates, using relatively inexpensive hardware. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correlation of Adjacent Pixels for Multiple Image Registration

    Publication Year: 1985, Page(s):674 - 677
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (693 KB)

    A new method of accomplishing multiple image registration based on correlation of adjacent pixels along the rdws and columns of digital images is presented along with an efficient hardware implementation architecture. The method described requires fewer arithmetic operations for software implementation and is more suitable for hardware implementation than the most widely accepted cross-correlation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Regular Fault-Tolerant Architecture for Interconnection Networks

    Publication Year: 1985, Page(s):677 - 680
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2035 KB)

    A regular communication architecture for large distributed systems is presented. The system topology consists of n = rm nodes, r ≥2, m ≥ 2, with internode connectivity of (r − 1) m. The system is fault tolerant of (r − 1)m −1 node failures for m ≥ 3. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "Modeling and Test Generation Algorithms for MOS Circuits"

    Publication Year: 1985, Page(s): 680
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1345 KB)

    In the above paper,1 the authors' photographs were inadvertently switched. The biographies and photographs should have appeared as follows. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

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

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