期刊名称：International Journal of Advances in Engineering and Management
电子版ISSN：2395-5252
出版年度：2020
卷号：2
期号：10
页码：86-91
语种：English
出版社：IJAEM JOURNAL
摘要：Memory management is that the process of controlling and coordinating memory, assigning portions called blocks to varied running programs to optimize overall system performance and also referred to as memory allocation. Placement algorithms are implemented to work out the slot which will be allocated process amongst the available ones within the partitioned memory. Memory slots allocated to processes could be too big when using the prevailing placement algorithms hence losing tons of space thanks to internal fragmentation. In dynamic partitioning, external fragmentation occurs when there's a sufficient amount of space within the memory to satisfy the memory request of a process but the process’s memory request can't be satisfied because the memory available is during a non-contiguous manner. This paper describes the way to resolve external fragmentation using three allocation algorithms. These algorithms are First-fit, Best-fit and Worst-fit. we'll present the implementation of three algorithms and compare their performance on generated virtual trace.
关键词：Contiguous Memory Management;First-fit;Best-fit;Worst fit;External Fragmentation;Internal fragmentation;Fixed partitioning;Buddy system
