Market share for android smartphones have been increasing exponentially day by day. With this increase in numbers of phones sold every year, even the demands for a better quality of the android phones are increasing in the competitive market. To meet the high expectations of users, companies are putting good amount of efforts in the improvement of hardware as well as software. While smartphone hardware market is already saturating to an extent, there is a lot of scope for improvement on software design on top of Google’s stock Android for better user experience. As far as user experience is concerned, application launch time is one of the most important performance parameter for any smartphone device. In general, due to the usage of many applications, a good amount of RAM gets consumed resulting in phone sluggishness. This sluggishness is very much visible to the user especially when a particular application, which user wanted to re-use, is already killed by LMK. In our proposed solution, we intend to provide a better user experience by improving LMK’s algorithm based on user’s usage of various applications. Thereby, enhance user experience by decreasing application launch time of favorite applications.CodeShoppy
LRU lists gets updated. The problem that may arise using the LRU list algorithm is that an application which the user uses very frequently might still get killed by LMK, if that application was not used recently. In such scenarios, when user re-opens its favorite application, the application takes more time to start as it is forking the process instead of resuming. This increased launch time is perceived as sluggishness to the user. In our proposed approach, we try to tackle such scenarios by making sure that at least user’s favorite applications are given less priority to get killed by LMK
In order to avoid heavy applications falling in this category, we also keep a check for the memory proportionate set size (PSS) value [7]. Whenever the PSS value goes higher than 30 MB we don’t consider applying our algorithm to such applications. We have included this check in our algorithm in order to remove any possibility that may hamper our algorithm due to memory leak of any frequently used heavy application. As process record gets update many a times, these checks are put in the right location which doesn’t increase the overhead of calculation very much.
Comments