Re: Interesting paper: Contention-Aware Lock Scheduling

2018-12-10 Thread Ibrar Ahmed
On Mon, May 7, 2018 at 10:54 PM Юрий Соколов wrote: > 2018-05-04 23:45 GMT+03:00 AJG : > > > > Another interesting article from Jan 2018 (Tsinghua University and > Microsoft > > Research) > > > > http://madsys.cs.tsinghua.edu.cn/publications/TS2018-liu.pdf > > > > DudeTx: Durable Transactions Mad

Re: Interesting paper: Contention-Aware Lock Scheduling

2018-05-07 Thread Юрий Соколов
2018-05-04 23:45 GMT+03:00 AJG : > > Another interesting article from Jan 2018 (Tsinghua University and Microsoft > Research) > > http://madsys.cs.tsinghua.edu.cn/publications/TS2018-liu.pdf > > DudeTx: Durable Transactions Made Decoupled Cite from pdf: > The key insight of our solution is decoup

Re: Interesting paper: Contention-Aware Lock Scheduling

2018-05-07 Thread AJG
Another interesting article from Jan 2018 (Tsinghua University and Microsoft Research) http://madsys.cs.tsinghua.edu.cn/publications/TS2018-liu.pdf DudeTx: Durable Transactions Made Decoupled "This paper presents DudeTx, a crash-consistent durable transaction system that avoids the drawbacks of

Re: Interesting paper: Contention-Aware Lock Scheduling

2018-04-13 Thread Garym
I did testing on 9.6 and 10. Outside of slaves at distance, it does demonstrate consistent OOA operation whether intentional/enforced or not. :) Sent from my iPad > On Apr 13, 2018, at 11:50 AM, Evgeniy Shishkin wrote: > > > >> On Apr 13, 2018, at 20:46, Garym wrote: >> >> LDFS does show

Re: Interesting paper: Contention-Aware Lock Scheduling

2018-04-13 Thread Evgeniy Shishkin
> On Apr 13, 2018, at 20:46, Garym 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 o

Re: Interesting paper: Contention-Aware Lock Scheduling

2018-04-13 Thread Garym
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. Sent from my iPad > On Apr 13, 2018, at 11:14 AM, Konstantin Knizhnik > wrote:

Re: Interesting paper: Contention-Aware Lock Scheduling

2018-04-13 Thread Konstantin Knizhnik
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 RD

Interesting paper: Contention-Aware Lock Scheduling

2018-01-31 Thread Thomas Munro
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