By Topic

IEEE Transactions on Computers

Issue 3 • Date March 1985

Filter Results

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

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

    Publication Year: 1985, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion

    Publication Year: 1985, Page(s):197 - 203
    Cited by:  Papers (182)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2375 KB)

    A graph matching approach is proposed in this paper for solving the task assignment problem encountered in distributed computing systems. A cost function defined in terms of a single unit, time, is proposed for evaluating the effectiveness of task assignment. This cost function represents the maximum time for a task to complete module execution and communication in all the processors. A new optimi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load Sharing in Distributed Systems

    Publication Year: 1985, Page(s):204 - 217
    Cited by:  Papers (199)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3916 KB)

    An important part of a distributed system design is the choice of a load sharing or global scheduling strategy. A comprehensive literature survey on this topic is presented. We propose a taxonomy of load sharing algorithms that draws a basic dichotomy between source-initiative and server-initiative approaches. The taxonomy enables ten representative algorithms to be selected for performance evalua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Design and Analysis of BucketSort for Bubble Memory Secondary Storage

    Publication Year: 1985, Page(s):218 - 233
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4148 KB)

    BucketSort is a new external sorting algorithm for very large files that is a substantial improvement over merge sorting with disks. BucketSort requires an associative secondary storage device, which can be realized by large disk drives with logic-per-track capabilities or by magnetic bubble memory (MBM). This paper describes and analyzes a hypothetical Bucket-Sort implementation that uses bubble ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Instruction Cache Replacement Policies and Organizations

    Publication Year: 1985, Page(s):234 - 241
    Cited by:  Papers (40)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2594 KB)

    Instruction cache replacement policies and organizations are analyzed both theoretically and experimentally. Theoretical analyses are based on a new model for cache references —the loop model. First the loop model is used to study replacement policies and cache organizations. It is concluded theoretically that random replacement is better than LRU and FIFO, and that under certain circumstanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Instruction Sets and Their Fornmts

    Publication Year: 1985, Page(s):242 - 254
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3745 KB)

    Central to instruction set design is the issue of the instruction format. We discuss some common format encoding techniques, and introduce a method of representing high-level language parse trees by means of formats that cover successively larger portions of a tree. We then introduce variations on the method that represent directed acyclic graphs as well as simple parse trees, and that encode cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Accessibility Testing and Path Length Optimization of Multistage Interconnection Networks

    Publication Year: 1985, Page(s):255 - 266
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | PDF file iconPDF (3276 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connectivity of Regular Directed Graphs with Small Diameters

    Publication Year: 1985, Page(s):267 - 273
    Cited by:  Papers (87)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2229 KB)

    This paper clarifies the relation between the diameter k and the edge or node connectivity Ce or c,, of digraphs. The following two inequalities are derived: where n is the number of nodes, d is the maximum degree, and d is the minimum degree. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Pairwise Pivoting in Gaussian Elimination

    Publication Year: 1985, Page(s):274 - 278
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1798 KB)

    The method of Gaussian elimination using triangularization by elementary stabilized matrices constructed by pairwise pivoting is analyzed. It is shown that a variant of this scheme which is suitable for implementation on a paralle computer is numerically stable although the bound is larger than the one for the standard partial pivoting algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analysis of Processor-Memory Interconnection Networks

    Publication Year: 1985, Page(s):279 - 283
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (781 KB)

    An interference analysis of the interconnection networks (IN's) for tightly coupled multiprocessors is presented in this correspondence. The interconnections considered are crossbars and delta networks. Two situations are examined: when a memory module is equally likely to be addressed by a processor and when a processor has a favorite memory. It is shown that for a higher rate of favorite request... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Test Pattern Generation for API Faults in RAM

    Publication Year: 1985, Page(s):284 - 287
    Cited by:  Papers (42)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (805 KB)

    In this correspondence we consider the problem of test pattern generation for random-access memory to detect pattern-sensitive faults. A test algorithm is presented which contains a near-optimal WRITE sequence and is an improvement over existing algorithms. The algorithm is well suited for built-in testing applications. View full abstract»

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

    Publication Year: 1985, Page(s):287 - 290
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    This correspondence addresses actual implementation of a multiway fan-out and its effect on test generation. If a test generation ignores the fan-out implementation faults may be left undetected by the test set. Moreover, different implementations of the multiway fan-out may lead to different fault coverages. Careless implementation of the fan-out may also yield undetectable faults. Some guideline... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Computer Algorithm for Calculating the Product AB Modulo M"

    Publication Year: 1985, Page(s):290 - 292
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    The modular multiplication algorithm (MMA) was presented as a method of calculating " the smallest nonnegative integer R congruent modulo M to the product AB of two nonegative integers without dividing by M."1 The claim that division is avoided is technically correct, but misleading. A minor modification calculates both R and Q such that AB = MQ + R. A simplified version of the new algorithm is gi... 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): 292
    Request permission for commercial reuse | PDF file iconPDF (194 KB)
    Freely Available from IEEE
  • Information for authors

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