Skip to main content
SpringerLink
Log in

Interchanging Tw Segments of an Array in a Hierarchical Memory System

  • Conference paper
  • First Online:
Algorithm Engineering (WAE 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1982))

Included in the following conference series:

  • 409 Accesses

Abstract

The problem of interchanging tw segments of an array is considered.Using the known methods as a starting-point, two new adaptations are developed that achieve higher memory locality. It is confirmed, both analytically and experimentally, that on a computer with a hierarchical memory the adaptations are superior to the earlier methods.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aggarwal and J.S. Vitter, The input/output complexity of sorting and related problems,Communications of the ACM31 (1988), 1116–1127.

    Article  MathSciNet  Google Scholar 

  2. J. Bentley, Programming Pearls, 2nd Edition, Addison-Wesley, Reading (2000).

    Google Scholar 

  3. K. Dudziński and A. Dydek,On stable minimum storage merging algorithm, Information Processing Letters12 (1981),5–8.

    Article  MathSciNet  Google Scholar 

  4. S. Dvořák and B.Ďurian, Merging by decomposition revisited, The Computer Journal31 (1988),553–556.

    Article  MathSciNet  Google Scholar 

  5. W. Fletcher and R. Silver, Interchange of tw blocks f data, Communications of the ACM9 (1966), 326.

    Article  Google Scholar 

  6. D. Gries,The Scienc of Programming, Springer-Verlag, New York (1981).

    Google Scholar 

  7. D. Gries and H. Mills, Swapping sections,Technical report, Department of Computer Science, Cornell University, Ithaca, New York (1981).

    Google Scholar 

  8. J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, 2nd Edition, Morgan Kaufmann Publishers, Inc., San Francisco (1996).

    MATH  Google Scholar 

  9. D.E. Knuth,The Stanford GraphBase:A Platform for Combinatorial Computing, Addison-Wesley, Reading (1993).

    Google Scholar 

  10. D.E. Knuth, Fundamental Algorithms,The Art of Computer Programming1, 3rd Edition, Addison-Wesley, Reading (1997).

    Google Scholar 

  11. D.E. Knuth, Sorting and Searching,The Art of Computer Programming3, 2nd Edition, Addison-Wesley, Reading (1998).

    Google Scholar 

  12. J.L. Mohammed and C.S. Subi, An improved block-interchange algorithm, Journal of Algorithms8 (1987), 113–121.

    Article  MathSciNet  Google Scholar 

  13. C.K. Shene, An analysis of tw in-place array rotation algorithms, The Computer Journal40 (1997), 541–546.

    Article  Google Scholar 

  14. Silicon Graphics Computer Systems, Inc., Standard Template Library Programmer’ s Guide, Worldwide Web Document (1999). Available at http://www.sgi.com/Technology/STL/.

Download references

Author information

Authors and Affiliations

  1. UNI-C, Danish Computing Centre for Research and Education, Technical University of Denmark, Building 304, DK-2800, Lyngby, Denmark

    Jesper Bojesen

  2. Department f Computing, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen East, Denmark

    Jyrki Katajainen

Authors
  1. Jesper Bojesen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jyrki Katajainen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Trier, Fachbereich IV — Informatik, 54286, Trier, Germany

    Stefan Näher

  2. Fakultät für Mathematik und Informatik, Universität Konstanz, 78457, Konstanz, Germany

    Dorothea Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bojesen, J., Katajainen, J. (2001). Interchanging Tw Segments of an Array in a Hierarchical Memory System. In: Näher, S., Wagner, D. (eds) Algorithm Engineering. WAE 2000. Lecture Notes in Computer Science, vol 1982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44691-5_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44691-5_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42512-0

  • Online ISBN: 978-3-540-44691-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation