By Topic

IEEE Transactions on Computers

Issue 9 • Sept. 1985

Filter Results

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

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

    Publication Year: 1985, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (181 KB)
    Freely Available from IEEE
  • Fault-Tolerant Routing in DeBruijn Comrnunication Networks

    Publication Year: 1985, Page(s):777 - 788
    Cited by:  Papers (88)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3339 KB)

    A class of communication networks which is suitable for "multiple processor systems" was studied by Pradhan and Reddy. The underlying graph (to be called Shift and Replace graph or SRG) is based on DeBruijn digraphs and is a function of two parameters r and m. Pradhan and Reddy have shown that the node-connectivity of SRG is at least r. The same authors give a routing algorithm which generally req... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree

    Publication Year: 1985, Page(s):789 - 796
    Cited by:  Papers (211)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2487 KB)

    A high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integer multiplication, n partial products are first generated and then added up pairwise by means of a binary tree of redundant binary adders. Since parallel addition of two n-digit redundant binary numbers can be performed in a constant time independent of n without carry prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy

    Publication Year: 1985, Page(s):797 - 802
    Cited by:  Papers (95)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1929 KB)

    A cryptographic scheme for controlling access to information within a group of users organized in a hierarchy was proposed in [1]. The scheme enables a user at some level to compute from his own cryptographic key the keys of the users below him in the organization. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Encryption and Error-Correction Coding Using D Sequences

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

    This paper presents several new properties of D sequences that have applications to encryption and error coding. It also considers the problem of joint encryption and error-correction coding and proposes a solution using D sequences. The encryption operation considered is equivalent to exponentiation, which forms the basis of several public-key schemes. An application of D sequences to generating ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent Fault Detection in Microprogrammed Control Units

    Publication Year: 1985, Page(s):810 - 821
    Cited by:  Papers (36)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3493 KB)

    This paper specifies procedures for defining a monitor circuit that can detect faults in microprogram sequencers. The monitor and the sequencer operate in parallel and errors are detected by comparing outputs from the monitor circuit with outputs from the sequencer. Faults that cause errors in the flow of control are detectable, as well as some faults that cause errors only in the microinstruction... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Digital Orrery

    Publication Year: 1985, Page(s):822 - 831
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5656 KB)

    We have designed and built the Orrery, a special computer for high-speed high-precision orbital mechanics computations. On the problems the Orrery was designed to solve, it achieves approximately 10 Mflops in about 1 ft3 of space while consuming 150 W of power. The specialized parallel architecture of the Orrery, which is well matched to orbital mechanics problems, is the key to obtaining such hig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Storage Management for Temporary Values in Concurrent Programming Languages

    Publication Year: 1985, Page(s):832 - 840
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2987 KB)

    An evaluation stack, used exclusively to store temporary values in expression evaluation, is known to be an effective mechanism in the implementation of high level languages. This work considers the efficient management of evaluation stacks for concurrent programming languages. Techniques for sharing a single evaluation stack among many processes, without copying on process switches, are developed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Unsorted VLSI Dictionary Machine

    Publication Year: 1985, Page(s):841 - 852
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3005 KB)

    A systolic binary tree machine which can handle all the dictionary machine and priority queue operations such as Insert, Delete, Extract-Min, Extract-Max, Member, and Near is designed in this paper. The operations can be fed into the tree machine in a pipeline manner at a constant rate and the output is correspondingly generated in a pipeline manner. Each processor in the machine stores at most on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Doubly Linked Ring Networks

    Publication Year: 1985, Page(s):853 - 855
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    We consider networks of processors where each processor either has one in-link and one out-link, or two in-links and two out-links. We study three properties of such networks: 1) diameter, 2) connectivity, and 3) the ring property. We propose a class of networks which seem to achieve the optimum as far as these three properties are concerned. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparator with Completion Signal

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

    This note provides a design of a binary comparator with completion signal. The average propagation delay is a constant, independent of n, the number of inputs, while the logic complexity is a linear function of n. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete Basis and Computation of Elementary Functions

    Publication Year: 1985, Page(s):857 - 862
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1029 KB)

    We give necessary and sufficient conditions in order that the infinite product or sum of the terms of a positive decreasing sequence generates the reals in a given interval. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of a Constrained Regularization Program (CONTIN) on a Desktop Computer

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

    A constrained regularization program for inverting linear algebraic and integral equations (CONTIN) [l]-[3] has been implemented on an MC68000 based desktop computer supplemented with floating point accelerator hardware. Implementation of CONTIN on a desktop computer system enhances interactive capabilities and allows economical and time-efficient use of this program on a regular basis within the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Broadcast Delivery in a Videotex System

    Publication Year: 1985, Page(s):863 - 866
    Cited by:  Papers (40)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (751 KB)

    Videotex is a system which provides users with low-cost real-time access to information. In such a system, user requests are forwarded to a service computer where the desired information is retrieved and sent back to the user. In this study, we investigate the response time behavior of a videotex system where information requested by one user is broadcast to all users. A novel queueing model for b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Constant Division Routines

    Publication Year: 1985, Page(s):866 - 869
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (821 KB)

    When there is no division circuit available, the arithmetical function of division is normally performed by a library subroutine. The library subroutine normally allows both the divisor and the dividend to be variables, and requires the execution of hundreds of assembly instructions. This correspondence provides a fast algorithm for performing the integer division of a variable by a predetermined ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems

    Publication Year: 1985, Page(s):869 - 872
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (857 KB)

    The problem of diagnostic test scheduling (DTS) is to assign to each edge e of a diagnostic graph G a time interval of length l(e) so that intervals corresponding to edges at any given vertex do not overlap and the overall finishing time is minimum. In this correspondence we show that the DTS problem is NP-complete. Then we present a longest, first sequential scheduling algorithm which runs in wor... 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): 872
    Request permission for commercial reuse | PDF file iconPDF (178 KB)
    Freely Available from IEEE
  • Information for authors

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