skip to main content
10.1145/3597635.3598029acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
poster

PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract)

Published:18 July 2023Publication History

ABSTRACT

Processing-in-memory (PIM) is an emerging technology to alleviate the high cost of data movement by pushing computation into/near memory modules. There is an inherent tension, however, between minimizing communication (data movement) and achieving load balance in PIM systems in the presence of workload skew. This work introduces PIM-tree, a PIM-based index that simultaneously achieves low communication, good load balance, and low space consumption. It achieves good theoretical bounds in the PIM Model and efficient on a real-world PIM machine, outperforming prior PIM-based and state-of-the-art CPU-based indexes.

References

  1. UPMEM Tech. https://www.upmem.com/technology/, Accessed March 20, 2023.Google ScholarGoogle Scholar
  2. T. Brown. Techniques for constructing efficient lock-free data structures. PhD thesis, University of Toronto (Canada), 2017.Google ScholarGoogle Scholar
  3. J. Choe et al. Concurrent data structures with near-data-processing: an architecture-aware implementation. In ACM Symposium on Parallelism in Algorithms and Architectures, pages 297--308, 2019.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Jeddeloh et al. Hybrid memory cube new DRAM architecture increases density and performance. In 2012 Symposium on VLSI Technology, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  5. H. Kangetal. The processing-in-memorymodel. In ACM Symposium on Parallelism in Algorithms and Architectures, pages 295--306, 2021.Google ScholarGoogle Scholar
  6. Z. Liu et al. Concurrent data structures for near-memory computing. In ACM Symposium on Parallelism in Algorithms and Architectures, page 235--245, 2017.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. O. Mutlu et al. A Modern Primer on Processing in Memory. Springer Nature Singapore, Singapore, 2023.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract)

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          HOPC '23: Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing
          July 2023
          33 pages
          ISBN:9798400702181
          DOI:10.1145/3597635

          Copyright © 2023 Owner/Author

          Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 18 July 2023

          Check for updates

          Qualifiers

          • poster

          Upcoming Conference

          SPAA '24
        • Article Metrics

          • Downloads (Last 12 months)117
          • Downloads (Last 6 weeks)7

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader