Skip to main content
SpringerLink
Log in

Parallel merge sort using comparison matrices. I

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. D. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching [Russian translation], Mir, Moscow (1978).

    Google Scholar 

  2. H. Lorin, Sorting and Sort Systems, Addison-Wesley, Reading, Mass. (1975).

    Google Scholar 

  3. N. Wirth, Algorithms and Data Structures [Russian translation], Mir, Moscow (1989).

    Google Scholar 

  4. G. E. Tseitlin, “Parallelization of sorting algorithms,” Kibernetika, No. 6, 67–74 (1989).

    MathSciNet  Google Scholar 

  5. Ya. E. Romm, Merge Sorting by Comparison Matrices. 1. Sequential Version [in Russian], TRTI, Taganrog (1991). Unpublished manuscript, VINITI, 18.10.91, No. 4008-V91.

    Google Scholar 

  6. A. O. P'yavchenko and Ya. E. Romm, “Switching network for interprocessor exchange and sorting,” Avtomat. Vych. Tekhn., No. 1, 70–79 (1990).

    Google Scholar 

  7. Ya. E. Romm, “Deterministic organization of parallel numerical processing by data indices,” Kibernet. Sist. Anal., No. 4, 133–152 (1992).

    MATH  MathSciNet  Google Scholar 

  8. G. Baudet and D. Stevenson, “Optimal sorting algorithms for parallel computers,” IEEE Trans. Comput.27 No. 1, 84–87 (1978).

    MathSciNet  Google Scholar 

  9. R. Beigel and J. Gill, “Sorting n objects with a k-sorter,” IEEE Trans. Comput.,39, No. 5, 714–716 (1990).

    MathSciNet  Google Scholar 

  10. D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra [in Russian], Fizmatgiz, Moscow (1960).

    Google Scholar 

  11. Ya. E. Romm, Merge Sorting by Comparison Matrices. 1. Parallel Versions [in Russian], TRTI, Taganrog (1991).

    Google Scholar 

  12. Ya. E. Romm and A. A. Sereda, A Planar Switching Network with Exclusion of Element Blocking [in Russian], TRTI, Taganrog (1993). Unpublished manuscript, 10.02.94, No. 370-V94.

    Google Scholar 

Download references

Authors
  1. Ya. E. Romm
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 3–23, September–October, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Romm, Y.E. Parallel merge sort using comparison matrices. I. Cybern Syst Anal 30, 631–647 (1994). https://doi.org/10.1007/BF02367744

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02367744

Keywords

Search

Navigation