Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computers

Issue 3 • March 1986

Filter Results

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

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

    Publication Year: 1986, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (184 KB)
    Freely Available from IEEE
  • Mapping Homogeneous Graphs on Linear Arrays

    Publication Year: 1986, Page(s):189 - 209
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5357 KB)

    This paper presents a formal model of linear array processors suitable for VLSI implementation as well as graph representations of programs suitable for execution on such a model. A distinction is made between correct mapping and correct execution of such graphs on this model and the structure of correctly mappable graphs are examined. The formalism developed is used to synthesize algorithms for t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcast Communications and Distributed Algorithms

    Publication Year: 1986, Page(s):210 - 219
    Cited by:  Papers (39)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3292 KB)

    The paper addresses ways in which one can use "broadcast communication" in distributed algorithms and the relevant issues of design and complexity. We present an algorithm for merging k sorted lists of n/k elements using k processors and prove its worst case complexity to be 2n, regardless of the number of processors, while neglecting the cost arising from possible conflicts on the broadcast chann... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Models of Multiple Bus Multiprocessor Systems

    Publication Year: 1986, Page(s):220 - 228
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2719 KB)

    Two classes of approximate models are developed for multiprocessor systems containing P processors, M memories, and B buses. One class of models is based on the flow equivalence technique for the approximate analysis of queueing networks. A memory invariance principle is presented and used to obtain the parameters of this model. This approach is used to model homogeneous processor systems where me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Performance Evaluation of EXMAN: An EXtended MANchester Data Flow Computer

    Publication Year: 1986, Page(s):229 - 244
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4972 KB)

    Data flow computers are high-speed machines in which an instruction is executed as soon as all its operands are available. This paper describes the EXtended MANchester (EXMAN) data flow computer which incorporates three major extensions to the basic Manchester machine. As extensions we provide a multiple matching units scheme, an efficient, implementation of array data structure, and a facility to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Asynchronous Parallel Interpreter for Arithmetic Expressions and Its Evaluation

    Publication Year: 1986, Page(s):245 - 256
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2635 KB)

    We define some decomposition schema of the derivation trees of an arithmetic infix grammar into a set of subtrees. From the parenthesis nesting of an arithmetic expression this decomposition determines a cover of its derivation tree by a set of subtrees with known syntactic properties. We define from this a recursive interpretation actor. Roughly speaking, for a given arithmetic expression, this i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Exchange Optimization in Reconfigurable

    Publication Year: 1986, Page(s):257 - 273
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4118 KB)

    The objective of this paper is to develop fast techniques of data exchange optimization with the use of reconfigurable binary trees. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting Sneak Paths in Transistor Networks

    Publication Year: 1986, Page(s):274 - 278
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    In an MOS transistor network information can propagate through transistors and connections in both directions. Sometimes, however, it is intended to propagate in one direction only. Propagation in the wrong direction, causing a so called sneak path, could result in a functional error. We present an almost linear algorithm for detecting such sneak paths. Only consistent sneak paths, i.e., only path... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Reconfiguration Strategies for Reconfigurable Computer Systems with no Repair

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

    In this correspondence, we study the problem of finding optimal reconfiguration strategies for a class of reconfigurable fault- tolerant computer systems in which there is no repair in failed components. The problem of finding optimal reconfiguration strategies consists of determining, for each failed state of the system, the operational state into which the system should reconfigure itself. We pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Fault-Tolerant Distributor Communication Architecture

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

    A new routing algorithm is proposed in this correspondence for the network architecture developed in [1]. It has been shown that this algorithm gives the shortest path between the source to destination, when all the processors and the communication links of the network are non- faulty. For the situation when some of the processors are faulty, a heuristic function is given, which if used in the rou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "The Design of a Reliable Remote Procedure Call Mechanism"

    Publication Year: 1986, Page(s):283 - 284
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (538 KB)

    In the above correspondence1 a remote procedure call mechanism is proposed that uses a system-wide sequence number to eliminate duplicate and orphan messages. We show that the described mechanism also discards valid messages. A brief description is provided of an alternative scheme that avoids this problem. 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: 1986, Page(s): 284
    Request permission for commercial reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • Information for authors

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