Re: Interesting paper: Contention-Aware Lock Scheduling

From: Konstantin Knizhnik <k(dot)knizhnik(at)postgrespro(dot)ru>
To: pgsql-hackers(at)lists(dot)postgresql(dot)org
Subject: Re: Interesting paper: Contention-Aware Lock Scheduling
Date: 2018-04-13 17:14:37
Message-ID: 43f52903-a7d7-0069-9d31-23c44f13a9f1@postgrespro.ru
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On 31.01.2018 22:48, Thomas Munro wrote:
> Hi hackers,
>
> I saw this today: http://www.vldb.org/pvldb/vol11/p648-tian.pdf
>
> It describes the "LDSF" (largest-dependency-set-first) lock scheduling
> algorithm and related work, as an alternative to the FIFO scheduling
> used by PostgreSQL and most other RDBMSs. LDSF been implemented in
> MySQL 8. The TPC-C results shown are impressive.
>
Yet another another interesting article
http://cs-www.cs.yale.edu/homes/dna/papers/orthrus-sigmod16.pdf
with completely different approach: they deprive executors from
obtaining locks themselves and move all concurrency control to some
special workers,
with which executors are communicated using message-passing.

--
Konstantin Knizhnik
Postgres Professional: http://www.postgrespro.com
The Russian Postgres Company

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Evgeniy Shishkin 2018-04-13 17:23:22 Re: Native partitioning tablespace inheritance
Previous Message Robert Haas 2018-04-13 17:12:28 Re: [HACKERS] path toward faster partition pruning