Scheduled System Maintenance
On Wednesday, December 20, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Computers

Issue 4 • April 1985

Filter Results

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

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

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

    Publication Year: 1985, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • Introduction --Sorting

    Publication Year: 1985, Page(s):293 - 295
    Request permission for commercial reuse | PDF file iconPDF (2193 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List of referees

    Publication Year: 1985, Page(s): 295
    Request permission for commercial reuse | PDF file iconPDF (881 KB)
    Freely Available from IEEE
  • Electronic Data Sorting

    Publication Year: 1985, Page(s):296 - 310
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3365 KB)

    This paper presents results of a study of the fundamentals of sorting. Emphasis is placed on understanding sorting and on minimizing the time required to sort with electronic equipment of reasonable cost. Sorting is viewed as a combination of information gathering and item moving activities. Shannon's communication theory measure of information is applied to assess the difficulty of various sortin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower Bounds for Sorting with Realistic Instruction Sets

    Publication Year: 1985, Page(s):311 - 317
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1915 KB)

    Ω(n log n) time is required to sort n integers using comparison, addition, subtraction, multiplication, division, indirect addressing, and mildly restricted truncation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measures of Presortedness and Optimal Sorting Algorithms

    Publication Year: 1985, Page(s):318 - 325
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1430 KB)

    The concept of presortedness and its use in sorting are studied. Natural ways to measure presortedness are given and some general properties necessary for a measure are proposed. A concept of a sorting algorithm optimal with respect to a measure of presortedness is defined, and examples of such algorithms are given. A new insertion sort algorithm is shown to be optimal with respect to three natura... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Robust Sorting Network

    Publication Year: 1985, Page(s):326 - 335
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2001 KB)

    Beginning with the recently introduced balanced sorting network, we propose a shuffle-exchange type layout consisting of a single block with the output recirculated back as input until sorting is achieved. Although this network has essentially the same performance bounds as Batcher's bitonic sort, our design has the property that no comparator in the network is critical in the sense that any fault... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Minimum Area VLSI Network for O(log n) Time Sorting

    Publication Year: 1985, Page(s):336 - 343
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1917 KB)

    A generalization of a known class of parallel sorting algorithms is presented, together with a new interconnection to execute them. A VLSI implementation is also proposed, and its area-time performance is discussed. It is shown that an algorithm in the class is executable in O(log n) time by a chip occupying O(n2) area. The design is a typical instance of a ``hybrid architecture,' resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight Bounds on the Complexity of Parallel Sorting

    Publication Year: 1985, Page(s):344 - 354
    Cited by:  Papers (164)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2610 KB)

    In this paper, we prove tight upper and lower bounds on the number of processors, information transfer, wire area, and time needed to sort N numbers in a bounded-degree fixed-connection network. Our most important new results are: 1) the construction of an N-node degree-3 network capable of sorting N numbers in O(log N) word steps; 2) a proof that any network capable of sorting N (7 log N)-bit num... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum Storage Sorting Networks

    Publication Year: 1985, Page(s):355 - 361
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2151 KB)

    This paper analyzes how to sort n k-bit numbers in a minimum storage network. The techniques also give new AT2 lower bounds for a VLSI sorting model. The principal results in this paper are as follows. • Lower bounds are given for the minimum storage (and area) needed to sort n k-bit numbers, and accompanying upper bounds (sorting networks) are presented, which match the lower b... View full abstract»

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

    Publication Year: 1985, Page(s):362 - 367
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1023 KB)

    When sorting a multiset of N elements with n ≪ N distinct values, considerable savings can be obtained from an algorithm which sorts in time O(N log n) rather than O(N log N). In a previous paper, two Quicksort derivatives operating on linked lists were introduced which are stable, i.e., maintain the relative order of equal keys, and which achieve the previously unattainable lower bound in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Method for Unknown Distributions in Distributive Partitioned Sorting

    Publication Year: 1985, Page(s):367 - 372
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1318 KB)

    Distributive Partitioned Sort (DPS) is a fast internal sorting algorithm which rung in O(n) expected time on uniformly distributed data. Unfortunately, the method is biased toward such inputs, and its performance worsens as the data become increasingly nonuniform, such as with highly skewed distributions. An adaptation of DPS, which estimates the cumulative distribution function of the input data ... View full abstract»

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

    Publication Year: 1985, Page(s):372 - 376
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1091 KB)

    The problem of sorting a file distributed over a number of sites of a communication network is examined. Two versions of this problem are investigated; distributed solution algorithms are presented; and their communication complexity analyzed both in the worst and in the average case. The worst case bounds are shown to be sharp, with respect to order of magnitude, for large files. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Distributed Algorithms for Sorting and Ranking

    Publication Year: 1985, Page(s):376 - 379
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    We study the problems of sorting and ranking n processors that have initial values (not necessarily distinct) in a distributed system. Sorting means that the initial values have to move around in the network and be assigned to the processors according to their distinct identities, while ranking means that the numbers 1, 2,..., n have to be assigned to the processors according to their initial valu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Sorting with Serial Memories

    Publication Year: 1985, Page(s):379 - 383
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1003 KB)

    This correspondence examines the problem of sorting on a network of processors, where each processor consists of a single storage register and a small control unit capable of comparing two numbers and has a single serial memory attached to it. We show how to sort optimally on one- or two-dimensional arrays of p processors in time θ(n + (n2/p2)) and θ((n/"... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The I/O Performance of Multiway Mergesort and Tag Sort

    Publication Year: 1985, Page(s):383 - 387
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1241 KB)

    We develop models of secondary storage to evaluate external sorting and use them to analyze the average I/O access time of mergesort and tag sort on files with uniform key distribution. The k-way mergesort takes [logk R] merge passes to sort a file with R initial sorted runs. Choosing k as large as possible reduces the number of merge passes, but we show that under the assumptions of ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Why merge?-An examination of disk sorting strategy

    Publication Year: 1985, Page(s):387 - 391
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1007 KB)

    The aims of random access sorting are examined, the usual practice of merging strings is criticized, and an algorithm is described which embodies the proposed strategy. 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: 1985, Page(s): 392
    Request permission for commercial reuse | PDF file iconPDF (72 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

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

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