Memory Management: Challenges and Techniques for traditional Memory Allocation Algorithms in Relation with Today's Real Time Needs
Abstract
Different memory allocation algorithms have been devised to organize memory efficiently in different timestamps according to the needs and scenario of usage yet there are issues and challenges of these allocators to provide full support for real time needs. Real time systems require memory on priority otherwise program may crash or may be unresponsive if demanded memory is not allocated with quick response. Besides the timing constraints, memory allocator algorithms must minimize the memory loss which comes in the form of fragmentation, the unusable memory in response to the memory allocation needs because memory is allocated in the form of blocks. Our focus would be to analyse traditional dynamic memory management algorithms with respect to their functionality, response time and efficiency to find out the issues and challenges with these allocators to sum up the knowledge to know the limitations of these algorithm which might reduce the performance of real time systems. This research paper will give a comparative analysis of some well known memory management techniques to highlight issues for real time systems and innovative techniques suitable for these applications will be argued.
Keywords
Full Text:
PDFReferences
Nilesh Vishwasrao and Prabhudev Irabashetti , “Dynamic Memory Allocation: Role in Memory Management” , International Journal of Current Engineering and Technology , Vol.4, No.2 (April 2014).
Divakar Yadav and Ashok Sharma, “Tertiary Buddy System for Efficient Dynamic Memory Allocation”, Conference: Proceeding SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems, At Cambridge
Masmano, I.Ripoll, A. Crespo, and J. Real,” TLSF: a new dynamic memory allocator for real-time systems”, Real-Time Systems, 2004. ECRTS 2004. Proceedings. 16th Euromicro Conference
Dipti Diwase, Shraddha Shah, Tushar Diwase and, Priya Rathod, “urvey Report on Memory Allocation Strategies for Real Time Operating System in Context with Embedded Devices”, International Journal of Engineering Research and Applications (IJERA) Vol. 2, Issue 3, May-Jun 2012, pp.1151-1156
B. Kitchenham and S. Charters, “Guidelines for performing systematic literature reviews in software engineering,” Version, vol. 2, 2007, pp. 2007–01
Puaut, "Real-Time Performance of Dynamic Memory Allocation Algorithms,"14th Euromicro Conference on Real-Time Systems (ECRTS'02), June 2002.
Mohamed A. Shalan, “Dynamic Memory Management for Embedded Real-Time Multiprocessor System On a Chip”, 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.
B. Cranston and R. Thomas, “A Simplified recombination Scheme for the Fibonacci Buddy System,” CACM, June 1975, 331-332.
Valtteri Heikkilä , “A Study on Dynamic Memory Allocation Mechanisms for Small Block Sizes in Real-Time Embedded Systems”, University of Oulu Department of Information Processing Science, conference 17 December 2012
Takeshi Ogasawara, “An Algorithm with Constant Execution Time for Dynamic Storage Allocation”, Advanced Compiler Group Tokyo Research Laboratory, IBM Japan, Ltd. 1623-14, Shimo Tsuruma, Yamato-Shi, Kanagawa 242, Japan
Seyeon Kim, “Node-oriented dynamic memory management for real-time systems on ccNUMA architecture systems”, University of York Department of Computer Science, conference paper April 2014