Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

IEEE Transactions on Computers

Issue 3 • March 1984

Filter Results

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

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

    Publication Year: 1984, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (190 KB)
    Freely Available from IEEE
  • Testing the Coordination Predicate

    Publication Year: 1984, Page(s):201 - 208
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2591 KB)

    A collection of parallel processors is said to be coordinated if each write from one processing element (PE) to another is answered by a read. We report on an efficient algorithm to test coordination for parallel programs in which the code for each PE is a loop. We also test a weaker predicate for parallel algorithms with oblivious PE codes and we show that the general problem is PSPACE-hard. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separability —An Approach to Physical Database Design

    Publication Year: 1984, Page(s):209 - 222
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4577 KB)

    A theoretical approach to the optimal design of a large multifile physical database is presented. The design algorithm is based on the theory that, given a set of join methods that satisfy a certain property called separability, the problem of optimal assignment of access structures to the whole database can be reduced to the subproblem of optimizing individual relations independently of one anoth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Diagnosis Algorithm for Distributed Computing Systems with Dynamic Failure and Repair

    Publication Year: 1984, Page(s):223 - 233
    Cited by:  Papers (72)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3400 KB)

    The problem of designing distributed fault-tolerant computing systems is considered. A model in which the network nodes are assumed to possess the ability to "test" certain other network facilities for the presence of failures is employed. Using this model, a distributed algorithm is presented which allows all the network nodes to correctly reach independent diagnoses of the condition (faulty or f... View full abstract»

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

    Publication Year: 1984, Page(s):234 - 240
    Cited by:  Papers (55)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3161 KB)

    In the theory of t-fault-diagnosable systems, one first chooses a set of diagnostic tests, then seeks the results of these tests, and finally proceeds to use the test results to identify the faulty units assuming that the number of faulty units does not exceed t. Nakajima was the first to suggest a departure from this practice. He proposed to adaptively choose the tests and to seek their results u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-Tolerance of Dynamic-Full-Access Interconnection Networks

    Publication Year: 1984, Page(s):241 - 248
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2780 KB)

    A β-network is an interconnection network composed of 2 ×2 crossbar switches called β-elements. This paper presents an analysis of the fault-tolerance of β-networks. A fault model is specified which allows β-elements to be stuck in either of their two normal states. A new connectivity property called dynamic full access (DFA) is introduced which serves as the criterion for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measurement and Analysis of HYPERchannel Networks

    Publication Year: 1984, Page(s):249 - 260
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3601 KB)

    In this paper we consider HYPERchannel adapter local networks, the most oft used approach to realizing very high speed (50 Mbit/s transmission rates) local networks. We first describe the channel selection, channel access, and virtual circuit protocols used in HYPERchannel networks. Next, to characterize adapter network performance we present and interpret a series of measurements obtained from an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Partitioning Approach to the Design of Selection Networks

    Publication Year: 1984, Page(s):261 - 268
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2694 KB)

    The (m,n) selection problem is defined as the selection of the m smallest numbers in any order from a set of n numbers (m ≤n). In this paper, we have proposed a class of design procedures for selection networks based on partitioning. Conditions are defined so that the optimal design can be found in polynomial time. The resulting selection network has O([log2n] · [log... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probability of State Transition Errors in a Finite State Machine Containing Soft Failures

    Publication Year: 1984, Page(s):269 - 277
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2357 KB)

    A Markov model of a finite state machine realization containing gates and memory elements each subject to internal soft errors is given and a computational method for determining the probability of state transition errors is presented. The system inputs are taken as stochasticaily driven and the long-run stationary probability distribution of the states is developed. Similar results are determined... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual Tree Machines

    Publication Year: 1984, Page(s):278 - 280
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (542 KB)

    A virtual tree machine consists of a fixed finite network of processors together with a suitable algorithm for deciding when and where to solve each subproblem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Deterministic Model for Evaluating the Performance of a Multiple Processor System with a Shared Bus

    Publication Year: 1984, Page(s):281 - 285
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The operation and performance of a multiple processor system with a shared bus is studied. The model developed is applicable to real time computations consisting of two pipelined tasks in which the first task is partitioned into a number of independent subtasks that are executed in parallel. It is proved that after a number of task executions the operation of the system becomes periodic. The speed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Totally Self-Checking Checker for 1-out-of-3 Code

    Publication Year: 1984, Page(s): 285
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    A combinational totally self-checking checker for the 1-out-of-3 code using a combined fixed-weight code is presented. The design method is illustrated by an example. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of Single-Layer Routing

    Publication Year: 1984, Page(s):286 - 288
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1426 KB)

    The problem of routing wires between pairs of terminals over a two-dimensional grid is shown to be NP-complete. Actually, the stronger result of routing over any planar graph with no vertex having degree greater than 3 is shown to be NP-complete. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "A Pipelined Distributed Arithmetic PFFT Processor"

    Publication Year: 1984, Page(s): 288
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1031 KB)

    In the above paper,1due to a typesetter's error, an incorrect biography appeared with the photograph of Jui Lin Yen. Dr. Yen's correct photograph and biography are given below. 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: 1984, Page(s): 288
    Request permission for commercial reuse | PDF file iconPDF (166 KB)
    Freely Available from IEEE
  • Information for authors

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