From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mga07.intel.com (mga07.intel.com [134.134.136.100]) by dpdk.org (Postfix) with ESMTP id 9775368BD for ; Fri, 2 Dec 2016 15:50:45 +0100 (CET) Received: from orsmga005.jf.intel.com ([10.7.209.41]) by orsmga105.jf.intel.com with ESMTP; 02 Dec 2016 06:50:44 -0800 X-ExtLoop1: 1 X-IronPort-AV: E=Sophos;i="5.33,287,1477983600"; d="scan'208";a="38071776" Received: from sie-lab-214-036.ir.intel.com (HELO silpixa00394365.ir.intel.com) ([10.237.214.36]) by orsmga005.jf.intel.com with ESMTP; 02 Dec 2016 06:50:43 -0800 From: Pablo de Lara To: dev@dpdk.org Cc: Pablo de Lara Date: Fri, 2 Dec 2016 14:52:18 +0000 Message-Id: <1480690340-17652-1-git-send-email-pablo.de.lara.guarch@intel.com> X-Mailer: git-send-email 2.7.4 MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Subject: [dpdk-dev] [PATCH 0/2] Elastic Flow Distributor 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: Fri, 02 Dec 2016 14:50:46 -0000 EFD is a distributor library that uses perfect hashing to determine a target/value for a given incoming flow key. It has the following advantages: first, because it uses perfect hashing it does not store the key itself and hence lookup performance is not dependent on the key size. Second, the target/value can be any arbitrary value hence the system designer and/or operator can better optimize service rates and inter-cluster network traffic locating. Third, since the storage requirement is much smaller than a hash-based flow table (i.e. better fit for CPU cache), EFD can scale to millions of flow keys. Finally, with current optimized library implementation performance is fully scalable with number of CPU cores. The basic idea of EFD is when a given key is to be inserted, a family of hash functions is searched until the correct hash function that maps the input key to the correct value is found. However, rather than explicitly storing all keys and their associated values, EFD stores only indices of hash functions that map keys to values, and thereby consumes much less space than conventional flow-based tables. The lookup operation is very simple, similar to computational-based scheme, given an input key the lookup operation is reduced to hashing that key with the correct hash function. Intuitively, finding a hash function that maps each of a large number (millions) of input keys to the correct output value is effectively impossible, as a result EFD, breaks the problem into smaller pieces (divide and conquer). EFD divides the entire input key set into many small groups. Each group consists of approximately 20-28 keys (a configurable parameter for the library), then, for each small group, a brute force search to find a hash function that produces the correct outputs for each key in the group. It should be mentioned that since in the online lookup table for EFD doesn’t store the key itself, the size of the EFD table is independent of the key size and hence EFD lookup performance which is almost constant irrespective of the length of the key which is a highly desirable feature especially for longer keys. Library code is included in the patch, plus an sample application that shows how the library can be used. RFC for this library was already sent: http://dpdk.org/ml/archives/dev/2016-October/049238.html For more information on the library, check out the following document: https://github.com/pablodelara/perfect_hash_flow_distributor/blob/master/EFD_description.pdf Pablo de Lara (2): efd: new Elastic Flow Distributor library examples/flow_distributor: sample app to demonstrate EFD usage config/common_base | 5 + examples/Makefile | 1 + examples/flow_distributor/Makefile | 44 + examples/flow_distributor/distributor/Makefile | 57 ++ examples/flow_distributor/distributor/args.c | 200 ++++ examples/flow_distributor/distributor/args.h | 39 + examples/flow_distributor/distributor/init.c | 371 ++++++++ examples/flow_distributor/distributor/init.h | 76 ++ examples/flow_distributor/distributor/main.c | 362 +++++++ examples/flow_distributor/node/Makefile | 48 + examples/flow_distributor/node/node.c | 417 ++++++++ examples/flow_distributor/shared/common.h | 99 ++ lib/Makefile | 1 + lib/librte_eal/common/include/rte_log.h | 1 + lib/librte_efd/Makefile | 56 ++ lib/librte_efd/rte_efd.c | 1203 ++++++++++++++++++++++++ lib/librte_efd/rte_efd.h | 312 ++++++ lib/librte_efd/rte_efd_version.map | 12 + mk/rte.app.mk | 1 + 19 files changed, 3305 insertions(+) create mode 100644 examples/flow_distributor/Makefile create mode 100644 examples/flow_distributor/distributor/Makefile create mode 100644 examples/flow_distributor/distributor/args.c create mode 100644 examples/flow_distributor/distributor/args.h create mode 100644 examples/flow_distributor/distributor/init.c create mode 100644 examples/flow_distributor/distributor/init.h create mode 100644 examples/flow_distributor/distributor/main.c create mode 100644 examples/flow_distributor/node/Makefile create mode 100644 examples/flow_distributor/node/node.c create mode 100644 examples/flow_distributor/shared/common.h create mode 100644 lib/librte_efd/Makefile create mode 100644 lib/librte_efd/rte_efd.c create mode 100644 lib/librte_efd/rte_efd.h create mode 100644 lib/librte_efd/rte_efd_version.map -- 2.7.4