Optimal cache-aware suffix selection

Gianni Franceschini, Roberto Grossi, Shanmugavelayutham Muthukrishnan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Given string S[1⋯N] and integer k, the suffix selection problem is to determine the kth lexicographically smallest amongst the suffixes S[i ⋯ N], 1 ≤ i ≤ N. We study the suffix selection problem in the cache-aware model that captures two-level memory inherent in computing systems, for a cache of limited size M and block size B. The complexity of interest is the number of block transfers. We present an optimal suffix selection algorithm in the cache-aware model, requiring θ (N/B) block transfers, for any string S over an unbounded alphabet (where characters can only be compared), under the common tall-cache assumption (i.e. M = Ω (B1+∈), where ∈ < 1). 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.

    Original languageEnglish (US)
    Title of host publicationSTACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science
    Pages457-468
    Number of pages12
    StatePublished - Dec 1 2009
    Event26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009 - Freiburg, Germany
    Duration: Feb 26 2009Feb 28 2009

    Publication series

    NameLeibniz International Proceedings in Informatics, LIPIcs
    Volume3
    ISSN (Print)1868-8969

    Conference

    Conference26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009
    CountryGermany
    CityFreiburg
    Period2/26/092/28/09

    Fingerprint

    Data storage equipment

    ASJC Scopus subject areas

    • Software

    Cite this

    Franceschini, G., Grossi, R., & Muthukrishnan, S. (2009). Optimal cache-aware suffix selection. In STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science (pp. 457-468). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 3).

    Optimal cache-aware suffix selection. / Franceschini, Gianni; Grossi, Roberto; Muthukrishnan, Shanmugavelayutham.

    STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science. 2009. p. 457-468 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 3).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Franceschini, G, Grossi, R & Muthukrishnan, S 2009, Optimal cache-aware suffix selection. in STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics, LIPIcs, vol. 3, pp. 457-468, 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Freiburg, Germany, 2/26/09.
    Franceschini G, Grossi R, Muthukrishnan S. Optimal cache-aware suffix selection. In STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science. 2009. p. 457-468. (Leibniz International Proceedings in Informatics, LIPIcs).
    Franceschini, Gianni ; Grossi, Roberto ; Muthukrishnan, Shanmugavelayutham. / Optimal cache-aware suffix selection. STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science. 2009. pp. 457-468 (Leibniz International Proceedings in Informatics, LIPIcs).
    @inproceedings{fc19879994224d7a9d532aac5944d03c,
    title = "Optimal cache-aware suffix selection",
    abstract = "Given string S[1⋯N] and integer k, the suffix selection problem is to determine the kth lexicographically smallest amongst the suffixes S[i ⋯ N], 1 ≤ i ≤ N. We study the suffix selection problem in the cache-aware model that captures two-level memory inherent in computing systems, for a cache of limited size M and block size B. The complexity of interest is the number of block transfers. We present an optimal suffix selection algorithm in the cache-aware model, requiring θ (N/B) block transfers, for any string S over an unbounded alphabet (where characters can only be compared), under the common tall-cache assumption (i.e. M = Ω (B1+∈), where ∈ < 1). 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.",
    author = "Gianni Franceschini and Roberto Grossi and Shanmugavelayutham Muthukrishnan",
    year = "2009",
    month = "12",
    day = "1",
    language = "English (US)",
    isbn = "9783939897095",
    series = "Leibniz International Proceedings in Informatics, LIPIcs",
    pages = "457--468",
    booktitle = "STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science",

    }

    TY - GEN

    T1 - Optimal cache-aware suffix selection

    AU - Franceschini, Gianni

    AU - Grossi, Roberto

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2009/12/1

    Y1 - 2009/12/1

    N2 - Given string S[1⋯N] and integer k, the suffix selection problem is to determine the kth lexicographically smallest amongst the suffixes S[i ⋯ N], 1 ≤ i ≤ N. We study the suffix selection problem in the cache-aware model that captures two-level memory inherent in computing systems, for a cache of limited size M and block size B. The complexity of interest is the number of block transfers. We present an optimal suffix selection algorithm in the cache-aware model, requiring θ (N/B) block transfers, for any string S over an unbounded alphabet (where characters can only be compared), under the common tall-cache assumption (i.e. M = Ω (B1+∈), where ∈ < 1). 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.

    AB - Given string S[1⋯N] and integer k, the suffix selection problem is to determine the kth lexicographically smallest amongst the suffixes S[i ⋯ N], 1 ≤ i ≤ N. We study the suffix selection problem in the cache-aware model that captures two-level memory inherent in computing systems, for a cache of limited size M and block size B. The complexity of interest is the number of block transfers. We present an optimal suffix selection algorithm in the cache-aware model, requiring θ (N/B) block transfers, for any string S over an unbounded alphabet (where characters can only be compared), under the common tall-cache assumption (i.e. M = Ω (B1+∈), where ∈ < 1). 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.

    UR - http://www.scopus.com/inward/record.url?scp=84880233134&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84880233134&partnerID=8YFLogxK

    M3 - Conference contribution

    SN - 9783939897095

    T3 - Leibniz International Proceedings in Informatics, LIPIcs

    SP - 457

    EP - 468

    BT - STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science

    ER -