By Topic

Computers, IEEE Transactions on

Issue 1 • Date Jan. 1979

Filter Results

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

    Publication Year: 1979 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (467 KB)  
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1979 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (249 KB)  
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1979 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (195 KB)  
    Freely Available from IEEE
  • Bitonic Sort on a Mesh-Connected Parallel Computer

    Publication Year: 1979 , Page(s): 2 - 7
    Cited by:  Papers (64)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2104 KB)  

    An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts the n2elements into row-major order and is an adaptation of Batcher's bitonic sort. A slight modification of our algorithm yields an O(n) algorithm to sort n2elements into snake-like row-major order. Extensions to the case of a j-di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Movement and Permutation of Columns in Magnetic Bubble Lattice Files

    Publication Year: 1979 , Page(s): 8 - 15
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2283 KB)  

    In this paper, we propose a layout of access channels in a new kind of magnetic bubble memory called a bubble lattice file. We further assume that interchange of bubble columns under certain channels is possible. We then propose an algorithm for moving a column to any other location using minimal number of column interchanges. The algorithm and the proof of its optimality involves signed-digit rep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Two-Level Diagnostic Model for Digital Systems

    Publication Year: 1979 , Page(s): 16 - 27
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3395 KB)  

    This paper is concerned with the diagnosis of faulty parts in digital systems, including both the detection and location of such parts. The system model presented in this paper considers two levels: the part level at which detectability and diagnosability are defined, and the fault level at which testing is performed and at which functional units or portions thereof are defined. Parameters are def... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Analysis of Memory Conflicts and Bus Contentions in a Multiple-Microprocessor System

    Publication Year: 1979 , Page(s): 28 - 37
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2517 KB)  

    This paper studies one of the most difficult and important problems in the design of cost-effective multiple-microprocessor systems. The combined effect of interference due to bus contentions and that due to memory conflicts is investigated. Reference models are defined and applied to obtain analytic results which can prove to be valuable tools in the design of multiple-microprocessor systems for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analytic and Experimental Study of Multiple Channel Controllers

    Publication Year: 1979 , Page(s): 38 - 49
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3115 KB)  

    A multiple channel controller (MCC) is a controller which switches a given number of channels among a larger number of input/output devices and permits simultaneous access to as many devices as there are channels available. A simple queuing model for multiple channel controllers is created, and an approximate solution for this model is generated. The approximate solution is found, using simulation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Functional Form Approach to Test Set Coverage in Tree Networks

    Publication Year: 1979 , Page(s): 50 - 52
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (697 KB)  

    To efficiently perform the fault analysis of digital networks it is necessary that pertinent fault interrelationships be utilized. However, to determine these fault interrelationships can entail an analysis which is quite complex and thereby reduces the overall advantage of utilizing the gained insights in a fault analysis process. In this paper we suggest an approach to establishing the existence... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of Hazards in Combinational Switching Circuits

    Publication Year: 1979 , Page(s): 52 - 56
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1049 KB)  

    This correspondence investigates a systematic binary technique for detecting static and dynamic hazards in combinational networks. The technique is based on deriving the conditions for the occurrence of spikes and considering a hazard as a superposition of spikes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Methods of Maximum a Posteriori Restoration

    Publication Year: 1979 , Page(s): 57 - 62
    Cited by:  Papers (22)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (6616 KB)  

    An improved numerical solution method for maximum a posteriori image restoration is presented. Results of the use of this method are shown to be superior to previous MAP restorations and equal or better than some common linear restorations. A natural convergence criterion is defined and shown to be a good indicator of restoration quality. The effects of the parameters of the MAP restorations are d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maryanski's Grammatical Inferencer

    Publication Year: 1979 , Page(s): 62 - 64
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (602 KB)  

    A recent paper in this TRANSACTIONS1on an automatic inference procedure for probabilistic grammars contained major anomalies between the technique proposed and the computational examples given. These would mislead others attempting to reproduce the results and also undermine the apparent validity of what is in fact a sound technique. This letter details and corrects the anomalies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authors' Reply2

    Publication Year: 1979 , Page(s): 64
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (227 KB)  

    The authors would like to thank B. R. Gaines for his careful reading of both the paper1and the thesis [1]. Dr. Gaines is correct in pointing out that for application to the grammatical inference problem We have found, as Gaines has stated, that making this correction to the program does in fact yield more accurate models. We also concur with Dr. Gaines as to the two typographical errors... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Construction of Projectors Using Products of Elementary Matrices

    Publication Year: 1979 , Page(s): 65 - 66
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (429 KB)  

    An iterative method of constructing projection matrices on the intersection of subspaces is considered, using a product of elementary matrices. A convergence theorem with two natural assumptions, concerning the gain sequence and the order of representations of the matrices, is established. The result has an application in forming associative memories. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Number of Fanout-Free Functions and Unate Cascade Functions

    Publication Year: 1979 , Page(s): 66 - 72
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1097 KB)  

    In this correspondence, the number of functions and the number of equivalence classes of functions realized by fanout-free networks and cascades of AND'S, OR'S, and inverters are presented. For fanout-free functions, recursive formulas for TND(n) and φND(n), the number of n-p-n-equivalence classes of n-variable functions and p-equivalence classes of n-variable functions,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Transposing Large 2nx 2nMatrices

    Publication Year: 1979 , Page(s): 72 - 75
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (672 KB)  

    This correspondence presents two variations on the algorithm of Eklundh for transposing large 2n x 2n matrices. The first variation shows how the number of accesses to secondary storage may be reduced at the expense of an increased amount of data transferred. Formulas for I/O time are derived from which we deduce the disk characteristics under which there is an improvement. The second variation sh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Results of the Synthesis of Optimal Networks of AND and OR Gates for Four-Variable Switching Functions

    Publication Year: 1979 , Page(s): 76 - 85
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1697 KB)  

    This correspondence presents the results of the synthesis of optimal feed-forward networks of just AND and OR gates for representative functions of the 222 n-p-n-equivalence classes into which all functions of four or fewer variables can be categorized. (Optimality here means minimization of the number of gates as the primary objective and minimization of the number of connections as the secondary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "The Error Latency of a Fault in a Sequential Digital Circuit"

    Publication Year: 1979 , Page(s): 85 - 86
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (342 KB)  

    In the paper "The Error Latency of a Fault in a Sequential Digital Circuit," the method presented in [1] to evaluate the random test length to be applied to a sequential circuit, is called the "approximation method." We agree with this name, but wish to offer the following interpretations and clarifications (using the notations of Shedletsky and McCluskey1). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authors' Reply2

    Publication Year: 1979 , Page(s): 86
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (136 KB)  

    A recurring problem in the analysis of random testing is the tradeoff between accuracy and computational efficienlcy. Every random test requires an (implicit or explicit) analysis of the relaretionship between test confidence and test length for thle circuit under test. This analysis is used to specify a test length. The error latency model ELM [1] provides an accurate analysis of fault behavior i... View full abstract»

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

    Publication Year: 1979 , Page(s): 86
    Save to Project icon | Request Permissions | PDF file iconPDF (258 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1979 , Page(s): 86
    Save to Project icon | Request Permissions | PDF file iconPDF (138 KB)  
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1979 , Page(s): 86
    Save to Project icon | Request Permissions | PDF file iconPDF (270 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