By Topic

IEEE Transactions on Computers

Issue 12 • Date Dec. 1979

Filter Results

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

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

    Publication Year: 1979, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (220 KB)
    Freely Available from IEEE
  • Sequential Evaluation of Boolean Functions

    Publication Year: 1979, Page(s):879 - 887
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2642 KB)

    This paper presents methods for iterative evaluation of Boolean expressions suitable, e. g., in sequential search and matching when the input variables appear in sequence. The sum-of-product form is assumed and the clue is to partially compute the values of all products partially for each new variable being defined. It is shown that the additive use of an expression for the complementary function ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent Magnetic Bubble Memories and Their Applications in Data Base Management Systems

    Publication Year: 1979, Page(s):888 - 906
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3215 KB)

    We are concerned here with the design of intelligent magnetic bubble memories which may be used to support high-level data base management functions. They may also be used to provide users with large work spaces in which elementary file processing operations may be performed without external intervention. It is our intent to explore ways of incorporating in the design of these memories the novel c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Model of SIMD Machines and a Comparison of Various Interconnection Networks

    Publication Year: 1979, Page(s):907 - 917
    Cited by:  Papers (54)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3257 KB)

    A formal mathematical model of single instruction stream-multiple data stream (SIMD) machines is defined. It is used as a basis for analyzing various types of interconnection networks that have been discussed in the literature. The networks are evaluated in terms of the lower and upper bounds on the time required for each of the networks discussed to simulate the other networks. SIMD machine algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-Component Complexity of Two Approaches to Multioperand Binary Addition

    Publication Year: 1979, Page(s):918 - 926
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2507 KB)

    Component and time complexity measures in terms of number of gates and gate delays, respectively, are derived for two multioperand adder structures: a tree of carry-save adders and a tree of carry-lookahead adders. The parameters of the complexity measures are operand length, number of operands, and maximum fanin to the gates. The analysis involves a constructive derivation of the complexity of ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple Model of Processor—Resource Utilization in Networks of Communicating Modules

    Publication Year: 1979, Page(s):927 - 929
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB)

    A simple model of a system of processors competing for resources is presented. It permits the derivation of upper bounds for the utilization of the system components that are surprisingly close to those previously obtained from far more complicated analyses or simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Microprogrammed Control for Specialized Processors

    Publication Year: 1979, Page(s):930 - 934
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1992 KB)

    Several microprogramming techniques suitable for the control of specialized processors are presented. The controllers are developed by restricting the next state function of a classical Moore machine, and by using microprogramming in their implementation The concept is well matched to applications which do not require complex branching logic, and is optimized for efficient implementation with comm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unified Matrix Treatment of Discrete Transforms

    Publication Year: 1979, Page(s):934 - 938
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (537 KB)

    An unified matrix treatment is developed for some discrete transforms such as Haar (HT), rationalized Haar (RHT), rapid (RT), modified Wash–Hadamard (MWHT), Hadamard– Haar (HHT)r, and rationalized Hadamard–Haar (RHHT)r. For RT a technique for recovering the data sequence from the transform vector is presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput and Time Delay Analysis for a Common Queue Configuration in a Multiprocessor Enviromnent

    Publication Year: 1979, Page(s):939 - 941
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (633 KB)

    The time delay-throughput characteristic of a two-processor system serving two Poisson-arriving job classes through a common queue configuration is investigated and compared to that of a two-processor system, with each processor dedicated to one of the job classes. To carry out the queueing analysis of the common queue scheme an approximate yet accurate expression for the waiting time is introduce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Computational Complexity of a Class of Minimization Algorithms for Switching Functions

    Publication Year: 1979, Page(s):941 - 943
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (521 KB)

    Most minimization algorithms produce an irredundant sum of products by first generating all prime implicants of a switching function. In this note we show that such an approach can be a wasteful one for an already complex problem. Specifically we show that there are functions for which the useful prime implicants form an extremely small fraction of all prime implicants, where we define a prime imp... View full abstract»

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

    Publication Year: 1979, Page(s):943 - 944
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB)

    A Golomb ruler has m division marks with the spacings between marks positive integers such that the set of (m2 − m)/2 measurements which can be made between the marks are distinct. A fast search procedure is outlined for determining the shortest ruler. For 12 marks the shortest ruler is 85 units. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Inner Product Computers"

    Publication Year: 1979, Page(s): 944
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (155 KB)

    The results for different hardware configurations of inner product computers presented by Swartzlander et al.1 are in error. In their Table I, the pipelined quasi-serial processor is credited with the ability to evaluate a complete inner product in 10 ns. The clock rate may be 10 ns but several clocks are required to evaluate one inner product. (Note the serial adder feeding the result register in... View full abstract»

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

    Publication Year: 1979, Page(s):945 - 947
    Request permission for commercial reuse | PDF file iconPDF (332 KB)
    Freely Available from IEEE
  • 1979 Index IEEE Transactions on Computers Vol. C-28

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

    Publication Year: 1979, Page(s): 947
    Request permission for commercial reuse | PDF file iconPDF (263 KB)
    Freely Available from IEEE
  • Proceedings of the Conference on Specifications of Reliable Software

    Publication Year: 1979, Page(s): 947-n
    Request permission for commercial reuse | PDF file iconPDF (1224 KB)
    Freely Available from IEEE
  • 254: Proceedings: Compcon 79 Fall "Using Microprocessors—Extending our Reach"

    Publication Year: 1979, Page(s): 947-o
    Request permission for commercial reuse | PDF file iconPDF (1264 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1979, Page(s): 947
    Request permission for commercial reuse | PDF file iconPDF (147 KB)
    Freely Available from IEEE
  • Now Available from the IEEE Computer Society

    Publication Year: 1979, Page(s): 947-q
    Request permission for commercial reuse | PDF file iconPDF (1216 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