Home > Computer Science > Operating System > Volume-3 > Issue-5 > Analysis of Allocation Algorithms in Memory Management

Analysis of Allocation Algorithms in Memory Management

Call for Papers

Volume-5 | Issue-6

Last date : 26-Oct-2021

Best International Journal
Open Access | Peer Reviewed | Best International Journal | Indexing & IF | 24*7 Support | Dedicated Qualified Team | Rapid Publication Process | International Editor, Reviewer Board | Attractive User Interface with Easy Navigation

Journal Type : Open Access

Processing Charges : 700/- INR Only OR 25 USD (for foreign users)

First Update : Within 7 Days after submittion

Submit Paper Online

For Author

Research Area



Analysis of Allocation Algorithms in Memory Management


Lae Wah Htun | Moh Moh Myint Kay | Aye Aye Cho



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, pp.1985-1987, URL: https://www.ijtsrd.com/papers/ijtsrd26731.pdf

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.

Best-fit, First-fit, Worst-fit, Performance, Memory Management


IJTSRD26731
Volume-3 | Issue-5, August 2019
1985-1987
IJTSRD | www.ijtsrd.com | E-ISSN 2456-6470
Copyright © 2019 by author(s) and International Journal of Trend in Scientific Research and Development Journal. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/by/4.0)

International Journal of Trend in Scientific Research and Development - IJTSRD having online ISSN 2456-6470. IJTSRD is a leading Open Access, Peer-Reviewed International Journal which provides rapid publication of your research articles and aims to promote the theory and practice along with knowledge sharing between researchers, developers, engineers, students, and practitioners working in and around the world in many areas like Sciences, Technology, Innovation, Engineering, Agriculture, Management and many more and it is recommended by all Universities, review articles and short communications in all subjects. IJTSRD running an International Journal who are proving quality publication of peer reviewed and refereed international journals from diverse fields that emphasizes new research, development and their applications. IJTSRD provides an online access to exchange your research work, technical notes & surveying results among professionals throughout the world in e-journals. IJTSRD is a fastest growing and dynamic professional organization. The aim of this organization is to provide access not only to world class research resources, but through its professionals aim to bring in a significant transformation in the real of open access journals and online publishing.

Thomson Reuters
Google Scholer
Academia.edu

ResearchBib
Scribd.com
archive

PdfSR
issuu
Slideshare

WorldJournalAlerts
Twitter
Linkedin