Parallel Working-Set Search Structures

Abstract

In this paper 1 we present two versions of a parallel working-set map on p processors that supports searches, insertions and deletions. In both versions, the total work of all operations when the map has size at least p is bounded by the working-set bound, i.e., the cost of an item depends on how recently it was accessed (for some linearization): accessing… (More)
DOI: 10.1145/3210377.3210390

3 Figures and Tables