Re: Interesting paper: Contention-Aware Lock Scheduling

From: Evgeniy Shishkin <itparanoia(at)gmail(dot)com>
To: Garym <garym(at)oedata(dot)com>
Cc: pgsql-hackers(at)lists(dot)postgresql(dot)org
Subject: Re: Interesting paper: Contention-Aware Lock Scheduling
Date: 2018-04-13 17:50:38
Message-ID: 2B59EC36-30D0-46F7-B636-F2BE8E7CE7E8@gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

> On Apr 13, 2018, at 20:46, Garym <garym(at)oedata(dot)com> wrote:
>
> LDFS does show improvements for certain workloads, however it sacrifices temporal order and may interfere with historical analytics. If applications can tolerate ambiguous order of processing, it shows good gains.

AFAIK, we don't guarantee order of processing anyway. Just some order.

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Garym 2018-04-13 18:02:15 Re: Interesting paper: Contention-Aware Lock Scheduling
Previous Message Garym 2018-04-13 17:46:25 Re: Interesting paper: Contention-Aware Lock Scheduling