Well-Structured Futures and Cache Locality

@article{Herlihy2016WellStructuredFA,
  title={Well-Structured Futures and Cache Locality},
  author={Maurice Herlihy and Zhiyu Liu},
  journal={ACM Trans. Parallel Comput.},
  year={2016},
  volume={2},
  pages={22:1-22:20}
}
  • Maurice Herlihy, Zhiyu Liu
  • Published in TOPC 2016
  • Computer Science
  • ACM Trans. Parallel Comput.
  • In fork-join parallelism, a sequential program is split into a directed acyclic graph of tasks linked by directed dependency edges, and the tasks are executed, possibly in parallel, in an order consistent with their dependencies. A popular and effective way to extend fork-join parallelism is to allow threads to create futures. A thread creates a future to hold the results of a computation, which may or may not be executed in parallel. That result is returned when some thread touches that future… CONTINUE READING
    1
    Twitter Mention

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 11 CITATIONS

    Proactive work stealing for futures

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Parallel determinacy race detection for futures

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Asynchronous programming with futures in C on a safety-critical platform in the railway-control domain

    VIEW 3 EXCERPTS
    CITES BACKGROUND

    Scheduling Parallel Computations by Work Stealing: A Survey

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES

    Cilk: An Efficient Multithreaded Runtime System

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL