IEEE Transactions on Computers

Issue 3 • March 1982

Filter Results

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

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

    Publication Year: 1982, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (241 KB)
    Freely Available from IEEE
  • Counting and Reporting Intersections of d-Ranges

    Publication Year: 1982, Page(s):181 - 187
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2407 KB)

    We present a solution to the problem of reporting and counting all pairs of intersecting or overlapping d-ranges in a given set of n d-ranges. A d-range is a rectilinearly oriented rectangular d-dimensional box or brick. The three-dimensional case is presented in some detail and an 0(n log22n + k) time and 0(n log22n) space algorithm is developed for the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deadlock-Free Systems for a Bounded Number of Processes

    Publication Year: 1982, Page(s):188 - 193
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2224 KB)

    Consider a computer system in which different types of serially reusable resources are shared by several classes of processes. We assume that each process in a process class has the same known maximum claim (i.e., the maximum resource requirement), but that the actual sequence of requests is unknown. Our resource manager uses the "expedient policy" in granting requests for resources, under the con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes

    Publication Year: 1982, Page(s):194 - 207
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3247 KB)

    The purpose of this is to present an abstract regulation scheme for the orderly resolution of multiple conflicts in dynamic systems, in which comparable "claims" of the conflicting parties (to have the conflicts resolved in their favor) can precisely be formulated. The scheme rests on the notion of "synchronic distance," an invariance property by which restrictions in the system behavior that rela... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Processing Approaches to Image Correlation

    Publication Year: 1982, Page(s):208 - 218
    Cited by:  Papers (35)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3119 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dense Trivalent Graphs for Processor Interconnection

    Publication Year: 1982, Page(s):219 - 222
    Cited by:  Papers (37)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1755 KB)

    This paper presents a new family of undirected graphs that allows N processors to be connected in a network of diameter 3/2 log2 N + O(1), while only requiring that each processor be connected to three neighbors. The best trivalent graphs previously proposed require a diameter of 2 log2N + O(1). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardware Specification with Temporal Logic: An Example

    Publication Year: 1982, Page(s):223 - 231
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2978 KB)

    The use of temporal logic for the specification of hardware modules is explored. Temporal logic is an extension of conventional logic. While traditional logic is useful for specifying combinational circuits, it is shown how the extensions of temporal logic apply to the specification of memory, as well as the safeness and liveness properties of active circuits representing processes. These ideas ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Data Structure for Parallel L/U Decomposition

    Publication Year: 1982, Page(s):231 - 239
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4047 KB)

    Some new results are presented concerning the pivoting of large systems of linear equations with respect to parallel processing techniques. It will be assumed that the processing of a pivot takes one time slot. The pivoting problem is studied by means of an associated graph model. Given a triangulated graph a set of label classes is established. Class k contains all pivots which may be processed i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Markov Models for Multiple Bus Multiprocessor Systems

    Publication Year: 1982, Page(s):239 - 248
    Cited by:  Papers (61)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3923 KB)

    Markovian models are developed for the performance analysis of multiprocessor systems intercommunicating via a set of buses. The performance index is the average number of active processors, called processing power. From processing power a variety of other performance measures can be derived as dictated by the specific processor application. Exact models are first introduced and are illustrated wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Design of Multilevel Storage Hierarchies

    Publication Year: 1982, Page(s):249 - 260
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3365 KB)

    An optimization model is developed for assigning a fixed set of files across an assemblage of storage devices so as to maximize system throughput. Multiple levels of executable memories and distinct record sizes for separate files are allowed. Through the use of this model, a general class of file assignment problems is reduced to the optimization of a convex function over a convex feasible region... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Regular Layout for Parallel Adders

    Publication Year: 1982, Page(s):260 - 264
    Cited by:  Papers (495)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3145 KB)

    With VLSI architecture, the chip area and design regularity represent a better measure of cost than the conventional gate count. We show that addition of n-bit binary numbers can be performed on a chip with a regular layout in time proportional to log n and with area proportional to n. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Decomposition of Permutation Networks"

    Publication Year: 1982, Page(s): 265
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (178 KB)

    A counterexample is given to show the partial correctness of a matrix decomposition algorithm proposed by Ramanujam in 1973. It is pointed out that the edge coloring approach results in the most efficient algorithms for the decomposition problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Magnetic Bubble Memory Architectures for Supporting Associative Searching of Relational Databases"

    Publication Year: 1982, Page(s):265 - 266
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB)

    This correspondence suggests an improved double buffering algorithm for two bubble memory architectures suggested in a recent paper1 by Doty et al. The new method is more general than the original and results in a faster memory scan time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Computers Planned Special Issues

    Publication Year: 1982, Page(s): 266
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • IEEE Computer Society Press Checklist of New Titles December 1981

    Publication Year: 1982, Page(s): 266
    Request permission for commercial reuse | PDF file iconPDF (243 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1982, Page(s): 266
    Request permission for commercial reuse | PDF file iconPDF (181 KB)
    Freely Available from IEEE
  • Innovation

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