IEEE Transactions on Computers

Issue 6 • June 1981

Filter Results

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

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

    Publication Year: 1981, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (218 KB)
    Freely Available from IEEE
  • The MPG System: A Machine-Independent Efficient Microprogram Generator

    Publication Year: 1981, Page(s):373 - 395
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4633 KB)

    A machine-independent high-level microprogramming language, called MPGL, has been developed along with its processing system, called MPG. The MPGL allows the microprogrammer to write microprograms sequentially in a machine-independent fashion. The MPG provides the facility for translating these microprograms into efficient object code, as well as debugging object microprograms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An On-Chip Compare/Steer Bubble Sorter

    Publication Year: 1981, Page(s):396 - 405
    Cited by:  Papers (27)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4316 KB)

    Two generic record-permutation bubble devices—the bubble ladder and the bubble string comparator—have been reported in the literature but not yet implemented. The former relies on the extensive use of external control lines, while the latter relies solely on the interaction between bubbles. The ladder has evolved into an odd- even sorter and then a rebound sorter, but, uufortunately, i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HDLC Throughput and Response Time for Bidirectional Data Flow with Nonuniform Frame Sizes

    Publication Year: 1981, Page(s):405 - 413
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3587 KB)

    The main purpose of this paper is to evaluate the performance of the HDLC (high-level data link control) protocol (to be more precise, we only consider the asynchronous response mode), and to suggest and analyze some possible improvements. The performance criteria are maximum throughput and response time and the flow of data is bidirectional with nonuniform frame sizes. The mathematical model of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Fault Identification in Diagnosable Systems

    Publication Year: 1981, Page(s):414 - 422
    Cited by:  Papers (75)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2916 KB)

    This paper begins by giving a characterization of t1/ t1—diagnosable systems. Then a class of t0-diagnosable systems, denoted by d(n,t0,X), is considered. It is shown for any member of this class that: 1) necessary and sufficient conditions for t1/t1—diagnosability are greatly simplified, 2) optimal diagnosis algorithms of time complexity 0(nt0) exist, and most importantly, 3) given th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Slide: An I/O Hardware Descriptive Language

    Publication Year: 1981, Page(s):423 - 439
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3670 KB)

    This paper describes the SLIDE language—a hardware-descriptive language desigued for the description of input/output, interfaces, and interconnected digital systems. The language allows the description of asynchronous, concurrent processes which can communicate. Timing and synchronization mechanisms are capable of being described as well. Current research applications include the use of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design to Minimize Diameter on Building-Block Network

    Publication Year: 1981, Page(s):439 - 442
    Cited by:  Papers (144)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2849 KB)

    This paper proposes a simple algorithm for the graph design of small-diameter networks. For given nodes n and degree d, this algorithm can be used to construct a directed graph with diameter ⌈logd n⌉, which is at most one larger than the lower bound ⌈logd (n(d − 1) + 1)⌉ − 1. Its average distance is also close to the lower bound. The algorithm can be used to con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation and Performance Evaluation of Computer Families

    Publication Year: 1981, Page(s):443 - 447
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    This correspondence proposes a model using microcycle and memory read pause times to account for variation in performance between members of a computer family. Wben applied to the DEC PDP-11 and IBM S/360-S/370 families, the model explains over 90 percent of the variation. This model is useful for initial family planning, as well as design of individual family members. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Double-Edge-Triggered Flip-Flops

    Publication Year: 1981, Page(s):447 - 451
    Cited by:  Papers (35)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (996 KB)

    A conventional positive-edge-triggered flip-flop (FF) senses and responds to the control input or inputs at the time the clock input is changing from 0 to 1. It does not respond at all to changes in the opposite direction. Negative-edge-triggered FF's behave in a complementary manner. Thus, these FF's can respond at most once per clock pulse cycle. It is proposed that double-edge-triggered (DET) F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Very Fast Fourier Transform Algorithms Hardware for Implementation"

    Publication Year: 1981, Page(s): 452
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (129 KB)

    The object of this correspondence is to point out and correct some errors which have occurred in the above paper.1 View full abstract»

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

    Publication Year: 1981, Page(s): 452
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (129 KB)

    The author would like to acknowledge Prakash and Rao for their corrections. Unfortunately, there are further errors in need of correction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Addendum to "A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform"

    Publication Year: 1981, Page(s):453 - 454
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (381 KB)

    Recently,1 the authors proposed a hybrid algorithm for computing the discrete Fourier transform (DFT) of certain long transform lengths. In that technique, a Winograd-type algorithm was used in conjunction with the Mersenne prime-number theoretic transform to perform a DFT. Even though this technique requires fewer multiplications than either the standard fast Fourier transform (FFT) or Winograd's... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "Combinatorial Merging and Huffman's Algorithm"

    Publication Year: 1981, Page(s): 454
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    The following errors should be noted in the above correspondence.1 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "An Optimal Solution for the Channel-Assignment Problem"

    Publication Year: 1981, Page(s): 454
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    The main thrust of the above paper1appears to be a detailed restatement of the "left-edge algorithm" [1], [2] for channel routing. This algorithm is almost a decade old and is now quite familiar to most workers in the field of LSI design automation. That the authors did not reference this earlier work, and devoted much of their paper to a reexposition certainly detracts from its usefuln... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further Comments on "An Optimal Solution for the Channel- Assignment Problem"

    Publication Year: 1981, Page(s): 455
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB)

    In the above paper1Gupta, Lee, and Leung present a new algorithm for making an optimal assignment of wire segments to channels on a PC board. The new algorithm has a running time of 0(N log N) in the general case, but can be executed in 0(N) time if the wire segment endpoints are close to uniformly distributed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Additional Comments on "An Optimal Solution for the Channel- Assignment Problem"

    Publication Year: 1981, Page(s): 455
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB)

    The problem stated and solved in the above paper1has been solved before with essentially the same algorithm by Hashimoto and Stevens. View full abstract»

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

    Publication Year: 1981, Page(s): 455
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB)

    Since the publication of this paper it has been brought to our notice by Lauther, Persky et al., and Rubin that the channel assignment problem has been studied by Hashimoto and Stevens [2] and Kernighan et al. [3]. These papers should have been cited and we regret the omission. View full abstract»

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

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

    Publication Year: 1981, Page(s): 455
    Request permission for commercial reuse | PDF file iconPDF (167 KB)
    Freely Available from IEEE
  • Call for Papers

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