[
https://issues.apache.org/jira/browse/HADOOP-2284?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Amar Kamat updated HADOOP-2284:
-------------------------------
Attachment: HADOOP-2284.patch
Attaching the patch that should reduce the calls to progress and also the time
spent in unwrapping. Owen could you plz check and let us know. Can we do better
if we know the number of elements getting sorted say 'n'? That is can we make
it dynamic based on 'n', something like {{update-freq = n ^2^/ k}}, k could be
log( n ), 100, 1000.
> BasicTypeSorterBase.compare calls progress on each compare
> ----------------------------------------------------------
>
> Key: HADOOP-2284
> URL: https://issues.apache.org/jira/browse/HADOOP-2284
> Project: Hadoop
> Issue Type: Bug
> Components: mapred
> Reporter: Owen O'Malley
> Assignee: Amar Kamat
> Fix For: 0.16.0
>
> Attachments: HADOOP-2284.patch
>
>
> The inner loop of the sort is calling progress on each compare. I think it
> would make more sense to call progress in the sort rather than the compare or
> at most every 10000 compares. In the performance numbers, the call to
> progress as part of the sort are consuming 12% of the total cpu time when
> running word count under the local runner.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
