Lookup NU author(s): Dr Craig Sharp,
Dr Graham Morgan
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
In this paper we describe an implementation for exploring the scheduling of aborted transactions within transactional memory systems. We consider application semantics to be just as important as guaranteeing linearizability in arriving at an appropriate execution strategy. Our approach exploits parallelism to simultaneously create different execution orderings for rescheduled aborted transactions and chooses the most beneficial for application progression. The overall solution guarantees a lock-free universal construction if there exists at least one transaction that can commit. The appropriateness of our approach is demonstrated via micro-benchmark performance figures.
Author(s): Sharp C, Morgan G
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Euro-Par 2013 Parallel Processing
Year of Conference: 2013
Library holdings: Search Newcastle University Library for this item