Interchanging Two Segments of an Array in a Hierarchical Memory System

Authors:
Jesper Bojesen;Jyrki Katajainen
Affiliations:
-;-
Venue:
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Year:
2000

Citing 10
Cited 0

An improved block-interchange algorithm

Journal of Algorithms
The input/output complexity of sorting and related problems

Communications of the ACM
Merging by decomposition revisited

The Computer Journal
The Stanford GraphBase: a platform for combinatorial computing

The Stanford GraphBase: a platform for combinatorial computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Computer architecture (2nd ed.): a quantitative approach

Computer architecture (2nd ed.): a quantitative approach
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Programming pearls (2nd ed.)

Programming pearls (2nd ed.)
Algorithm 284: Interchange of Two Blocks of Data

Communications of the ACM
The Science of Programming

The Science of Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of interchanging two 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.