17
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      Exploiting coroutines to attack the "killer nanoseconds"

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Database systems use many pointer-based data structures, including hash tables and B+-trees, which require extensive "pointer-chasing." Each pointer dereference, e.g., during a hash probe or a B+-tree traversal, can result in a CPU cache miss, stalling the CPU. Recent work has shown that CPU stalls due to main memory accesses are a significant source of overhead, even for cache-conscious data structures, and has proposed techniques to reduce this overhead, by hiding memory-stall latency. In this work, we compare and contrast the state-of-the-art approaches to reduce CPU stalls due to cache misses for pointer-intensive data structures. We present an in-depth experimental evaluation and a detailed analysis using four popular data structures: hash table, binary search, Masstree, and Bw-tree. Our focus is on understanding the practicality of using coroutines to improve throughput of such data structures. The implementation, experiments, and analysis presented in this paper promote a deeper understanding of how to exploit coroutines-based approaches to build highly efficient systems.

          Related collections

          Most cited references18

          • Record: found
          • Abstract: not found
          • Article: not found

          Design of a separable transition-diagram compiler

            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Cache craftiness for fast multicore key-value storage

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              The Bw-Tree: A B-tree for new hardware platforms

                Bookmark

                Author and article information

                Journal
                Proceedings of the VLDB Endowment
                Proc. VLDB Endow.
                Association for Computing Machinery (ACM)
                2150-8097
                July 2018
                July 2018
                July 2018
                : 11
                : 11
                : 1702-1714
                Affiliations
                [1 ]Microsoft Research
                [2 ]Microsoft
                [3 ]University of Minnesota
                Article
                10.14778/3236187.3236216
                f64272a4-6666-4b43-9c58-450523a6155a
                © 2018
                History

                Genetics
                Genetics

                Comments

                Comment on this article