By Topic

IEEE Transactions on Computers

Issue 9 • Sept. 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 (385 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1984, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (184 KB)
    Freely Available from IEEE
  • Note

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

    Publication Year: 1984, Page(s): 773
    Request permission for commercial reuse | PDF file iconPDF (133 KB)
    Freely Available from IEEE
  • Computational Geometry on a Systolic Chip

    Publication Year: 1984, Page(s):774 - 785
    Cited by:  Papers (36)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3780 KB)

    This paper describes systolic algorithms for a number of geometric problems. For the sake of realism we restrict our investigation to one-dimensional arrays whose communication links with the outside are located at the end cells. Implementations yielding maximal throughput are given for solving dynamic versions of convex hull, inclusion, range and intersection search, planar point location, inters... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capability Based Tagged Architectures

    Publication Year: 1984, Page(s):786 - 803
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5359 KB)

    An architecture is presented which incorporates capability based addressing and memory tagging features. It defines three kinds of mechanisms for the implementation of object types, which correspond to as many different levels of abstraction. At the lower level, there are the machine types, the operations of which are implemented by machine instructions. At the upper level, there are user types, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks

    Publication Year: 1984, Page(s):804 - 811
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2473 KB)

    We examine the problem of broadcasting in a point-to-point computer network where a message, originated by one node, is transmitted to all nodes, subject to the restriction that an informed node can call only one of its neighbors Auring a given time unit. A dynamic programming formulation for optimal broadcasting in general networks is given, and an exact algorithm based on it is developed. Since ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Optimization of a CSMA Protocol for Local Computer Networks

    Publication Year: 1984, Page(s):812 - 817
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2291 KB)

    Notable among local computer network protocols is the carrier sense multiple access (CSMA) network protocol. Many versions of CSMA have been proposed. The purpose of this paper is to derive an optimized performance of one version of CSMA, slotted nonpersistent CSMA with truncation (CSMA-SNP/TR), which is known to have better throughput performance than all other versions of CSMA. In this paper, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Integrty in Digital Optical Disks

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

    Digital optical disks are interesting as a storage medium because they combine large inexpensive storage capacity with relatively fast access. They also have a property which appears to make them attractive to the security minded, namely they do not permit bits to be rewritten. In other words, a 0 can be changed to a 1, but a 1 cannot be changed back to a 0. In a recent paper, however, Rivest and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compact Hash Tables Using Bidirectional Linear Probing

    Publication Year: 1984, Page(s):828 - 834
    Cited by:  Papers (5)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2318 KB)

    An algorithm is developed which reduces the memory requirements of hash tables. This is achieved by storing only a part of each key along with a few extra bits needed to ensure that all keys are stored unambiguously. The fraction of each key stored decreases as the size of the hash table increases. Significant reductions in total memory usage can be achieved especially when the key size is not muc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wave Scheduling—Decentralized Scheduling of Task Forces in Multicomputers

    Publication Year: 1984, Page(s):835 - 844
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2982 KB)

    Decentralized operating systems that control large multicomputers need techniques to schedule competing parallel programs called task forces. Wave scheduling is a probabilistic technique that uses a hierarchical distributed virtual machine to schedule task forces by recursively subdividing and issuing wavefront-like commands to processing elements capable of executing individual tasks. Wave schedu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic Test Pattern Generation Using Linear Codes

    Publication Year: 1984, Page(s):845 - 850
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1962 KB)

    Logic testing of today's integrated circuits is a task of increasing difficulty as the number of circuits or transistors packed onto a single chip grows higher and higher. Exhaustive pattern testing, with adequate partitioning of logic, has been explored regarding its potential in solving the problems in test pattern generation and fault coverage. In this paper, we propose a new method of simultan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of Associative Memory Using Parallel Chained Hashing

    Publication Year: 1984, Page(s):851 - 855
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (902 KB)

    Two parallel hashing algorithms based on open and chained hashing are discussed. The parallel chained hashing algorithm is efficient even in the environment where deletion and insertion frequently occur. The chained hashing memory with fewer memory banks has a performance equivalent to that of the open hashing memory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Distribution Algorithm for Shortest Paths Problem

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

    The time complexity of a distributed algorithm [5] for all-pair shortest path problem is improved by a factor 0(n) by pipelining instructions. Its implementation using VLSI technology is proposed and area complexity is computed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large Graphs with Given Degree and Diameter—Part I

    Publication Year: 1984, Page(s):857 - 860
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The following problem arises in the study of interconnection networks: find graphs of given diameter and degree having the maximum number of vertices. In this correspondence we give some constructions of graphs proving in particular that lim△∞inf N(△, D).△-D ≥ 2-D, where N(△, D) is the maximum number of vertices of a graph with degree A and diameter D. 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): 860
    Request permission for commercial reuse | PDF file iconPDF (189 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1984, Page(s): 860
    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