Scheduled System Maintenance
On Saturday, October 21, single article sales and account management will be unavailable until 6 PM ET.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computers

Issue 8 • Aug. 1973

Filter Results

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

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

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

    Publication Year: 1973, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (223 KB)
    Freely Available from IEEE
  • Parallel Computation: An Introduction

    Publication Year: 1973, Page(s):709 - 710
    Request permission for commercial reuse | PDF file iconPDF (1146 KB)
    Freely Available from IEEE
  • A Comparison of Some Theoretical Models of Parallel Computation

    Publication Year: 1973, Page(s):710 - 717
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3678 KB)

    In this paper we briefly describe and compare a number of theoretical models for parallel computation; namely, Petri nets, computation graphs, and parallel program schemata. We discuss various problems and properties of parallel computation that can be studied within these formulations and indicate the ties between these properties and the more practical aspects of parallel computation. We show ho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Macro E-Nets for Representation of Parallel Systems

    Publication Year: 1973, Page(s):718 - 727
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2376 KB)

    An extension of Petri nets called evaluation nets (E-nets) has been developed for use in representation of computer systems. These lead to interpreted graphs for use in human communication and to machine-interpretable descriptions. They may be used as aids in development of simulations and planning of measurements for examining characteristics such as throughput, turnaround time, and utilization o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effect on Throughput of Multiprocessing in a Multiprogramming Environment

    Publication Year: 1973, Page(s):728 - 735
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1537 KB)

    This paper investigates some of the effects of varying the number of central processing units (CPU's) available to a multiprogramming system both when parallel processing of a single task (multitasking) is allowed and is not allowed. The variables investigated are those that would be expected to control the CPU queue length distribution and include the degree of multiprogramming, CPU service disci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiserver Queueing Models of Multiprocessing Systems

    Publication Year: 1973, Page(s):736 - 745
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2447 KB)

    Conventional time sharing and multiprogramming systems have been extensively modeled as single-server queues. In contrast, multiprocessing systems must be modeled as multiserver queueing systems. This paper investigates the effect of the scheduling strategy-a key parameter-on the performance of multiserver queues, under very general assumptions: arbitrary arrival process and arbitrary service time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules

    Publication Year: 1973, Page(s):745 - 751
    Cited by:  Papers (92)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2637 KB)

    Two problems of importance for the scheduling of multiprocessing systems composed of identical units are discussed in this paper. 1) Given a partially ordered set of computations represented by the vertices of an acyclic directed graph with their associated execution times, find the minimum number of processors in order to execute them in a time not exceeding the length of the critical path of thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation of Concurrency with Ordering Matrices

    Publication Year: 1973, Page(s):752 - 761
    Cited by:  Papers (7)  |  Patents (74)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3073 KB)

    A formal technique for the representation of tasks such that the potential concurrency of the task is detectable, and hence exploitable, during the execution of the task is described. Instructions are represented as a pair of binary vectors d and ê which completely describe the sources and sinks specified by the instruction. Tasks are represented as square matrices M called ordering matrices.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple Addition by Residue Threshold Functions and Their Representation by Array Logic

    Publication Year: 1973, Page(s):762 - 767
    Cited by:  Papers (27)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1688 KB)

    In multioperand additions p summands can be compressed into q summands by adding along the columns independently. For a given column Z with Boolean elements {zi}, this sum is Σrk2k, where rk equals a residue threshold function R(2k, 2k+1 |Z), defined by the proposition R(t, m |Z) ≡ t ⩽ (Σzi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Search Memory for Many-to-Many Comparisons

    Publication Year: 1973, Page(s):768 - 772
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1371 KB)

    This paper describes a unique associative memory mechanism in which a data base may be simultaneously searched by comparison with a substantial number of key words, or ``comparands,'' as contrasted with the usual one-comparand-at-a-time limitation. Possible search criteria include the six arithmetic relations, plus certain logical ``bit-set'' relations. At some cost in both hardware and speed, eac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-Time Algorithms and Data Management on Illiac IV

    Publication Year: 1973, Page(s):773 - 777
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1719 KB)

    In order to use the Illiac IV array processor efficiently it is necessary to have different types of data management techniques than those which are used in a serial computer. This paper describes the data organization and management techniques that were developed for a particular real-time application. The particular problems considered are: 1) the tracking of objects at different rates; 2) the r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Processing Algorithms for the Optimal Control of Nonlinear Dynamic Systems

    Publication Year: 1973, Page(s):777 - 786
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2995 KB)

    This paper describes the recent development of parallel processing algorithms for solving optimal control problems for nonlinear dynamic systems. Both the deterministic and stochastic cases are considered. The resulting algorithms are applicable to a large range of parallel architecture computers, including Iliac IV, associative processors, and potential designs based on integrated circuit technol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

    Publication Year: 1973, Page(s):786 - 793
    Cited by:  Papers (498)  |  Patents (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2696 KB)

    An mth-order recurrence problem is defined as the computation of the series x1, x2, ..., XN, where xi = fi(xi-1, ..., xi-m) for some function fi. This paper uses a technique called recursive doubling in an algorithm for solving a large class of recurrence problems on parallel computers such as the Iliac IV. Rec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Poisson Solver Amenable to Parallel Computation

    Publication Year: 1973, Page(s):793 - 796
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1213 KB)

    The matrix decomposition Poisson solver is developed for the five-point difference approximation to Poisson's equation on a rectangle. This algorithm's suitability for parallel computation, its simplicity, its performance relative to successive overrelaxation, and its generality are then discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Type Double-Rank Sequential Machine

    Publication Year: 1973, Page(s):796 - 803
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1925 KB)

    A new type of double-rank synchronous sequential machine is introduced in this paper. Its dissimilarities and similarities with the other types (Types 1 and 2) of double-rank sequential machines are discussed along with the relative merits of each type. Providing a striking example of the advantages of this new type (called Type 3) double-rank machine is a new kind of binary counter, which is high... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiform Partial Symmetry and Linearity

    Publication Year: 1973, Page(s): 804
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    It is known from a paper by Das that multiform total symmetry is equivalent to linearity. In this correspondence the results of Das are generalized and a simple proof is given to show that even for multiform partial symmetries the corresponding subfunctions are linear subfunctions. View full abstract»

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

    Publication Year: 1973, Page(s): nil2
    Request permission for commercial reuse | PDF file iconPDF (294 KB)
    Freely Available from IEEE
  • [Front cover]

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