From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Date: Wed, 6 Feb 2019 13:52:44 +0300 From: Vladimir Davydov Subject: Re: [tarantool-patches] Re: [PATCH 7/9] vinyl: randomize range compaction to avoid IO load spikes Message-ID: <20190206105244.c4gkhb3xsn2pkqmp@esperanza> References: <44f34fbaf09af5d1054f2e4843a77e095afe1e71.1548017258.git.vdavydov.dev@gmail.com> <20190122125458.cutoz5rtfd2sb6el@esperanza> <20190205173958.GG6811@chai> <20190206085302.3xzjz2udfvdin5ld@esperanza> <20190206104419.GD19953@chai> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20190206104419.GD19953@chai> To: Konstantin Osipov Cc: tarantool-patches@freelists.org List-ID: On Wed, Feb 06, 2019 at 01:44:19PM +0300, Konstantin Osipov wrote: > * Vladimir Davydov [19/02/06 13:31]: > > Over how many dumps? What do we do after restart, when there's no > > history and perhaps even no level 1? > > A am thinking about something along these lines: > f(n+1) = (f(n) + x*k)(1+k) - where k is the weight used to scale > the next input What should be k equal to? Also, what we should do after restart when there's no history? Why is using the last level size as reference bad? > > alternatively: > > f(n+1) = sqrt((f(n)^2 + x^2)/2)