PMS: Probability-based Multi Successor Prefetch Algorithm for Software Streaming Services of Mobile Embedded Devices
Youngjae Lee, Seon-Yeong Park, Eun-Jj Pak, Daewoo Lee, Wook Rak Jung, Jin‐Soo Kim · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2007
As the demand of employing various PC software on mobile embedded devices which have limited storages has been increased, software streaming services are needed. However it takes too much time to launch software on them because it is transferred through wireless networks. To address this problem, prefetch algorithms are needed. We examined 'Last successor (LS)' algorithm and PPM-based prefetch algorithm as prefetch algorithms for software streaming services. We present 'Probability-base Multi Successor (PMS)' algorithm which is contrived through analyzing evaluations of previous algorithms and characteristics of software streaming services. While LS has one successor per each block, PMS has N successors based on probability which is calculated by PPM-based prefetch algorithm. The hit rate of PMS is similar to that of PPM-base prefetch algorithm and the space overhead is similar to that of LS. We can get good efficiency at the point of memory usage when PMS is applied to software streaming services.