Skip to main content

Proposed Memory Allocation Algorithm for NUMA-Based Soft Real-Time Operating System

  • Conference paper
  • First Online:
Emerging Technologies in Data Mining and Information Security

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 814))

Abstract

Memory management algorithms for operating system have been explored broadly, but inadequate devotion has been concentrated on the real-time characteristic. Furthermost advanced algorithms are general-purpose and do not fulfill the requirements of real-time systems. Additionally, a few allocators combining with real-time systems do not focus well on multiprocessor architecture. The emergent needs for high-performance computational processing can be satisfied by NUMA architecture-based systems having multicore system. In this paper, memory allocation algorithm has been proposed for soft real-time operating system for NUMA-based architecture which will be useful to achieve constant execution time and less fragmentation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Diwase, D., Shah, S., Diwase, T., Rathod, P.: Survey report on memory allocation strategies for real time operating system in context with embedded devices. Int. J. Eng. Res. Appl. 2(3), 1151–1156 (2012)

    Google Scholar 

  2. Shah, V., Shah, A.: An analysis and review on memory management algorithms for real time operating system. Int. J. Comput. Sci. Inf. Security (IJCSIS) 14(5) (2016)

    Google Scholar 

  3. Budzinski, R.L., Davidson, E.S., A comparison of dynamic and static virtual memory allocation algorithms. IEEE Trans. Software Eng. SE-7(1) (1981)

    Google Scholar 

  4. Hanson, D.R.: Fast allocation and deallocation of memory based on object life times. Software-Practice and Experience 20(1), 5–12 (1990)

    Article  MathSciNet  Google Scholar 

  5. Liu, J.W.S.: Real-time System, (published by Person Education, Page no. 20–40)

    Google Scholar 

  6. Ogasawara, T.: An algorithm with constant execution time for dynamic memory allocation. In: Proceedings of Second International Workshop on Real-Time Computing Systems and Applications, 25–27 Oct 1995, Pg No. 21–25

    Google Scholar 

  7. Puaut, Real-time performance of dynamic memory allocation algorithms. In: Proceedings of the 14th Euromicro Conference on Real-Time Systems (ECRTS’02), June 2002

    Google Scholar 

  8. Sun, X.H., Wang, J.L., Chan, X.: An improvement of TLSF algorithm

    Google Scholar 

  9. Kim, S.: Node-oriented dynamic memory management for real-time systems on ccNUMA architecture systems. Published in 2013

    Google Scholar 

  10. Shalan, M.A.: Dynamic memory management for embedded real-time multiprocessor system on a chip. In: A Thesis in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy from School of Electrical and Computer Engineering, Georgia Institute of Technology, November 2003

    Google Scholar 

  11. Kim, R.M.J., Lee, W., Chung, Y.: Smart dynamic memory allocator for embedded systems. In: Proceedings of 23rd International Symposium on Computer and Information Sciences, ISCIS ‘08, 27–29 Oct. 2008

    Google Scholar 

  12. Wilson, P.R., Johnstone, M.S., Neely, M., Boles, D.: Dynamic memory allocation: a survey and critical review. In: Proceedings of the Memory Management International Workshop IWMM95, Sep 1995

    Google Scholar 

  13. Masmano, M., Ripoll, I., Crespo, A.: TLSF: a new dynamic memory allocator for real-time systems. In: Proceedings of 16th Euromicro Conference on Real-Time Systems, Catania, Italy, 79–88 July 2004

    Google Scholar 

  14. Lea, D.: A memory allocator. http://g.oswego.edu/dl/html/malloc.html. Unix/Mail December, 1996

  15. Shah, V., Shah, A.: Critical analysis for memory management algorithm for NUMA based real time operating system. Published in IEEE Xplorer in December 2017

    Google Scholar 

  16. Ogasawara, T. (1995) An algorithm with constant execution time for dynamic storage allocation. In: RTCSA’95: Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications, 21–25, Washington, DC, USA. IEEE Computer Society

    Google Scholar 

  17. Sanjay Ghemawat, P.M.: Tcmalloc: thread-caching malloc. Published in 2010

    Google Scholar 

  18. Werstein, P., Situ, H., Huang, Z.: Load balancing in a cluster computer. In: Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT’06), 2006

    Google Scholar 

  19. Shah, V., Patel, K.: Load Balancing algorithm by Process Migration in Distributed Operating System. Int. J. Comput. Sci. Inf. Technol. Security (IJCSITS), ISSN: 2249-9555, 2(6) (December 2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Apurva Shah .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shah, V., Shah, A. (2019). Proposed Memory Allocation Algorithm for NUMA-Based Soft Real-Time Operating System. In: Abraham, A., Dutta, P., Mandal, J., Bhattacharya, A., Dutta, S. (eds) Emerging Technologies in Data Mining and Information Security. Advances in Intelligent Systems and Computing, vol 814. Springer, Singapore. https://doi.org/10.1007/978-981-13-1501-5_1

Download citation

Publish with us

Policies and ethics