YunFan Zhou updated YARN-6361:
    Comment: was deleted

(was: [~yufeigu]  Thank you very much, Yufei. 
I have to say that this JIRA's description describes a very good idea, and I 
have achieved the corresponding code.
I used *O(N)* complexity before sorting to calculate the properties of each 
application,  and then according to the computed properties of each application 
ordering all applications using O(n*log(n)) complexity.
It does look a lot faster. And I'll test the bench mark tomorrow, and see how 
the optimization of this approach improves performance compared to the 
unoptimized performance.)

> FairScheduler: FSLeafQueue.fetchAppsWithDemand CPU usage is high with big 
> queues
> --------------------------------------------------------------------------------
>                 Key: YARN-6361
>                 URL: https://issues.apache.org/jira/browse/YARN-6361
>             Project: Hadoop YARN
>          Issue Type: Sub-task
>            Reporter: Miklos Szegedi
>            Assignee: YunFan Zhou
>         Attachments: dispatcherthread.png, threads.png, YARN-6361.001.patch
> FSLeafQueue.fetchAppsWithDemand sorts the applications by the current policy. 
> Most of the time is spent in FairShareComparator.compare. We could improve 
> this by doing the calculations outside the sort loop {{(O\(n\))}} and we 
> sorted by a fixed number inside instead {{O(n*log\(n\))}}. This could be an 
> performance issue when there are huge number of applications in a single 
> queue. The attachments shows the performance impact when there are 10k 
> applications in one queue.

This message was sent by Atlassian JIRA

To unsubscribe, e-mail: yarn-issues-unsubscr...@hadoop.apache.org
For additional commands, e-mail: yarn-issues-h...@hadoop.apache.org

Reply via email to