crunch-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Chao Shi (JIRA)" <>
Subject [jira] [Commented] (CRUNCH-351) Improve performance of Shard#shard on large records
Date Mon, 24 Feb 2014 13:47:20 GMT


Chao Shi commented on CRUNCH-351:

bq. with the idea of having a really small number of different keys so that sorting the keys
within each partition would require almost no processing.

I think I have missed something here. I guess there must be some optimization in MR for such
case. Could you explain more how this works?

bq. count = (++count % (numPartitions * 3));

Is it identical to "count = ++count % numPartitions", given the partition function is "key
% numPartitions"?

> Improve performance of Shard#shard on large records
> ---------------------------------------------------
>                 Key: CRUNCH-351
>                 URL:
>             Project: Crunch
>          Issue Type: Improvement
>            Reporter: Chao Shi
>            Assignee: Chao Shi
>         Attachments: crunch-351-v2.patch, crunch-351.patch
>     This avoids sorting on the input data, which may be long and make
>     shuffle phase slow. The improvement is to sort on pseudo-random numbers.

This message was sent by Atlassian JIRA

View raw message