From e635ad2bcf9d2f5340bbb0673cdafdb03754a933 Mon Sep 17 00:00:00 2001 From: "xin.li" Date: Mon, 25 Apr 2022 21:45:03 +0800 Subject: [PATCH] [zh] Update shuffle-sharding.md Signed-off-by: xin.li --- .../reference/glossary/shuffle-sharding.md | 22 +++++++++---------- 1 file changed, 11 insertions(+), 11 deletions(-) diff --git a/content/zh/docs/reference/glossary/shuffle-sharding.md b/content/zh/docs/reference/glossary/shuffle-sharding.md index 4bc7f91189..494c12168a 100644 --- a/content/zh/docs/reference/glossary/shuffle-sharding.md +++ b/content/zh/docs/reference/glossary/shuffle-sharding.md @@ -1,6 +1,6 @@ --- title: 混排切片（Shuffle Sharding） -id: shuffle-sharding +id: shuffle sharding date: 2020-03-04 full_link: short_description: > @@ -40,8 +40,8 @@ We are often concerned with insulating different flows of requests from each other, so that a high-intensity flow does not crowd out low-intensity flows. A simple way to put requests into queues is to hash some characteristics of the request, modulo the number of queues, to get -the index of the queue to use. The hash function uses as input -characteristics of the request that align with flows. For example, in +the index of the queue to use. The hash function uses as input +characteristics of the request that align with flows. For example, in the Internet this is often the 5-tuple of source and destination address, protocol, and source and destination port. --> @@ -57,21 +57,21 @@ address, protocol, and source and destination port. That simple hash-based scheme has the property that any high-intensity flow will crowd out all the low-intensity flows that hash to the same queue. Providing good insulation for a large number of flows requires a large -number of queues, which is problematic. Shuffle sharding is a more +number of queues, which is problematic. Shuffle sharding is a more nimble technique that can do a better job of insulating the low-intensity -flows from the high-intensity flows. The terminology of shuffle sharding uses +flows from the high-intensity flows. The terminology of shuffle sharding uses the metaphor of dealing a hand from a deck of cards; each queue is a -metaphorical card. The shuffle sharding technique starts with hashing +metaphorical card. The shuffle sharding technique starts with hashing the flow-identifying characteristics of the request, to produce a hash -value with dozens or more of bits. Then the hash value is used as a +value with dozens or more of bits. Then the hash value is used as a source of entropy to shuffle the deck and deal a hand of cards -(queues). All the dealt queues are examined, and the request is put -into one of the examined queues with the shortest length. With a +(queues). All the dealt queues are examined, and the request is put +into one of the examined queues with the shortest length. With a modest hand size, it does not cost much to examine all the dealt cards and a given low-intensity flow has a good chance to dodge the effects of a -given high-intensity flow. With a large hand size it is expensive to examine +given high-intensity flow. With a large hand size it is expensive to examine the dealt queues and more difficult for the low-intensity flows to dodge the -collective effects of a set of high-intensity flows. Thus, the hand size +collective effects of a set of high-intensity flows. Thus, the hand size should be chosen judiciously. --> 这种简单的基于哈希的模式有一种特性，高密度的请求序列（流）会湮没那些被