darxtrix/ptop

Optimize the sorting behavior

Open

#31 opened on Jul 29, 2017

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Python (573 stars) (43 forks)batch import
good first issue

Description

See if there is any scope of optimizing the sorting behavior.

  • We don't have to sort each time the processes list, I guess we can use an index for the relevance sort. But for this also we have to get all the process ids that are active and add new process ids and remove all the old process ids from the index. And then display the sorted processes using the index and the process hash map.

Contributor guide

Tech stack
python
Domain
performance
Issue type
performance
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
stale
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
mostly clear
Prerequisites
Pythondata structures
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
40
Research direction
Investigate the current sorting implementation in the codebase, likely in the main process listing module. The suggestion is to maintain an index for relevance sorting instead of re sorting the entire process list each time. Look for how process IDs are managed and consider implementing an index that adds/removes IDs as processes appear/disappear. Check the existing data structures and see if a sorted list or heap could be used to avoid full sorts.