Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computers

Issue 5 • May 1986

Filter Results

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

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

    Publication Year: 1986, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (186 KB)
    Freely Available from IEEE
  • Scheduling Multiprocessor Tasks to Minimize Schedule Length

    Publication Year: 1986, Page(s):389 - 393
    Cited by:  Papers (123)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2191 KB)

    The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its impact on the complexity of minimizing schedu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic t-Error Correcting/All Unidirectional Error Detecting Codes

    Publication Year: 1986, Page(s):394 - 402
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3910 KB)

    In this paper we give methods for the construction of systematic t-random error correcting and all unidirectional error detecting codes. Also we give the encoding/decoding algorithms and discuss their implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P

    Publication Year: 1986, Page(s):403 - 418
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5636 KB)

    Previous theoretical work in computational complexity has suggested that any problem which is log-space complete for P is not likely in NC, and thus not parallelizable. In practice, this is not the case. To resolve this paradox, we introduce new complexity classes PC and PC* that capture the practical notion of parallelizability we discuss in this paper. We show that foqur complete problems for P ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Clustering Approximation Technique for Queueing Network Models with a Large Number of Chains

    Publication Year: 1986, Page(s):419 - 430
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3558 KB)

    The past few years have witnessed an increasing number of large distributed computer system implementations based on local area networks. In these systems a number of resources (CPU's, file servers, disks, etc.) are shared among jobs originating at different sites. Evaluating the performance of such large systems typically requires the solution of a queueing network model with a large number of cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study of Pipelining in Computing Arrays

    Publication Year: 1986, Page(s):431 - 440
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4424 KB)

    In this paper, we take a hard look at scheduling considerations in computing arrays. A simple sufficient condition is developed for determining whether a computing array can be pipelined. If the array cannot be pipelined in the form given, the condition also indicates the direction in which to proceed to make it pipelineable. The overall framework and methodology take a good part of the load off t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the Performance of Buddy Systems

    Publication Year: 1986, Page(s):441 - 447
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2463 KB)

    This paper discusses ways of reducing fragmentation ion in buddy systems. Although internal fragmentation may be estimated for any buddy system, external fragmentation cannot be determined theoretically. It is suggested here that mean external fragmentation for any buddy system is directly related to the height of the associated binary tree. Simulation studies with a new buddy system support this ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Scheduling Tasks with a Quick Recovery from Failure

    Publication Year: 1986, Page(s):448 - 455
    Cited by:  Papers (70)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3710 KB)

    Multiprocessors used in life-critical real-time systems must recover quickly from failure. Part of this recovery consists of switching to a new task schedule that ensures that hard deadlines for critical tasks continue to be met. We present a dynamic programming algorithm that ensures that backup, or contingency, schedules can be efficiently embedded within the original, "primary" schedule to ensu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Search Algorithms for Associative Memories

    Publication Year: 1986, Page(s):456 - 461
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2331 KB)

    A new scheme for constructing search algorithms for bit-parallel associative memories of m n-bit words is described. The resulting equivalence searches, threshold searches, and double-limit searches achieve the time bound of O(log n), compared to O(n), the recent result of Ramamoorthy et al. [12]. The extremum search algorithm by Frei and Goldberg [2] is modified and generalized so that the number... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection

    Publication Year: 1986, Page(s):462 - 475
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4266 KB)

    We present algorithms and time complexity results for MOS switch-level simulation with particular reference to race detection. Under the switching model used in classical (Boolean) switching theory, we derive a linear-time race detection algorithm for switch-level circuits that have no feedback within a clock phase, and have unit fan-out. We show that the problem becomes NP-complete if fan-out of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization by the D Algorithm

    Publication Year: 1986, Page(s):476 - 478
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (737 KB)

    Programmed logic arrays [1], [2] are common in computer design. A form of this method of design has been used since the beginnings of computers, in telephone relay networks [3]. Optimization of such realizations of functions were begun by Karnaugh [4], Quine [5], McCluskey [6], and Roth [7]. Substantial use was mnade of such programs by Preiss [8] and Perlman [9]. Despite the existence of exact pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime

    Publication Year: 1986, Page(s):478 - 482
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (950 KB)

    The extended Euclidean algorithm is typically used to calculate multiplicative inverses over finite fields and rings of integers. The algorithm presented here has approximately the same number of average iterations and maximum number of iterations. It is shown, when P is a Mersenne prime, implementation of this algorithm on a processor, designed especially for mod P arithmetic operations, produces... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Sign/Logarithm Arithmetic for FFT Implementation"

    Publication Year: 1986, Page(s):482 - 484
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    This note points out several errors in the paper [1] by E. E. Swartzlander, Jr. et al. Corrected results are presented including detailed reasons and derivations. View full abstract»

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

    Publication Year: 1986, Page(s): 484
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (170 KB)

    We thank the authors for taking the time to prepare a formal comment on our 1983 paper [1]. Some of the confusion results from our use of b − 1 bits to represent the fractional part of the sign/logarithm instead of b bits as used by Hongyuan and Lee in their comment. The performance curves (Figs. 12-14 of [1]) are plots of output noise variance/output signal variance in units of 2-2 (number ... 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: 1986, Page(s): 484
    Request permission for commercial reuse | PDF file iconPDF (188 KB)
    Freely Available from IEEE
  • Information for authors

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