Operating System Tutorial

Operating System Tutorial Types of Operating System Evolution of Operating System Functions of Operating System Operating System Properties Operating System Services Components of Operating System Needs of the Operating System

Operating Systems

Linux Operating System Unix Operating System Ubuntu Operating System Chrome Operating Systems Fedora Operating System MAC Operating System MS Windows Operating System Solaris Operating System Cooperative Operating System CorelDRAW Operating System CentOS FreeBSD Operating Systems Batch Operating System MS-DOS Operating System Commercial Mobile Operating Systems


Difference Between Multi-programming and Multitasking Difference between C-LOOK and C-SCAN Difference between Rotational Latency and Disk Assess Time Trap vs Interrupt Difference between C-SCAN and SSTF Difference between SCAN and FCFS Difference between Seek Time and Disk Access Time Difference between SSTF and LOOK Difference between Process and Program in the Operating System Difference between Protection and Security in Operating System

How To

How to implement Monitors using Semaphores How to Install a Different Operating System on a PC


What is Kernel and Types of Kernel What is DOS Operating System What is Thread and Types of Thread What is Process Scheduler and Process Queue What is Context Switching What is CPU Scheduling What is Producer-Consumer Problem What is Semaphore in Operating System Monitors in Operating System What is Deadlock What is Paging and Segmentation What is Demand Paging What is Virtual Memory What is a Long term Scheduler What is Page Replacement in Operating System What is BSR Mode What is Convoy Effect What is Job Sequencing in Operating System Why is it critical for the Scheduler to distinguish between I/O-bound and CPU-bound programs Why is there a Need for an Operating System


Process Management Process State Scheduling Algorithm FCFS (First-come-First-Serve) Scheduling SJF (Shortest Job First) Scheduling Round-Robin CPU Scheduling Priority Based Scheduling HRRN (Highest Response Ratio Next) Scheduling Process Synchronization Lock Variable Mechanism TSL Mechanism Turn Variable Mechanism Interested Variable Mechanism Deadlock Avoidance Strategies for Handling Deadlock Deadlock Prevention Deadlock Detection and Recovery Resource Allocation Graph Banker’s Algorithm in Operating System Fixed Partitioning and Dynamic Partitioning Partitioning Algorithms Disk Scheduling Algorithms FCFS and SSTF Disk Scheduling Algorithm SCAN and C-SCAN Disk Scheduling Algorithm Look and C-Look Disk Scheduling Algorithm File in Operating System File Access Methods in Operating System File Allocation Method Directory Structure in Operating System N-Step-SCAN Disk Scheduling Feedback Queue in Operating System Contiguous Memory Allocation in Operating System Real-time Operating System Starvation in Operating System Thrashing in Operating System 5 Goals of Operating System Advantages of Operating System Advantages of UNIX Operating System Bit Vector in Operating System Booting Process in Operating System Can a Computer Run Without the Operating System Dining Philosophers Problem in Operating System Free Space Management in Operating System Inter Process Communication in Operating System Swapping in Operating System Memory Management in Operating System Multiprogramming Operating System Multitasking Operating Systems Multi-user Operating Systems Non-Contiguous Memory Allocation in Operating System Page Table in Operating System Process Scheduling in Operating System Segmentation in Operating System Simple Structure in Operating System Single-User Operating System Two Phase Locking Protocol Advantages and Disadvantages of Operating System Arithmetic operations in binary number system Assemblers in the operating system Bakery Algorithm in Operating System Benefits of Ubuntu Operating System CPU Scheduling Criteria in Operating System Critical Section in Operating System Device Management in Operating System Linux Scheduler in Operating System Long Term Scheduler in Operating System Mutex in Operating System Operating System Failure Peterson's Solution in Operating System Privileged and Non-Privileged Instructions in Operating System Swapping in Operating System Types of Operating System Zombie and Orphan Process in Operating System 62-bit operating system Advantages and Disadvantages of Batch Operating System Boot Block and Bad Block in Operating System Contiguous and Non - Contiguous Memory Allocation in Operating System Control and Distribution Systems in Operations Management Control Program in Operating System Convergent Technologies in Operating System Convoy Effect in Operating System Copy Operating Systems to SSD Core Components of Operating System Core of UNIX Operating System Correct Value to return to the Operating System Corrupted Operating System Cos is Smart Card Operating System Cosmos Operating Systems Examples Generation of Operating System Hardware Solution in Operating System Process Control Block in Operating System Function of Kernel in Operating System Operating System Layers History of Debian Operating Systems Branches and Architecture of Debian Operating Systems Features and Packages of Debian Operating Systems Installation of Operating System on a New PC Organizational Structure and Development in Debian Operating Systems User Interface in Operating System Types Of Memory in OS Operating System in Nokia Multilevel Paging in OS Memory Mapping Techniques in OS Memory Layout of a Process in Operating System Hardware Protection in Operating System Functions of File Management in Operating System Core of Linux Operating System Cache Replacement Policy in Operating System Cache Line and Cache Size in Operating System

