Cache Oblivious Distribution Sweeping

Forfattere

  • Gerth Stølting Brodal
  • Rolf Fagerberg

DOI:

https://doi.org/10.7146/brics.v9i18.21964

Resumé

We adapt the distribution sweeping method to the cache oblivious model. Distribution sweeping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be viewed as a merging process of streams. We demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting. The problems all come from computational geometry, and are: orthogonal line segment intersection reporting, the all nearest neighbors problem, the 3D maxima problem, computing the measure of a set of axis-parallel rectangles, computing the visibility of a set of line segments from a point, batched orthogonal range queries, and reporting pairwise intersections of axis-parallel rectangles. Our basic building block is a simplified version of the cache oblivious sorting algorithm Funnelsort of Frigo et al., which is of independent interest.

 

Full text: http://dx.doi.org/10.1007/3-540-45465-9_37

Publiceret

2002-04-13

Citation/Eksport

Brodal, G. S., & Fagerberg, R. (2002). Cache Oblivious Distribution Sweeping. BRICS Report Series, 9(18). https://doi.org/10.7146/brics.v9i18.21964

Nummer

Nr. 18 (2002): RS-18 Cache Oblivious Distribution Sweeping

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).