Polymorphic Contention Management

摘要: In software transactional memory (STM) systems, a contention manager resolves conflicts among transactions accessing the same locations. Whereas atomicity and serializability of are guaranteed at all times, is crucial importance for guaranteeing that system as whole makes progress. A number different management policies have been proposed evaluated in recent literature. An empirical evaluation these leads to striking result there seems be no “universal” works best under reasonable circumstances. Instead, transaction throughput can vary dramatically depending on factors such length, data access patterns, length contended vs. uncontended phases, so on. This paper proposes polymorphic management, structure allows managers not just across workloads, but concurrent single workload, even phases transaction. The ability mix or change them on-the-fly provides performance benefits, also poses questions concerning how given class interact useful way with different, possibly unknown classes. We address by classifying hierarchy, based cost associated each manager, present general algorithm handle conflict between from describe our smoothly integrated nested SXM library.