Optimal cache-aware suffix selection
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan

TL;DR
This paper introduces an optimal cache-aware algorithm for the suffix selection problem that minimizes block transfers in two-level memory systems, outperforming traditional permutation bounds.
Contribution
It presents the first optimal cache-aware suffix selection algorithm with $ ilde{O}(N/B)$ block transfers for unbounded alphabets under the tall-cache assumption.
Findings
Achieves optimal $ ilde{O}(N/B)$ block transfers.
Works for strings over unbounded alphabets.
Surpasses the permutation bottleneck bound.
Abstract
Given string and integer , the {\em suffix selection} problem is to determine the th lexicographically smallest amongst the suffixes , . We study the suffix selection problem in the cache-aware model that captures two-level memory inherent in computing systems, for a \emph{cache} of limited size and block size . The complexity of interest is the number of block transfers. We present an optimal suffix selection algorithm in the cache-aware model, requiring block transfers, for any string over an unbounded alphabet (where characters can only be compared), under the common tall-cache assumption (i.e. , where ). Our algorithm beats the bottleneck bound for permuting an input array to the desired output array, which holds for nearly any nontrivial problem in hierarchical memory models.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Network Packet Processing and Optimization · Advanced Image and Video Retrieval Techniques
