Article thumbnail
Location of Repository

HaTS: Hardware-Assisted Transaction Scheduler

By Zhanhao Chen, Ahmed Hassan, Masoomeh Javidi Kishi, Jacob Nelson and Roberto Palmieri

Abstract

In this paper we present HaTS, a Hardware-assisted Transaction Scheduler. HaTS improves performance of concurrent applications by classifying the executions of their atomic blocks (or in-memory transactions) into scheduling queues, according to their so called conflict indicators. The goal is to group those transactions that are conflicting while letting non-conflicting transactions proceed in parallel. Two core innovations characterize HaTS. First, HaTS does not assume the availability of precise information associated with incoming transactions in order to proceed with the classification. It relaxes this assumption by exploiting the inherent conflict resolution provided by Hardware Transactional Memory (HTM). Second, HaTS dynamically adjusts the number of the scheduling queues in order to capture the actual application contention level. Performance results using the STAMP benchmark suite show up to 2x improvement over state-of-the-art HTM-based scheduling techniques

Topics: Transactions, Scheduling, Hardware Transactional Memory, Data processing Computer science
Publisher: LIPIcs - Leibniz International Proceedings in Informatics. 23rd International Conference on Principles of Distributed Systems (OPODIS 2019)
Year: 2020
DOI identifier: 10.4230/LIPIcs.OPODIS.2019.10
OAI identifier: oai:drops-oai.dagstuhl.de:11796

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.