New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[feature request] lazy sorting (exponentially decaying moving average) #827

gamer01 opened this Issue Aug 13, 2018 · 1 comment


None yet
2 participants

gamer01 commented Aug 13, 2018

htop updates sorting every second with makes the view quiet unstable when many processes have similar computation.

Allow sorting to be more lazy, by using an exponential moving average. Its like the windowed average for "load avg", but is way easier to calculate. Therefore processes that have a high consumption over a longer period will be placed on top and processes that really spike will also be on top.

But this feature would not be suitable in every use case so it would have to be disabled by default and could be enabled via the options.

If you consider this idea, i can get much more detailed.


This comment has been minimized.

Show comment
Hide comment

benyanke Aug 28, 2018

This sounds quite useful.

benyanke commented Aug 28, 2018

This sounds quite useful.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment