skip to main content
article
Free Access

A generalized polyphase merge algorithm

Published:01 August 1961Publication History
Skip Abstract Section

Abstract

The k-generalized Fibonacci numbers are defined as in [1]. A polyphase merge (merging an equal number of sequences from k tapes onto a single unused tape) using k+1 tapes is defined in terms of linear combinations of these numbers. A method is described to output sequences onto k of k+1 tapes after the internal sorting of elements to form sequences. This method will permit a polyphase merge of sequences of sorted elements provided that enough sequences are generated internally to place the proper numbers of sequences on each of the k tapes. For each value of k, there is a set of permissible numbers that can represent the total number of sequences generated during the original output process. If one of these numbers is met exactly and if there is a specific distribution of sequences on the k tapes, then a polyphase merge may proceed. If these conditions are not met, an algorithm is necessary to adjust the numbers of sequences to permit a polyphase merge. This paper describes such an algorithm.

References

  1. 1 MILES, E. P., JR. Generalized Fibonacci numbers and associated matrices. Amer. Math. Month. 67 (Oct. 1960), 745-752.Google ScholarGoogle ScholarCross RefCross Ref
  2. 2 FLORES, IVAN. Analysis of internal computer sorting. J. ACM 8 (Jan. 1961), 41-80. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 GILSTAD, R. L. Polyphase merge sorting-an advanced technique. Proc. Eastern Joint Comp. Conf., Dec. 1960.Google ScholarGoogle Scholar
  4. 4 BETZ, B. K. New merge sorting techniques. ACM Conf., Sept. 1959. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A generalized polyphase merge algorithm

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image Communications of the ACM
      Communications of the ACM  Volume 4, Issue 8
      Aug. 1961
      23 pages
      ISSN:0001-0782
      EISSN:1557-7317
      DOI:10.1145/366678
      • Editor:
      • Alan J. Perils
      Issue’s Table of Contents

      Copyright © 1961 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 August 1961

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader