Provably good scheduling for parallel programs that use data structures through implicit batching

Authors:
Kunal Agrawal;Jeremy T. Fineman;Brendan Sheridan;Jim Sukha;Robert Utterback
Affiliations:
Washington University in St Louis, St Louis, MO, USA;Georgetown University, Washington, DC, USA;Georgetown University, Washington, DC, USA;Intel Corporation, Merrimack, NH, USA;Washington University in St Louis, St Louis, MO, USA
Venue:
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
Year:
2014

Citing 4
Cited 0

Scheduling multithreaded computations by work stealing

Journal of the ACM (JACM)
Parallel Dictionaries in 2-3 Trees

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Flat combining and the synchronization-parallelism tradeoff

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A lock-free B+tree

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

This poster proposes an efficient runtime scheduler that provides provable performance guarantees to parallel programs that use data structures through the use of implicit batching.