IEEE Transactions on Computers

Issue 11 • Nov. 1969

Filter Results

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

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

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

    Publication Year: 1969, Page(s): 985
    Request permission for commercial reuse | |PDF file iconPDF (120 KB)
    Freely Available from IEEE
  • 1969 IEEE Computer Group Conference

    Publication Year: 1969, Page(s): 986
    Request permission for commercial reuse | |PDF file iconPDF (1232 KB)
    Freely Available from IEEE
  • Cluster Mapping with Experimental Computer Graphics

    Publication Year: 1969, Page(s):987 - 991
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (892 KB)

    The unsupervised estimation problem has been conveniently formulated in terms of a mixture density. It has been shown that a criterion naturally arises whose maximum defines the Bayes minimum risk solution. This criterion is the expected value of the natural log of the mixture density. By making the assumptions that the component densities in the mixture are truncated Gaussian, the criterion has a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing the Performance of a Drum-Like Storage

    Publication Year: 1969, Page(s):992 - 997
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1456 KB)

    This paper analyzes the performance, for a particular strategy, of a head-per-track type auxiliary storage system in a real-time environment. The prototype system of either fixed-head disks or drums incorporates a hardware queuer. This device attempts to always select first that request for a data transfer which will incur the shortest rotational latency relative to all other possible waiting file... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and Optimization of a Queueing Model of a Real-Time Computer Control System

    Publication Year: 1969, Page(s):997 - 1003
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (976 KB)

    A single processor provides service to jobs of several different priority classes. The priority ordering remains constant over time; however, the type of priority, i. e., preemptive or nonpreemptive, may depend upon the stage of processing of the job occupying the processor. We allow these preemptible and nonpreemptible intervals to be specified in a relatively arbitrary fashion. If a job is inter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Factors Affecting the Efficiency of A Virtual Memory

    Publication Year: 1969, Page(s):1004 - 1008
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2197 KB)

    This paper compares empirical results that have been obtained for several virtual memory swapping algorithms. The algorithms were tested as software components of a multiple computer on-line system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equipment Configuration in Balanced Computer Systems

    Publication Year: 1969, Page(s):1008 - 1012
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1072 KB)

    A computer system is said to be balanced whenever the set of running programs presents a total demand, for both processors and memory, that matches the available equipment. The equipment configuration, here defined as the proper relative capacities of processor and memory resources in a balanced computer system, may be determined analytically. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds for Maxium Parallelism in a Bilogic Graph Model of Computations

    Publication Year: 1969, Page(s):1012 - 1014
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (684 KB)

    Given an acyclic directed graph where vertices represent computational tasks, arcs represent transfer of control, and two labels—called input and output logics—associated with each vertex show either the concurrency or the mutual exclusiveness of tasks, procedures are given to determine a lower and an upper bound on the number of processors required for maximum parallelism. The lower b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Preemptive Scheduling on Two-Processor Systems

    Publication Year: 1969, Page(s):1014 - 1020
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1484 KB)

    One of the important potentials of multiprocessor systems is the ability to speed the completion of a computation by concurrently processing independent portions of the job. In this paper we consider the static scheduling of computations for a system containing two indentical processors. The object is to complete the computation in the minimum amount of time. A computation is assumed to be specifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priority Assignment in a Network of Computers

    Publication Year: 1969, Page(s):1021 - 1026
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1423 KB)

    This research is aimed at developing analytical tools for system modeling and analysis of real-time computer networks. We formulate an idealized mathematical model for a multiserver system with a finite length nonpreemptive priority queue. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Timed-Shared Digital Filter Realization

    Publication Year: 1969, Page(s):1027 - 1030
    Cited by:  Papers (1)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (770 KB)

    A special-purpose computer organization of a time-shared digital filter suitable for real-time applications is described. The computer is organized in functional modules so that the order of the filter, the coefficients of the filter, the programming form of the filter, and the multiplexing scheme for the filter are readily adaptable to system needs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Programmable Data Concentrator for a Large Computing System

    Publication Year: 1969, Page(s):1030 - 1038
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2034 KB)

    Most large time-sharing computers require some sort of a data concentrator or multiplexor to accept inputs from a large number of low-speed remote terminals. Two major disadvantages of most of these concentrators are that they are nonprogrammable and relatively expensive. This paper describes the use of a small microprogrammed computer with a special instruction wired into the READ-ONLY memory to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Behavior of TSS/8: a PDP-8 Based Time-Sharing System

    Publication Year: 1969, Page(s):1038 - 1043
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1228 KB)

    TSS/8 is an existence proof for a small-scale time-sharing system. Design, development, and performance analysis have occurred in quasiparallel. Performance analysis includes two models and two levels of simulation (using SIMULA). The final simulation, an accurate model of the real operating system, predicts the observed behavior. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Control Unit for a DEC PDP-8 Computer and a Burroughs Disk

    Publication Year: 1969, Page(s):1044 - 1048
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (875 KB)

    The control unit maps a semicontinuous address space of the computer into a segmented BCD-addressed address space of the disk. An interesting buffering system provides for the maximum memory access time of the PDP-8 and high disk transfer rate. In principle, the buffering could be generalized to handle arbitrarily long waiting delays. The position of the disk may be read under program control. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Process-Control Language

    Publication Year: 1969, Page(s):1049 - 1053
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1242 KB)

    This paper proposes a compatible extension of PL/I as a general-purpose process-control language which makes analog and digital real-time variables available in essentially the same manner as conventional PL/I variables. Provisions are made for handling external interrupts and scheduling of tasks, including periodic tasks and groups of tasks. Implementation problems are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis and Analysis: A Flexible Technique for Processing Command Language

    Publication Year: 1969, Page(s):1053 - 1061
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1584 KB)

    This paper describes a simple, efficient, and highly flexible technique for interpreting and processing commands entered by operators and other users of a computer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study of "Look-Aside" Memory

    Publication Year: 1969, Page(s):1062 - 1064
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (496 KB)

    A small, but fast, associative memory can be used in a "look-aside" manner to improve the overall memory performance of a computer. For a 128-cell 100-ns associate memory working with a 1-us main memory, the effective memory cycle time is reduced to between 350-to 400-ns. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital Letdown Computer for Vertical Guidance

    Publication Year: 1969, Page(s):1065 - 1068
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (472 KB)

    In the near future, vertical take-off and landing (VTOL) aircraft will be flying a wide envelope of complex trajectories in the terminal area to relieve airport congestion. The digital letdown computer automatically guides a VTOL aircraft along a preselected vertical profile to the terminal area. View full abstract»

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

    Publication Year: 1969, Page(s):1069 - 1072
    Request permission for commercial reuse | |PDF file iconPDF (5531 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Publication Year: 1969, Page(s):1073 - 1090
    Request permission for commercial reuse | |PDF file iconPDF (5022 KB)
    Freely Available from IEEE
  • Blank Page

    Publication Year: 1969, Page(s): 1090
    Request permission for commercial reuse | |PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Blank Page

    Publication Year: 1969, Page(s): 1090
    Request permission for commercial reuse | |PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Information for authors

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