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 6 • June 1986

Filter Results

Displaying Results 1 - 18 of 18
  • [Front cover]

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

    Publication Year: 1986, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (181 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1986, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (181 KB)
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1986, Page(s): 485
    Request permission for commercial reuse | PDF file iconPDF (849 KB)
    Freely Available from IEEE
  • 1985 Referee List

    Publication Year: 1986, Page(s):486 - 488
    Request permission for commercial reuse | PDF file iconPDF (342 KB)
    Freely Available from IEEE
  • Sructure Handling in Data-Flow Systems

    Publication Year: 1986, Page(s):489 - 502
    Cited by:  Papers (22)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3113 KB)

    Data-flow languages have been hailed as the solution to the programmability of general-purpose multiprocessors. However, data-flow semantics introduce constructs that lead to much overhead at compilation, allocation, and execution time. Indeed, due to its functionality, the data-flow model of computation does not handle repetitive program constructs very efficiently. This is due to the fact that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fault Identification Algorithm for ti-Diagnosable Systems

    Publication Year: 1986, Page(s):503 - 510
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1782 KB)

    In this paper, a new approach to identifying faulty units in ti-diagnosable systems is described. This approach exploits special properties of the highly structured ti-diagnosable systems to produce a faulty unit identification algorithm which is shown to be of time complexity O(|E|) where |E| corresponds to the number of tests in the system. The diagnosis quality of the algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Measurement-Based Model for Workload Dependence of CPU Errors

    Publication Year: 1986, Page(s):511 - 519
    Cited by:  Papers (63)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2159 KB)

    This paper proposes and validates a methodology to measure explicitly the increase in the risk of a processor error with increasing workload. By relating the occurrence of a CPU related error to the system activity just prior to the occurrence of an error, the approach measures the dynamic CPU workload/failure relationship. The measurements show that the probability of a CPU related error (the loa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Input/Output Speedup in Tightly Coupled Multiprocessors

    Publication Year: 1986, Page(s):520 - 530
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3264 KB)

    Previous models of program speedup on parallel architectures tend to ignore I/O activity and other important issues. In this paper we derive analytic speedup models including I/O activities. We show that ignoring I/O yields conservative speedup results. We explore the effectiveness of using hardware format conversion units in multiprocessors [33]. We prove that hardware parallel format conversion ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing Systolic Algorithms Using Sequential Machines

    Publication Year: 1986, Page(s):531 - 542
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2545 KB)

    We present a tool that is useful in the design and analysis of systolic systems. Specifically, we give characterizations of systolic arrays in terms of (single processor) sequential machines which are easier to program and to analyze. We give several examples to illustrate the utility of the design tool. In particular, we show how systolic designs for such problems as integer bitwise multiplicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing Multiterminal Nets Around a Rectangle

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

    The problem of connecting a set of terminals that lie on the sides of a rectangle to minimize the total area is discussed. We present an O(nm) approximation algorithm to solve this problem where n is the number of terminals and m is the number of signal nets. Our algorithm generates a solution with an area ≤1.69* OPT where OPT is the area of an optimal solution. Our algorithm routes some o... View full abstract»

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

    Publication Year: 1986, Page(s):550 - 563
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3396 KB)

    When we design networks with NOR or NAND gates which are implemented with bipolar and MOS transistors, wired logic is usually allowed. The usage of wired logic reduces the network cost and possibly improves the speed because of shorter delays on wired logic than on a gate. Typical logic functions performed by wired logic are AND and OR, which are called wired-AND and wired-OR, respectively. Proper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Control of Computer Systems

    Publication Year: 1986, Page(s):564 - 567
    Cited by:  Papers (7)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (996 KB)

    In order to be able to take full advantage of a distributed computing facility it is important not only to distribute the hardware but also to distribute the control of these resources. However, distributed control is very different from centralized control since at any time, several processes or several controllers may observe different and inconsistent views of the global system state. The task ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coping with Anomalies in Parallel Branch-and-Bound Algorithms

    Publication Year: 1986, Page(s):568 - 573
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1532 KB)

    A general technique that can be used to solve a wide variety of discrete optimization problems is the branch-and-bound algorithm. We have adapted and extended branch-and-bound algorithms for parallel processing. The computational efficiency of these algorithms depends on the allowance function, the data structure, and the search strategies. Anomalies owing to parallelism may occur. In this corresp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Unbuffered Shuffle-Exchange Networks

    Publication Year: 1986, Page(s):573 - 578
    Cited by:  Papers (65)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1203 KB)

    The throughput of unbuffered shuffle-exchange networks (also known as delta networks) is related to the arrival rate by a quadratic recurrence relation. Lower and upper bounds on the solution of this recurrence relation are derived in this paper. Two approaches for improving the throughput of unbuffered delta networks are investigated. The first approach combines multiple delta subnetworks of size... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Connecting Network with Fault Tolerance Capabilities

    Publication Year: 1986, Page(s):578 - 580
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (611 KB)

    A new multistage interconnection network is presented in this paper. It is able to handle the communications between the connected devices correctly, even in the presence of fault(s) in the network. This goal is achieved by using redundant paths with a fast procedure able to dynamically reroute the message. It is also shown that the rerouting properties are still valid when broadcasting transmissi... 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): nil2
    Request permission for commercial reuse | PDF file iconPDF (182 KB)
    Freely Available from IEEE
  • [Front cover]

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