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

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.