From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1752017AbdF3ATR (ORCPT ); Thu, 29 Jun 2017 20:19:17 -0400 Received: from mail-oi0-f47.google.com ([209.85.218.47]:35638 "EHLO mail-oi0-f47.google.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1751896AbdF3ATP (ORCPT ); Thu, 29 Jun 2017 20:19:15 -0400 MIME-Version: 1.0 From: Joel Fernandes Date: Thu, 29 Jun 2017 17:19:14 -0700 Message-ID: Subject: wake_wide mechanism clarification To: Mike Galbraith Cc: Peter Zijlstra , LKML , Juri Lelli , Dietmar Eggemann , Patrick Bellasi , Brendan Jackman , Chris Redpath , Josef Bacik Content-Type: text/plain; charset="UTF-8" Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org Dear Mike, I wanted your kind help to understand your patch "sched: beef up wake_wide()"[1] which is a modification to the original patch from Michael Wang [2]. In particular, I didn't following the following comment: " to shared cache, we look for a minimum 'flip' frequency of llc_size in one partner, and a factor of lls_size higher frequency in the other." Why are wanting the master's flip frequency to be higher than the slaves by the factor? The code here is written as: if (slave < factor || master < slave * factor) return 0; However I think we should just do (with my current and probably wrong understanding): if (slave < factor || master < factor) return 0; Basically, I didn't follow why we multiply the slave's flips with llc_size. That makes it sound like the master has to have way more flips than the slave to return 0 from wake_wide. Could you maybe give an example to clarify? Thanks a lot for your help, I am also CC'ing Peter and some ARM folks for the discussion (and also Jocef who was discuss it with Mike on the mailing list few years ago). Thanks, Joel [1] https://patchwork.kernel.org/patch/6787941/ [2] https://lkml.org/lkml/2013/7/4/20