Analysis of Allocation Algorithms in Memory Management ijtsrd
Memory management is the process of controlling and coordinating computer memory, assigning portions called blocks to various running programs to optimize overall system performance and also known as memory allocation. Placement algorithms are implemented to determine the slot that can be allocated process amongst the available ones in the partitioned memory. Memory slots allocated to processes might be too big when using the existing placement algorithms hence losing a lot of space due to internal fragmentation. In dynamic partitioning, external fragmentation occurs when there is a sufficient amount of space in the memory to satisfy the memory request of a process but the process’s memory request cannot be satisfied as the memory available is in a non contiguous manner. This paper describes how to resolve external fragmentation using three allocation algorithms. These algorithms are First fit, Best fit and Worst fit. We will present the implementation of three algorithms and compare their performance on generated virtual trace.
by Lae Wah Htun | Moh Moh Myint Kay | Aye Aye Cho “Analysis of Allocation Algorithms in Memory Management”
Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019,
Analysis of Allocation Algorithms in Memory Management ijtsrd IEEE PAPER
Performance of Best Route Selection using RIP and OSPF Routing Protocols ijtsrd
Android Based Questionnaires Application for Heart Disease Prediction System ijtsrd