IJSTR

International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
0.2
2019CiteScore
 
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020

CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT

IJSTR >> Volume 10 - Issue 6, June 2021 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Random Sampling SPM Management Algorithm For Single Processing Core

[Full Text]

 

AUTHOR(S)

Kavita Tabbassum, Shahnawaz Farhan, Suhni Abbassi, Zulfiqar Maher, Saima Tunio

 

KEYWORDS

Cache , Core- working set, Multi-core processor, Memory Architecture, , Memory Management, On- chip memory , Scratchpad Memory.

 

ABSTRACT

This research is aimed at the dynamic management of SPM on a single processing core. A dynamic SPM dynamic management strategy based on random sampling is proposed. The dynamic memory access characteristics displayed during the execution of the program and are used to manage SPM and make the SPM management free from depending on Profiling information and compilers. The difference between this method and the traditional SPM management strategy is that it utilizes the hardware support provided by DataUnit, and performs complete runtime management of SPM through software and hardware coordination, which can better reflect the dynamic changes of program access during program execution. . Furthermore, this paper extends the random sampling SPM allocation algorithm to a multi-tasking environment, simulates the multi-tasking environment by modifying the small real-time operating system RTOS, and designs a multi-task test program set based on RTOS as needed. The performance of SPM is performed using a random sampling algorithm in the single task environment.

 

REFERENCES

[1] Grosser T., Groesslinger A. and Lengauer C., (2013) “Polly performing polyhedral optimizations on a low-level intermediate representation”, Parallel Processing Letters, 22(04):1250010.
[2] Ji, W., Deng, N., Shi, F., Zuo, Q., & Li, J. (2011), Dynamic and adaptive spm management for a multitask environment. J. Syst. Archit. 57, 181–192.
[3] Kahle J.A., Day M.N., Hofstee H.P., Johns C.R., Maeurer T.R. and Shippy D., (2005), Introduction to the cell multiprocessor, IBM J. Res. Dev. 49, 589–604.
[4] Kannan A., Shrivastava A., Pabalkar A. and Lee J.E., (2019), “A software solution for dynamic stack management on scratch pad memory”, Proceedings of the 2009 Asia and South Paci_c Design Automation Conference, pp. 612-617. IEEE Press.
[5] Khader M., Ahsan K. and Tarek T., (2014), On-Chip Power Minimization Using Serialization-Widening with Frequent Value Encoding,‖ VLSI Design, vol. 2014, Article ID 801241, 14 pages.
[6] Khahro K. T., Talpur S., and Khahro S. F., (2019), "State of Art Innovative Technique for Management of Scratchpad Memory (Scratch), "Microprocessors and Microsystems” 70, pp.31-37..
[7] Kunzman D. M. and Kalé L. V., (2011), Programming Heterogeneous Clusters with Accelerators Using Object-Based Programming,‖ Scientific Programming, vol. 19, no. 1, pp. 47-62.
[8] Lee J., Kim H. and Vuduc R., (2012), “When prefetching works, when it doesn't, and why”, ACM Trans. Archit. Code Optim., 9(1), pp. 2:1-2:29.
[9] Lee J., Kim J., Jang C., Kim S., Egger B., Kim K., and Han S., (2018), Facsim: a fast and cycle-accurate architecture simulator for embedded systems,‖ in LCTES ’08: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems. New York, NY, USA: ACM, pp. 89–100.
[10] Lee J., Lee J., Seo S., Kim J., Kim S. and Sura Z., (2015), COMIC++: A software SVM system for heterogeneous multicore accelerator clusters. In: 2010 IEEE 20th International Symposium on High Performance Computer Architecture (HPCA 2020), pp. 1–12. IEEE, Los Alamitos.