• Cite Icon30
  • https://doi.org/10.1145/2611462.2611496Copy DOI Icon

The future(s) of shared data structures

  • Jul 15, 2014
  • Alex Kogan +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper considers how to use futures, a well-known mechanism to manage parallel computations, to improve the performance of long-lived, mutable shared data structures in large-scale multicore systems. We show that futures can enable type-specific optimizations such as combining and elimination, improve cache locality and reduce contention. To exploit these benefits in an effective way, however, it is important to define clear notions of correctness. We propose new extensions to linearizability appropriate for method calls that return futures as results. To illustrate the utility and trade-offs of these extensions, we describe implementations of three common data structures: stacks, queues, and linked lists, designed to exploit futures. Our experimental results show that optimizations enabled by futures lead to substantial performance improvements, in some cases up to two orders of magnitude, compared to well-known lock-free alternatives.

Similar Papers
  • Research Article
  • Citations2

Fine-Grained Parallel and Distributed Spatial Stochastic Simulation of Biological Reactions

  • Sep 01, 2011
  • Advanced Materials Research
  • Fei Xing +3
  • Research Article
  • Citations3

The run-time efficiency of parallel asynchronous algorithms

  • Jan 01, 1991
  • IEEE Transactions on Computers
  • M Dubois +1
  • Research Article
  • Citations5

A hybrid method in combining treatment effects from matched and unmatched studies

  • Jul 09, 2013
  • Statistics in Medicine
  • Jinyoung Byun +5
  • Conference Article
  • Citations1

Common Information Model: Panel Session

  • Jan 01, 1999
  • Peter M Hirsch
  • Book Chapter
  • Citations8

LCD: Local Combining on Demand

  • Jan 01, 2014
  • Dana Drachsler-Cohen +1
  • Conference Article
  • Citations53

Bounding space usage of conservative garbage collectors

  • Jan 01, 2002
  • Hans-J Boehm
  • PDF
  • Abstract

Towards a Scottish Safe Haven Federation.

  • Aug 25, 2022
  • International Journal of Population Data Science
  • Chuang Gao +5
  • Conference Article

The Capturing of POE Data in Semantic Building Models

  • Sep 08, 2003
  • Debajyoti Pati +1
  • Research Article
  • Citations3

Hardware/Software Co-Assurance for the Rust Programming Language Applied to Zero Trust Architecture Development

  • Apr 05, 2023
  • ACM SIGAda Ada Letters
  • David Hardin
  • Research Article
  • Citations12

Bounding space usage of conservative garbage collectors

  • Jan 01, 2002
  • ACM SIGPLAN Notices
  • Hans-J Boehm
  • Conference Article
  • Citations5

Parametric modeling with user-defined features

  • Jul 12, 2001
  • Min Tang +3
  • Book Chapter
  • Citations1

Algorithm and Data Structures for Xeon Phi

  • Jan 01, 2013
  • Rezaur Rahman
  • Research Article
  • Citations34

A multivector data structure for differential forms and equations

  • Nov 01, 2000
  • Mathematics and Computers in Simulation
  • Jeffrey A Chard +1
  • Conference Article
  • Citations24

Smart data structures

  • Jun 14, 2011
  • Jonathan Eastep +2
  • Conference Article
  • Citations52

Transactional collection classes

  • Mar 14, 2007
  • Brian D Carlstrom +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.