Scheduled System Maintenance
On Tuesday, August 23, IEEE Xplore will undergo scheduled maintenance from 12:00-7:00 PM ET (16:00-23:00 UTC).
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

IEEE Transactions on Computers

Issue 1 • Date Jan. 1982

Filter Results

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

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

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

    Publication Year: 1982, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (1488 KB)
    Freely Available from IEEE
  • Design for Testability—A Survey

    Publication Year: 1982, Page(s):2 - 15
    Cited by:  Papers (181)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4125 KB)

    This paper discusses the basics of design for testability. A short review of testing is given along with some reasons why one should test. The different techniques of design for testability are discussed in detail. These include techniques which can be applied to today's technologies and techniques which have been recently introduced and will soon appear in new designs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture of a Programmable Digital Signal Processor

    Publication Year: 1982, Page(s):16 - 22
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4022 KB)

    The architecture of a programmable signal processor designed at Bell Laboratories is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing Point Enclosures

    Publication Year: 1982, Page(s):22 - 29
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3986 KB)

    Given a set of n rectangles in the plane, the point enclosure query is the question to determine for any point p which rectangles of the set it is contained in. It is the "dual" of the well-known range query in computational geometry. It is shown that the point enclosure query in the plane can be answered in 0(log n + k) time, where k is the number of rectangles reported. The solution makes use of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connectivity of Random Logic

    Publication Year: 1982, Page(s):29 - 33
    Cited by:  Papers (76)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2818 KB)

    This paper develops a relation between the partitioning properties of computer logic and the distribution of connection lengths. The computation of length distributions is important for wirability analysis and delay estimation. The principal result is that an exponential partitioning function leads to an inverse power law length distribution. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis and Optimization of Programs by Means of P-Functions

    Publication Year: 1982, Page(s):34 - 40
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2217 KB)

    A program is defined as an indexed sequence of instructions; each of these instructions is formed by an interconnection of branching (or conditional) instructions (of the form if, then, else) followed by an interconnection of execution instructions (of the form do). A program is an efficient tool, allowing the digital system designer to describe the microprograms of discrete systems and to synthes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Task Allocation Model for Distributed Computing Systems

    Publication Year: 1982, Page(s):41 - 47
    Cited by:  Papers (178)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2528 KB)

    This paper presents a task allocation model that allocates application tasks among processors in distributed computing systems satisfying: 1) minimum interprocessor communication cost, 2) balanced utilization of each processor, and 3) all engineering application requirements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elections in a Distributed Computing System

    Publication Year: 1982, Page(s):48 - 59
    Cited by:  Papers (221)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3889 KB)

    After a failure occurs in a distributed computing system, it is often necessary to reorganize the active nodes so that they can continue to perform a useful task. The first step in such a reorganization or reconfiguration is to elect a coordinator node to manage the operation. This paper discusses such elections and reorganizations. Two types of reasonable failure environments are studied. For eac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Regular Network for Multicomputer Systems

    Publication Year: 1982, Page(s):60 - 69
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2743 KB)

    As a result of recent technological developments there is an increasing interest in the interconnection of microcomputers through networks. For general computation the interconnection graphs should have short internode communication paths and should be of low degree, systematically structured, and incrementally extensible. A family of graphs, called multitree structured (MTS) having these properti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An On-Line Square Root Algorithm

    Publication Year: 1982, Page(s):70 - 75
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    In this correspondence a systematic derivation of an on-line square root algorithm is presented. The algorithm operates on variables represented in the normalized radix r floating-point system in a digit-by-digit fashion with an on-line delay of 1. The approach used in deriving the square root algorithm is described in detail. The basic characteristics of hardware-level implementation are also dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Autocorrelation Function of Filtered p-Level Maximal-Length Sequences

    Publication Year: 1982, Page(s):75 - 77
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    The autocorrelation function of nonrecursive digital filtered pseudorandom p-level (p = 2,3,5) maximal-length sequences is discussed. An extension to results given in the literature for summed binary sequences is presented and simple expressions for the correlation functions of higher level m-sequences are obtained. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "The Anomalous Behavior of Flip-Flops in Synchronizer Circuits"

    Publication Year: 1982, Page(s):77 - 78
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB)

    In the above paper1 Fleishchhammer and Dortok present a measurement system to analyze the metastable state in synchronizer circuits. We present the specific measures which have to be taken in the design for such a system to get intrinsic characterization of circuits. We propose a measurement system based on the introduction of a new parameter of synchronizer circuits allowing an accurate character... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Time and Parallel Processor Bounds for Fortran-Like Loops

    Publication Year: 1982, Page(s):78 - 81
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (779 KB)

    Dynamic characteristics of program execution must be studied in order to calculate meaningful time and parallel processor bounds. The paper entitled "Time and Parallel Processor Bounds for Fortran-Like Loops" [1] studies only the static interaction between statements within a program to arrive at these bounds. Consequently, very loose bounds are obtained for certain programs. Improved estimates of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List of Referees January 1, 1980-June 1981

    Publication Year: 1982, Page(s):82 - 85
    Request permission for commercial reuse | PDF file iconPDF (372 KB)
    Freely Available from IEEE
  • IEEE Transactions on Computers Planned Special Issues

    Publication Year: 1982, Page(s): 86
    Request permission for commercial reuse | PDF file iconPDF (81 KB)
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 1982, Page(s): 87
    Request permission for commercial reuse | PDF file iconPDF (71 KB)
    Freely Available from IEEE
  • IEEE copyright form

    Publication Year: 1982, Page(s): 87
    Request permission for commercial reuse | PDF file iconPDF (258 KB)
    Freely Available from IEEE
  • Students In Computer Science And Engineering!

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

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

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