From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from relay-out4.mail.masterhost.ru (relay-out4.mail.masterhost.ru [83.222.12.14]) by dpdk.org (Postfix) with ESMTP id 4FDA8160 for ; Mon, 16 Jul 2018 19:35:01 +0200 (CEST) Received: from [37.139.80.50] (helo=nw) by relay4.mail.masterhost.ru with esmtpa envelope from authenticated with alex@therouter.net message id 1ff7Od-0003HL-GN; Mon, 16 Jul 2018 20:34:52 +0300 Date: Mon, 16 Jul 2018 20:34:45 +0300 From: Alex Kiselev Message-ID: <873586679.20180716203445@therouter.net> To: Stephen Hemminger CC: "dev@dpdk.org" , Bruce Richardson In-Reply-To: <20180711133025.256a8ae1@xeon-e3> References: <20180711175356.035761B462@dpdk.org> <20180711133025.256a8ae1@xeon-e3> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-KLMS-Rule-ID: 1 X-KLMS-Message-Action: clean X-KLMS-AntiSpam-Lua-Profiles: 126951 [Jul 16 2018] X-KLMS-AntiSpam-Version: 5.8.3.0 X-KLMS-AntiSpam-Envelope-From: alex@therouter.net X-KLMS-AntiSpam-Rate: 0 X-KLMS-AntiSpam-Status: not_detected X-KLMS-AntiSpam-Method: none X-KLMS-AntiSpam-Info: LuaCore: 150 150 2a697033e93a7ef849763582d9d751a194e74ff1, {rep_avail}, DmarcAF: none X-MS-Exchange-Organization-SCL: -1 X-KLMS-AntiSpam-Interceptor-Info: scan successful X-KLMS-AntiPhishing: not scanned, disabled by settings X-KLMS-AntiVirus: Kaspersky Security for Linux Mail Server, version 8.0.2.16, not scanned, license restriction Subject: Re: [dpdk-dev] [PATCH v3 1/2] librte_lpm: Improve performance of the delete and add functions X-BeenThere: dev@dpdk.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: DPDK patches and discussions List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 16 Jul 2018 17:35:01 -0000 > On Wed, 11 Jul 2018 20:53:46 +0300 > Alex Kiselev wrote: >> librte_lpm: Improve lpm6 performance >> Rework the lpm6 rule subsystem and replace >> current rules algorithm complexity O(n) >> with hashtables which allow dealing with >> large (50k) rule sets. > Wouldn't it make more sense to use something like tree, and use left/right > in the rules entry. That way the memory is spread and scales with the number > of rules. I guess you are trying to propose using a radix tree. I agree, it uses memory more efficient than hashtable. But, it would require to add a new dpdk library implementing a radix tree, then we can talk about using it as a lpm rule storage. -- Alex