Search String: Display: Description: Sort:

Results:

References: [ +subject:/^(?:^\s*(re|sv|fwd|fw)[\[\]\d]*[:>-]+\s*)*\[PATCH\s+net\-next\s+v1\]\s+ipvs\:\s+fix\s+multiplicative\s+hashing\s+in\s+sh\/dh\/lblc\/lblcr\s+algorithms\s*$/: 3 ]

Total 3 documents matching your query.

1. Re: [PATCH net-next v1] ipvs: fix multiplicative hashing in sh/dh/lblc/lblcr algorithms (score: 1)
Author: Vincent Bernat <vincent@xxxxxxxxx>
Date: Sun, 01 Apr 2018 12:16:10 +0200
1 avril 2018 11:11 +0300, Julian Anastasov <ja@xxxxxx> : I didn't notice this macro. I think this is a better option. Let me amend the patch. -- Don't stop with your first draft. - The Elements of Pr
/html/lvs-devel/2018-04/msg00001.html (10,767 bytes)

2. Re: [PATCH net-next v1] ipvs: fix multiplicative hashing in sh/dh/lblc/lblcr algorithms (score: 1)
Author: Julian Anastasov <ja@xxxxxx>
Date: Sun, 1 Apr 2018 11:11:08 +0300 (EEST)
Hello, Good catch. Looks like the '& mask' part is not needed, still, it does not generate extra code. I see that other code uses hash_32(val, bits) from include/linux/hash.h but note that it used di
/html/lvs-devel/2018-04/msg00000.html (12,602 bytes)

3. [PATCH net-next v1] ipvs: fix multiplicative hashing in sh/dh/lblc/lblcr algorithms (score: 1)
Author: Vincent Bernat <vincent@xxxxxxxxx>
Date: Sun, 1 Apr 2018 00:28:38 +0200
The sh/dh/lblc/lblcr algorithms are using Knuth's multiplicative hashing incorrectly. This results in uneven distribution. In the fixed-point version, The division by 2^q is crucial. The common mista
/html/lvs-devel/2018-03/msg00033.html (13,566 bytes)


This search system is powered by Namazu