What is Message-passing Technique in OS


In operating systems, message passing is a communication method where processes share data via messages. By enabling programs to send and receive data independently, it makes inter-process communication easier. Different kinds of data, including commands, signals, and data payloads, can be contained in messages. This method improves distributed systems' modularity and scalability and makes it possible for separate processes to work together without interruption. In an operating system environment, message passing—which can be synchronous or asynchronous—is essential for developing stable, concurrent applications.

The following are the main points of message passing:

  1. Within message-passing systems, messages are sent and received over a communication channel between processes. How, therefore, should the agreement be made?
  2. Some topology systems define the pattern of the connection given by the channel.
  3. A network is the grouping of the channels.
  4. According to their definition, distributed systems are made up of a geographically dispersed group of computers. Thus, a direct connection between a computer and another node is not conceivable.
  5. Therefore, in the Message-Passing Model, every channel is private.
  6. What information must be sent via the network is determined by the sender. A phone call is one instance.
  7. Only once the destination worker chooses to receive the data is the data truly conveyed. For instance, when someone answers your phone and begins to respond.
  8. Time is not a barrier. It is in the hands of the person who answers your call after how many rings. He can keep you waiting forever by not returning your call.
  9. Both parties must actively participate in network communication for it to be successful.
What is Message-passing Technique in OS

The algorithm

  1. Let us examine a network made up of n bidirectional point-to-point channels called p0, p1, p2,... pn-1.
  2. Node and may be Node unaware of who's at the other end. Thus, the topology would be set up in this manner.
  3. Only the processes know from where the message needs to be sent once communication has been established and message transmission starts.


The following are the features of the message-forwarding model:

  • Message forwarding is mostly used for communication.
  • It is utilized in distributed contexts when communication activities are located on distant computers connected by a network.
  • Since the message-passing feature offers a means of communication and action synchronization between the communicating processes, no code is needed in this instance.
  • Because message passing is implemented via kernel (system calls), it takes a long time to complete.
  • It is helpful for sharing modest amounts of data to avoid disagreements.
  • Comparing message passing to shared memory technique, communication is slower.

The benefits of the Message Passing Model

  1. Very understanding of extended communication lags.
  2. Easier to construct devices with tremendous parallelism.
  3. It can tolerate longer communication latencies better.
  4. Message-passing libraries offer superior performance and speed.

Disadvantages of the Message Passing Model

  1. A programmer must perform all tasks.
  2. It is slower since it takes longer to establish a connection.
  3. Cooperative operations are typically needed for data transfer, which can be challenging to do.
  4. Programmers find it challenging to create portable applications using this paradigm because most message-passing implementations consist of an embedded source code library of subroutines. Once more, the programmer is obliged to handle everything in\dependently.


By providing a useful and flexible means for processes to interact with one another, operating systems use message passing to increase system concurrency and flexibility. Owing to its asynchronous structure, robust and distributed computing environments with enhanced scalability and responsiveness may be created.