Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1751828AbdFKGVd (ORCPT ); Sun, 11 Jun 2017 02:21:33 -0400 Received: from mail-ot0-f169.google.com ([74.125.82.169]:33657 "EHLO mail-ot0-f169.google.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1751743AbdFKGVb (ORCPT ); Sun, 11 Jun 2017 02:21:31 -0400 MIME-Version: 1.0 In-Reply-To: References: <8d5e793df4f06d54794a889543817cf5be131650.1497002895.git.viresh.kumar@linaro.org> From: Joel Fernandes Date: Sat, 10 Jun 2017 23:21:30 -0700 Message-ID: Subject: Re: [PATCH 2/3] cpufreq: schedutil: Fix selection algorithm while reducing frequency To: Viresh Kumar Cc: Rafael Wysocki , Ingo Molnar , Peter Zijlstra , linaro-kernel@lists.linaro.org, Linux PM , LKML , Vincent Guittot , Juri Lelli , Patrick Bellasi , John Ettedgui , Srinivas Pandruvada , Morten Rasmussen Content-Type: text/plain; charset="UTF-8" Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org Content-Length: 1467 Lines: 29 On Sat, Jun 10, 2017 at 2:11 AM, Joel Fernandes wrote: > On Fri, Jun 9, 2017 at 3:15 AM, Viresh Kumar wrote: >> While reducing frequency if there are no frequencies available between >> "current" and "next" calculated frequency, then the core will never >> select the "next" frequency. >> >> For example, consider the possible range of frequencies as 900 MHz, 1 >> GHz, 1.1 GHz, and 1.2 GHz. If the current frequency is 1.1 GHz and the >> next frequency (based on current utilization) is 1 GHz, then the >> schedutil governor will try to set the average of these as the next >> frequency (i.e. 1.05 GHz). >> >> Because we always try to find the lowest frequency greater than equal to >> the target frequency, cpufreq_driver_resolve_freq() will end up >> returning 1.1 GHz only. And we will not be able to reduce the frequency >> eventually. The worst hit is the policy->min frequency as that will >> never get selected after the frequency is increased once. > > But once utilization goes to 0, it will select the min frequency > (because it selects lowest frequency >= target)? Never mind my comment about util 0, I see the problem you mention. However I feel that this entire series adds complexity all to handle the case of a false cache-miss which I think might not be that bad, and the tradeoff with complexity/readability of the code kind of negates the benefit. That's just my opinion about it fwiw. Thanks, Joel