IEEE Transactions on Computers

Issue 5 • May 1981

Filter Results

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

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

    Publication Year: 1981, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (222 KB)
    Freely Available from IEEE
  • Optimal Layout of CMOS Functional Arrays

    Publication Year: 1981, Page(s):305 - 312
    Cited by:  Papers (170)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2438 KB)

    Designers of MOS LSI circuits can take advantage of complex functional cells in order to achieve better performance. This paper discusses the implementation of a random logic function on an array of CMOS transistors. A graph-theoretical algorithm which minimizes the size of an array is presented. This method is useful for the design of cells used in conventional design automation systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Classes of Positive, Negative, and Imaginary Radix Number Systems

    Publication Year: 1981, Page(s):312 - 317
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3317 KB)

    A unified approach to a broad class of finite number representation systems is proposed. This class contains aDl positive and negative radix systems and other well-known number systems. In addition, it can be extended to include imaginary radix number systems. The proposed approach enables us to develop a single set of algoritims for arithmetic operations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analysis of a Tandem Queueing System for Flow Control in Computer Networks

    Publication Year: 1981, Page(s):318 - 324
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2141 KB)

    A tandem queueing system with constant slotted service times and threshold control is modeled and analyzed in this paper. The input to the first queue is controlled by the buffer occupancy of the second queue. When the second queue has more than No customers, the input to the first queue will be rejected. The input to the second queue consists of the output from the first queue and an external inp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Universality of the Shuffle-Exchange Network

    Publication Year: 1981, Page(s):324 - 332
    Cited by:  Papers (88)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4046 KB)

    This paper has focused on the realization of every arbitrary permutation with the shuffle-exchange network. Permutation properties of shuffle-exchange networks are studied and are used to demonstrate several universal networks. It is concluded that 3(log2 N) –1 passes through a single-stage regular shuffle exchange network are sufficient to realize every arbitrary permutation where N is netw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Self-Routing Benes Network and Parallel Permutation Algorithms

    Publication Year: 1981, Page(s):332 - 340
    Cited by:  Papers (129)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2933 KB)

    A Benes permutation network capable of setting its own switches dynamically is presented. The total switch setting and delay time for the N input utput self-routing network is O(log N). It is shown that the network is capable of performing a rich class of permutations. The self-routing scheme leads to efficient O(log N) parallel algorithms to perform the same class of permutations on cube connecte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations

    Publication Year: 1981, Page(s):341 - 356
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4973 KB)

    It is possible to improve the paging performance of a program by applying transformations to the source program that improve data access locality. We discuss this subject in general terms, including automation of these transformations, and present a number of such transforms. This is followed by experimental results which indicate that these transformations are indeed effective. Use of practical, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple Procedure to Generate Optimum Test Patterns for Parity Logic Networks

    Publication Year: 1981, Page(s):356 - 358
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1580 KB)

    A simple procedure to produce a minimum length test set for a parity network is presented. If M is the largest fan in of any EX-OR gate element in the tree, 2M test patterns are chosen by considering only 2M test sequences, of length 2M, assigned to each signal line. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditions for the Existence of Fast Number Theoretic Transforms

    Publication Year: 1981, Page(s):359 - 360
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (446 KB)

    A new theorem that gives necessary and sufficient conditions for the existence of computationally fast number theoretic transforms is presented. The theorem combines the general conditions for the existence of number theoretic transforms in the rings of integers modulo m with two conditions for high computational efficiency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Observations on Equivalence Handling Methods

    Publication Year: 1981, Page(s):361 - 362
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    The online disjoint set union problem is solved essentially by implementing two operations which manipulate disjoint sets. FIND(x) computes the name of the unique set of which x is a member. UNION(A,B) merges the two sets A and B into one new set named either A or B. Given a set of n elements, we may perform f ≥ n FIND's and n−1 intermixed UNION's in time 0(fα(f,n)) and space 0(n)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum Broadcast Trees

    Publication Year: 1981, Page(s):363 - 366
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (981 KB)

    "Broadcasting" is an information dissemination process in which a member of a system generates a message communicated to all other members. We model this process by ordered rooted trees and investigate a special class of rooted trees allowing broadcasting from the root to all other vertices of the tree in the minimum time (over all rooted trees with n vertices). We characterize trees from this cla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages

    Publication Year: 1981, Page(s):366 - 370
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    A class of machines capable of recognizing two-dimensional sequential/parallel matrix languages is introduced. It is called "finite-turn repetitive checking automata" (FTRCA). This checking automaton is provided with three READ-WRITE heads, one READ only head, and a control register in its memory to keep track of the internal transition states and the stack symbols. The value of the register range... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SIMD Machines and Cellular d-Graph Automata

    Publication Year: 1981, Page(s):370 - 372
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (565 KB)

    A formal model for processor networks, the cellular d-graph automaton, is described, and its equivalence to Siegel's formal model for SIMD machines is discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver"

    Publication Year: 1981, Page(s): 372
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    For the above-named paper (ibid., vol. C-29, pp. 1104-1113, December 1980), lines 21 and 22 of Fig. 5 on p. 1111 are corrected. 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: 1981, Page(s): 372
    Request permission for commercial reuse | PDF file iconPDF (164 KB)
    Freely Available from IEEE
  • Call for Papers

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