Dynamic memory reclamation is arguably the biggest open problem in concurrent data structure design: All known solutions induce high overhead, or must be customized to the specific data structure by the programmer, or both. This paper presents StackTrack, the first concurrent memory reclamation scheme that can be applied automatically by a compiler, while maintaining efficiency. StackTrack eliminates most of the expensive bookkeeping required for memory reclamation by leveraging the power of hardware transactional memory (HTM) in a new way: it tracks thread variables dynamically, and in an atomic fashion. This effectively makes all memory references visible without having threads pay the overhead of writing out this information. Our empirical results show that this new approach matches or outperforms prior, non-automated, techniques.
|State||Published - 2014|
|Event||9th ACM European Conference on Computer Systems, EuroSys 2014 - Amsterdam, Netherlands|
Duration: 14 Apr 2014 → 16 Apr 2014
|Conference||9th ACM European Conference on Computer Systems, EuroSys 2014|
|Period||14/04/14 → 16/04/14|