Avoiding blocking by scheduling transactions using quantum annealing

Tim Bittner; Sven Groppe

doi:10.1145/3410566.3410593

Avoiding blocking by scheduling transactions using quantum annealing

Abstract

Quantum annealers are a special kind of quantum computers for solving optimization problems. In this paper, we investigate the benefits of quantum annealers in the field of transaction synchronization. In particular, we show how transactions using the 2-phase-locking protocol can be optimally distributed to any number of available machines to reduce transaction waiting times. Therefore an instance of the problem will be transformed into a formula that is accepted by quantum annealers. In an experimental evaluation, the runtime on a quantum annealer outperforms the runtime of traditional algorithms to solve combinatorial problems like simulated annealing already for small problem sizes.

Original language	English
Title of host publication	IDEAS '20: Proceedings of the 24th Symposium on International Database Engineering & Applications
Number of pages	10
Place of Publication	New York
Publisher	Association for Computing Machinery
Publication date	12.08.2020
Pages	1–10
Article number	3410593
ISBN (Print)	978-145037503-0
DOIs	https://doi.org/10.1145/3410566.3410593
Publication status	Published - 12.08.2020
Event	24th International Database Engineering & Applications Symposium - Seoul, Korea, Republic of Duration: 12.08.2020 → 14.08.2020

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 4 Quality Education
SDG 9 Industry, Innovation, and Infrastructure
SDG 11 Sustainable Cities and Communities
SDG 12 Responsible Consumption and Production
SDG 14 Life Below Water
SDG 15 Life on Land

Research Areas and Centers

Centers: Center for Artificial Intelligence Luebeck (ZKIL)
Research Area: Intelligent Systems

DFG Research Classification Scheme

4.43-03 Security and Dependability, Operating, Communication and Distributed Systems

Access to Document

10.1145/3410566.3410593

Cite this

@inproceedings{4f840af910d945be852622193cc11241,

title = "Avoiding blocking by scheduling transactions using quantum annealing",

abstract = "Quantum annealers are a special kind of quantum computers for solving optimization problems. In this paper, we investigate the benefits of quantum annealers in the field of transaction synchronization. In particular, we show how transactions using the 2-phase-locking protocol can be optimally distributed to any number of available machines to reduce transaction waiting times. Therefore an instance of the problem will be transformed into a formula that is accepted by quantum annealers. In an experimental evaluation, the runtime on a quantum annealer outperforms the runtime of traditional algorithms to solve combinatorial problems like simulated annealing already for small problem sizes. ",

author = "Tim Bittner and Sven Groppe",

note = "Publisher Copyright: {\textcopyright} 2020 ACM. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 24th International Database Engineering \& Applications Symposium , IDEAS 2020 ; Conference date: 12-08-2020 Through 14-08-2020",

year = "2020",

month = aug,

day = "12",

doi = "10.1145/3410566.3410593",

language = "English",

isbn = "978-145037503-0",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

pages = "1–10",

booktitle = "IDEAS '20: Proceedings of the 24th Symposium on International Database Engineering \& Applications",

}

Bittner, T & Groppe, S 2020, Avoiding blocking by scheduling transactions using quantum annealing. in IDEAS '20: Proceedings of the 24th Symposium on International Database Engineering & Applications., 3410593, ACM International Conference Proceeding Series, Association for Computing Machinery, New York, pp. 1–10, 24th International Database Engineering & Applications Symposium , Seoul, Korea, Republic of, 12.08.20. https://doi.org/10.1145/3410566.3410593

Avoiding blocking by scheduling transactions using quantum annealing. / Bittner, Tim; Groppe, Sven.
IDEAS '20: Proceedings of the 24th Symposium on International Database Engineering & Applications. New York: Association for Computing Machinery, 2020. p. 1–10 3410593 (ACM International Conference Proceeding Series).

Research output: Chapters in Books/Reports/Conference Proceedings › Conference contribution › peer-review

TY - GEN

T1 - Avoiding blocking by scheduling transactions using quantum annealing

AU - Bittner, Tim

AU - Groppe, Sven

PY - 2020/8/12

Y1 - 2020/8/12

N2 - Quantum annealers are a special kind of quantum computers for solving optimization problems. In this paper, we investigate the benefits of quantum annealers in the field of transaction synchronization. In particular, we show how transactions using the 2-phase-locking protocol can be optimally distributed to any number of available machines to reduce transaction waiting times. Therefore an instance of the problem will be transformed into a formula that is accepted by quantum annealers. In an experimental evaluation, the runtime on a quantum annealer outperforms the runtime of traditional algorithms to solve combinatorial problems like simulated annealing already for small problem sizes.

AB - Quantum annealers are a special kind of quantum computers for solving optimization problems. In this paper, we investigate the benefits of quantum annealers in the field of transaction synchronization. In particular, we show how transactions using the 2-phase-locking protocol can be optimally distributed to any number of available machines to reduce transaction waiting times. Therefore an instance of the problem will be transformed into a formula that is accepted by quantum annealers. In an experimental evaluation, the runtime on a quantum annealer outperforms the runtime of traditional algorithms to solve combinatorial problems like simulated annealing already for small problem sizes.

UR - https://www.scopus.com/pages/publications/85091108143

UR - https://www.mendeley.com/catalogue/6ac0b665-cc75-332c-ae09-a9b745c1a690/

U2 - 10.1145/3410566.3410593

DO - 10.1145/3410566.3410593

M3 - Conference contribution

SN - 978-145037503-0

T3 - ACM International Conference Proceeding Series

SP - 1

EP - 10

BT - IDEAS '20: Proceedings of the 24th Symposium on International Database Engineering & Applications

PB - Association for Computing Machinery

CY - New York

T2 - 24th International Database Engineering & Applications Symposium

Y2 - 12 August 2020 through 14 August 2020

ER -

Avoiding blocking by scheduling transactions using quantum annealing

Abstract

UN SDGs

Research Areas and Centers

DFG Research Classification Scheme

Access to Document

Other files and links

Fingerprint

Cite this