Scheduling OLTP Transactions via Machine Learning

by   Yangjun Sheng, et al.

Current main memory database system architectures are still challenged by high contention workloads and this challenge will continue to grow as the number of cores in processors continues to increase. These systems schedule transactions randomly across cores to maximize concurrency and to produce a uniform load across cores. Scheduling never considers potential conflicts. Performance could be improved if scheduling balanced between concurrency to maximize throughput and scheduling transactions linearly to avoid conflicts. In this paper, we present the design of several intelligent transaction scheduling algorithms that consider both potential transaction conflicts and concurrency. To incorporate reasoning about transaction conflicts, we develop a supervised machine learning model that estimates the probability of conflict. This model is incorporated into several scheduling algorithms. In addition, we integrate an unsupervised machine learning algorithm into an intelligent scheduling algorithm. We then empirically measure the performance impact of different scheduling algorithms on OLTP and social networking workloads. Our results show that, with appropriate settings, intelligent scheduling can increase throughput by 54 scheduling. In summary, the paper provides preliminary evidence that intelligent scheduling significantly improves DBMS performance.



There are no comments yet.


page 17

page 26

page 27


Improving High Contention OLTP Performance via Transaction Scheduling

Research in transaction processing has made significant progress in impr...

XOX Fabric: A hybrid approach to transaction execution

Performance and scalability are a major concern for blockchain systems t...

State-Dependent Processing in Payment Channel Networks for Throughput Optimization

Payment channel networks (PCNs) have emerged as a scalability solution f...

Robustness against Read Committed for Transaction Templates

The isolation level Multiversion Read Committed (RC), offered by many da...

OS Scheduling Algorithms for Memory Intensive Workloads in Multi-socket Multi-core servers

Major chip manufacturers have all introduced multicore microprocessors. ...

Index-Based Scheduling for Parallel State Machine Replication

State Machine Replication (SMR) is a fundamental approach to designing s...

Robustness against Read Committed for Transaction Templates with Functional Constraints

The popular isolation level Multiversion Read Committed (RC) trades some...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.