By Topic

IEEE Transactions on Computers

Issue 11 • Date Nov. 1985

Filter Results

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

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

    Publication Year: 1985, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (187 KB)
    Freely Available from IEEE
  • Parallel Computer Architectures and Problem Solving Strategies for the Consistent Labeling Problem

    Publication Year: 1985, Page(s):973 - 980
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3034 KB)

    Parallel computer architectures and problem solving strategies for the consistent labeling problem are studied. Problem solving factors include: processor intercommunication methods, passing order, and selection of the initial processor to receive the problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Instruction-Scheduling Model for a Class of Vector Processors

    Publication Year: 1985, Page(s):981 - 995
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4215 KB)

    An integer programming model that portrays the architectural features of a class of vector and array processors has been developed. This model is used to produce optimal schedules for low-level-instruction codes of such processors. Optimal schedules are produced for both straight codes and instruction loops. Loop scheduling is separately considered because of special consideration that must be giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arithmetic Specification for Scientific Computation in ADA

    Publication Year: 1985, Page(s):996 - 1005
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2461 KB)

    Usually, higher programming languages provide a floating point arithmetic without specifying the accuracy of the operations. In contrast, ADA defines the operations by means of model numbers and rounding (see [2], [11]). Nevertheless, this definition is not strong enough to satisfy the modern requirement of maximum accuracy in all spaces of scientific computation (see [7]-[9]). By this we mean tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Short-Packet Transfer Performance in Local Area Ring Networks

    Publication Year: 1985, Page(s):1006 - 1014
    Cited by:  Papers (34)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2678 KB)

    The performance of various access control protocols for bit-serial local area computer network (LACN) rings is studied. Applications in which mnessage packets are of fixed length and shorter than the total inherent propagation delay around the ring are the focus of attention. Token, slotted, and static and dynamic insertion rings are included in the study. In all cases, the transmitting station is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Database Machine for Very Large Relational Databases

    Publication Year: 1985, Page(s):1015 - 1025
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3528 KB)

    This paper presents an architectural design for a back-end database machine (DBM) suitable for supporting multiple-user, on-line, very large relational database systems (systems with capacities larger than 1010 bytes). This machine is called the Michigan Relational Database Machine (MIRDM). In designing such a machine a structured approach is followed. First, the DBM's proposed so far are reviewed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic Unidirectional Error-Detecting Codes

    Publication Year: 1985, Page(s):1026 - 1032
    Cited by:  Papers (85)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2595 KB)

    The theory and design of systematic t-unidirectional error-detecting codes are developed. Optimal systematic codes capable of detecting 2, 3, and 6 unidirectional errors using 2, 3, and 4 check bits, respectively, are given. For r ≥5 where r is the number of check bits, the systematic codes described here can detect up to 5· 2r-4 + r -4 unidirectional errors. Encoding/ decoding methods ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gracefully Degradable Processor Arrays

    Publication Year: 1985, Page(s):1033 - 1044
    Cited by:  Papers (51)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3186 KB)

    A new approach to the design of gracefully degradable processor arrays is discussed. Fault tolerance and graceful degradation are achieved by simultaneously reconfiguring the processor array and the algorithm in execution. Two types of algorithm reconfigurability are considered, namely, row reconfigurability (RR) and row-column reconfigurability (RCR). correspondingly, two array reconfiguration sc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding Interferences Between Rectangular Paths

    Publication Year: 1985, Page(s):1045 - 1049
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2143 KB)

    The paper examines the problem of counting all interferences between a set of rectangular paths. Tight upper bounds on the number of overlaps and intersections between two or more rectangular paths are derived both for the general case and the special cases where the backtracking is not allowed in one or both directions. An optimal algorithm for counting all interferences for both the special and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonbinary Arithmetic AN Codes Using Odd Radix Expressions

    Publication Year: 1985, Page(s):1050 - 1056
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2053 KB)

    Arithmetic AN codes are useful for error correction in both arithmetic operations and digital data transmission. This paper presents a theoretical approach to a new class of nonbinary arithmetic AN codes using symmetric R-ary expressions and Lee-type arithmetic distance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Bit Steering in the Minimization of the Control Memory of Microprogrammed Processors

    Publication Year: 1985, Page(s):1057 - 1061
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (970 KB)

    The microcommands constituting the microprogram of the control memory of a microprogrammed processor can be partitioned into a number of disjoint sets. Some of these sets are then encoded to minimize the word width of the ROM storing the microprogram. A further reduction in the width of the ROM words can be achieved by a technique known as bit steering where one or more bits are shared by two or m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Algorithms and Architectures for Optimal State Estimation

    Publication Year: 1985, Page(s):1061 - 1068
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1594 KB)

    Optimal state estimation procedures, such as the Kalman-Bucy filter, require a high-speed parallel implementation to fully realize their potential. This correspondence first analyzes and restructures these equations based on an expression tree representation. The resulting equations are then simulated on three proposed SIMD architectures (rectangular systolic array, linear array, and quad-clustere... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further Comments on "The Reliability of Periodically Repaired n –l/n Parallel Redundant Systems"

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

    In the original correspondence,1 Cantarella assumed a system consisting ot n parallel identical elements, each with a constant failure rate A. The system is repaired every T hours. An approximation n(n -1) A2T/2 for the average failure rate was derived. In further correspondence, 2 Nilsson derived an exact ciosed form expression for the failure rate. In this comment, we correct an algebraic error ... 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: 1985, Page(s): 1068
    Request permission for commercial reuse | PDF file iconPDF (182 KB)
    Freely Available from IEEE
  • Information for authors

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