Multithreaded Process: Benefits & Models

Hello Friends, In this blog post I am going to explain to you the benefits of the multithreaded process and types of its model. Benefits: The benefits of multithreaded programming can be broken into the following categories – Resource sharing: By default, threads share the memory and the resources of the process to which they


Process: The Process States In Operating System.

Hello Friends, In this blog post I am going to let you know about the process and different types of process states which are used in the operating system. A process is a program in execution. It consists of an executable program, the program’s data and stack, it’s program counter, stack pointer, and other registers,


What is a thread in OS & how are these different from the traditional process?

Hello Friends, In this blog post I am going to discuss a thread in the operating system, and we will also compare this thread with a traditional process and will see how these differ from each other. We will understand this thread with a suitable example. In a traditional operating system, each process has an


Deadlock Avoidance In Operating System

Deadlock avoidance allows the three necessary conditions mutual exclusion , hold and wait , no preemption , but makes the judicious choice to assure that deadlock point is never reached. it means that avoidance allows more concurrency than prevention. The basic idea for deadlock avoidance is to grant only those requests for available resources that


Methods For Deadlock Prevention

Deadlock prevention is an approach used by designers in dealing with the problem of deadlock. The basic philosophy of deadlock prevention is to delay at least one of the four necessary conditions for deadlocks. 1. Mutual exclusion: The mutual condition must hold for nonsharable resources, such as a printer that can not be simultaneously shared


Methods For Deadlock Handling

There are three methods for deadlock handling: Ensuring that deadlock state will never occur – To make sure this condition there are two techniques used which is explained below: Deadlock prevention: In this scheme, deadlock is prevented by ensuring that at least one condition occurs out of four conditions (mutual exclusion, hold and wait, no


Dijkstra: Bankers Algorithm For Deadlock Avoidance

If a necessary conditions for a deadlock to occur are in free place, it is still possible to avoid deadlock by being careful when resources are allocated, perhaps the most famous deadlock avoidance algorithm is Dijkstra’s bankers algorithm, called by this interesting name because it involves a banker who makes loans and receives payment from


What is segmentation in the operating system?

Hello Friends, In this blog post, I am going to discuss the segmentation process. Segmentation is a memory management scheme that divides the address space of a single process into blocks that may be placed into noncontiguous areas of memory to reduce the average size of a request. In segmentation, Segments are formed at program


What is Starvation? How does it differ and similar to deadlock?

Hello friends, In this blog post I am going to let you about the problem of starvation which is also known as indefinite postponement, indefinite blocking or starvation. In any system that keeps processes waiting while it makes resources allocation and process scheduling decisions, it is possible to delay indefinitely the scheduling of a process


Fragmentation & Its types in the operating system

Hello Friends, In this blog post I am going to explain to you the problem of fragmentation and its classification in the operating system. Fragmentation problem is related to an unused memory block which is generally left in a case when a process block is either of higher memory or lower memory with respect to


Similarities And Differences between Paging and Segmentation.

Hello Friends, In this blog post I am going to explain to you an interesting and importing topic which is to find out the similarities and differences between paging and segmentation. As we know these both are the schemes for managing the memory with reference to the operating system. Now we will see how these


File Organization

Hello Friends, In this blog post I am going to explain to you about file organization. file organization refers to the manner in which the records of a file are arranged on secondary storage. The most popular file organization schemes are as follows. Types of file organization: Sequential: Records are placed in physical order. The


Types Of File Operations

Hello friends, In this blog post I am going to explain to you about file operations, as you all know that files are used to store the data information and this information can be retrieved with allowed permission when needed. Each operating system has a system calls to make basic operations on files like the


What is the use of Cache Memory 2019?

Hello Friends, in this blog post I am going to explain to you the cache memory, which is related to programming. We will cover the use and working procedure of cache memory. It is very simple to understand the concept of cache memory, you can easily learn this with the help few real-life examples related


Overlay advantages and disadvantages in programs?

Many years ago people were first confronted with programs that were too big to fit in the available memory. The solution to this problem is usually adopted was to split the program into pieces, and they are also called as overlays. Overlay() would start running first. When it was done, it would call another overlay,


What Is Disk Scheduling In Hindi? disk scheduling क्या होती है?

हेलो दोस्तों आज के इस ब्लॉग में मै आपको disk scheduling के बारे में बताने वाला हूँ | हो सकता है आपने इसे ऑपरेटिंग सिस्टम विषय के अन्तर्गत पढ़ा हो| multiprogrammed computing सिस्टम में जहाँ पर कई सारे प्रोग्राम एक साथ execute होते है, और यहाँ पर कई सारी processes ऐसी हो सकती है जो


Deadlock in the distributed operating system in Hindi? डैडलॉक क्या होता है?

हेलो दोस्तों, आज के इस ब्लॉग में मै आपको डिस्ट्रिब्यूटेड ऑपरेटिंग सिस्टम में होने वाले Deadlock के बारे में बताने जा रहा हूँ | डिस्ट्रिब्यूटेड सिस्टम में deadlock कुछ उसी प्रकार होता है, जैसा कि सिंगल प्रोसेसर सिस्टम में होता है | बस इसमें सबसे बड़ी दिक्कत जो होती है, वो ये होती है कि,