Memory Management in Operating System
Uploaded by
Editor IJTSRDMemory Management in Operating System
Uploaded by
Editor IJTSRDInternational Journal of Trend in Scientific
Research and Development (IJTSRD)
International Open Access Journal
ISSN No: 2456 - 6470 | www.ijtsrd.com | Volume - 2 | Issue – 5
Memory Management in
n Operating System
Durgesh Raghuvanshi
B. Tech, Department off Computer Science
Science, IILM Academy off Higher Learning,
Greater Noida, Uttar Pradesh, India
ABSTRACT
In the recent era of computing, applications an As we know that the goals of ana operating system are
operating system cannot survive without efficient convenient and efficiently so we should take care of
memory management, especially if an application has these two goals of an operating system.
to be under Surve load for an undefined long time.
Resources must be utilized efficiently to enhance 1. Memory Management Schemes:
performance. This paper describes about the memory Memory management Schemes are broadly
management in an operating system and it will divided into following categories:
demonstrate basic architecture of segmentation in an 1.1. Contiguous Memory Allocation:
operating system and basic of its allocation. This Contiguous allocation means that each logical object
paper also describess about the basic concept of virtual is placed in a set of memory locations with strictly
memory management and dynamic memory consecutive addresses. Bare machines, resident
management. monitor, multiprogramming are in further division of
contiguous allocation while multiprogramming is
KEYWORD: Memory, Allocation, Segmentation, categorized
tegorized into two parts i.e. Fixed partition and
Support in segmentation. variable partition.
INTRODUCTION 1.2. Non-contiguous
ontiguous Memory Allocation:
An operating system (OS) is system software that Non-contiguous
contiguous allocation implies that a single
manages computer hardware and software resources logical object may be placed in non-consecutive
non sets
and provides common services for computer of memory location. Paging and segmentation are the
th
programs. All computer programs, excluding two mechanisms that are used to manage non- non
firmware, require an operating system to function. contiguous memory allocation. A better method to
overcome the fragmentation problem was evolved
The main purpose of a computer system to execute which makes our logical address spaces non- non
programs. These programs with their accusing data contiguous in nature.
must locate
te in the main memory at the time for
execution. The principles of managing the main 2. Segmentation:
memory which is one of the most precious resources Segmentation is another technique for the non-
in a multiprogramming system of an operating contiguous storage allocation. It is different from
system. paging as pages are physical in nature and hence are
of fixed size, whereas segments are logical divisions
Memory consists of a large array of words or bytes of a program and hence are of variable size.
each with its own
wn address. Modern operating systems
provide efficient memory management and still It is a memory management scheme that supports
s the
research is being conducted to improve the way the user view of memory rather than a system view of
allocated for applications because the main problem memory rather than system view memory as in
faces the memory allocation algorithm. paging, in which we are concerned with the division
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug
Aug 2018 Page: 2346
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
of physical memory into fixed size blocks called 4.2.7. First bit/best fit
frames. In segmentation, we divide the logical address 4.2.8. External fragmentation
space into different segments. The size of a segment 4.3. Validation bit=0-illegal segment
varies according to the data stored in it or the nature 4.4. Read, write / execute privileges.
of operation performed on that segment.
5. Virtual Memory:
3. Paging: It is a virtual resource of a computer. It is an illusion
Paging is a memory management scheme that that a system possesses more memory that is actually
removes the requirement of contiguous allocation of having this illusion makes a process independent of
physical memory. This scheme permits the physical the size of real memory. It also permits a large
address space of a process to be non-contiguous. number of processes to share a computer system
Because of this advantage over the previous methods without constraining each other.
discussed for memory management, paging was used
in most of the operating system. The details of virtual memory management are
generally transparent to programs. The ability to
execute a partially loaded process is also
advantageous from the operating system point of
view, it also used to reduce the external fragmentation
without the need to change the scheduled order of
process executions.
6. Hardware Implementation:
In a system using segmentation, computer memory
addresses consist of a segment id and an offset to the
segment. A hardware memory management is
responsible for translating the segment and offset into
3.1. Demand paging: a physical memory address, and for performing
In demand paging a page is brought into the memory checks to make sure the translation can be done and
for its execution only when it is demanded otherwise that the reference to that segment and offset is
it is remained in backing storage disk. The name permitted.
seems to have been derived from demand feeding.
CONCLUSION
Hence, with this we have understood about the
indispensable concept of an operating system and its
memory management and its segmentation in memory
and also a short outlook of memory management.
In this paper different memory allocation techniques
have been discussed along with their comparative
analysis.
REFERENCES
4. Segmentation Architecture 1. Muhammad Abdullah Awais; MS150200157,
4.1. The logical address consists of a two Virtual University of Pakistan.
tuple<segment-number, offset> 2. Martin Bohmert; Department of computer science
4.2. Relocation University of Freiburg, Germany
4.2.1. Dynamic 3. Christoph Scholl; Department of computer
4.2.2. By segment table science; University of Freiburg, Germany
4.2.3. Sharing 4. https://whatis.techtarget.com/definition/segmented
4.2.4. Shared segments .memory
4.2.5. Same segment number 5. https://wikipedia.org/wiki/memory management,
4.2.6. Allocation segmentation
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 2247
You might also like
- No ratings yet"Advancements in Machine Learning for Early Detection of Plant Diseases by Gayatri Rahangdale | Supesh Falke | Gauri Bharti | Shweta Dewalkar | Prof. Anupam Chaube | Prof. Rina Shirpurkar Link To Download Paper: https://www.ijtsrd.com/other-scientific-research-area/other/69417/advancements-in-machine-learning-for-early-detection-of-plant-diseases/gayatri-rahangdale #callforpaperinternationaljournal #ugclistofjournals #bestinternationaljournal Plant detection is a critical task in agricultural automation and environmental monitoring. It involves identifying and classifying plant species, diseases, or other relevant plant characteristics using various techniques, such as image processing, machine learning, and remote sensing. Advances in computer vision and artificial intelligence have enabled the development of robust plant detection systems capable of analyzing vast amounts of data in real time. These systems can be employed for applications such as precision agriculture, where acc9 pages
