Cache-Oblivious Selection in Sorted X+Y Matrices

Details Cache-Oblivious Selection in Sorted X+Y Matrices Cache-Oblivious Selection in Sorted X+Y Matrices

2008-04-06

arxiv.org/abs/0804.0936v1

Computer Science

Data Structures and Algorithms

Scientific paper

Let X[0..n-1] and Y[0..m-1] be two sorted arrays, and define the mxn matrix A
by A[j][i]=X[i]+Y[j]. Frederickson and Johnson gave an efficient algorithm for
selecting the k-th smallest element from A. We show how to make this algorithm
IO-efficient. Our cache-oblivious algorithm performs O((m+n)/B) IOs, where B is
the block size of memory transfers.

Affiliated with

Also associated with

No associations

Rating

Cache-Oblivious Selection in Sorted X+Y Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cache-Oblivious Selection in Sorted X+Y Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache-Oblivious Selection in Sorted X+Y Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729818