Message Delivery Protocol

Message Delivery Protocol

· A protocol is a set of rules and conventions shared by communicating entities .

· Message passing can be blocking or non blocking .

· In blocking protocol, a sender process is blocked till the message selivered to the . in this case , sender process has guarantee that the message sent by it ie delivered before it continues its execution .

A blocking protocol normally includes:

1. Blocking send : the sender process is blocked until the message is received by the receiving process or by the mailbox.

2. Blocking receive : the receiver nlocks until a message is available thus when both sender as well as receiver is blocked ,it is known as rebdevezevous . this combination allows for tight sysnchronization between process.

· In non blockeing protocol, asender continues the execution after performing a send operation irrespective of whether the message is delivered or not

· A non blocking protocol has the advantage that a sender is free to continue its execution immediately after sending a message

· However , sender has no means of knoiwing when(and wheather )its message is delivered to the receiver.

· A non blocking send : the sending process sends the message and resumes operation.

· Non blocking receive: the receiver retrieves either a valid message or a null.

Buffering

Wheather the communication is direct or indirect , message exchanged by communicating processes reside in a temporary queue.

There are three different ways of implementing such queue.

Zero capacity

· Zero capacity queue cannot keep and message waiting in it , thus it has maximum length 0

· For this , sending process must be blocked until the receiving process receives the message .

· System with zero capacity queue is known as message system with no buffering.

Bounded capacity

· Bounded capacity queue has finite length n. thus it can have n message.

waiting in it .

· If the queue is not full , new message can be placed in the queue and the sending process is not blocked , it not blocked , it can continue execution without waiting.

· If the link or queue is full , then the sender must be blocked until space is available in the queue.

· This system is also known as automatic buffering .

Unbounded capacity

· Unbounded capacity queue has infinite length . thus any number of messages can wait in it .

In such a system , sending process is never blocked , can continue execution without waiting

Shared memory model

· Normally , process use memory areas within the scope of virtual memory space . also memory management systems ensure that every process has a well-defined and separate data and separate data and code area.

· In shared memory model parts of private address space of two or more rae processes are mapped to same physical memory.

· Such a memory areas are called shared memory regions.

Comments

Multi Level Queue Scheduling (MLQ)

Multi Level Queue Scheduling (MLQ) · Multilevel queue scheduling classifies the processes according to their types for example, a multilevel queue scheduling algorithm makes a common. · In this scheduling ready queue is divided into various queue that are called sub queues. A subqueue is a distinct operational queue · The process are permanently assigned to subqueues, generally based on some property of the process such as memory size,priority or process type · Each subqueue has its process sucheduling algorithm. For example interactive process at the foreground may use round robin scheduling while batch jobs at the background may use the FCFS method · For example, consider a system with four different queues 1. ...

Shortest Job First Scheduling (SJF)

Shortest Job First Scheduling (SJF) · SJF ia also known as shortest-job-next(SJN) algorithm and is faster than FCFS. · In SJF, the process with the least estimated execution time is selected from the ready queue for execution. · For this, SJF algorithm associates with each process, the length of its next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. · If tow processes have the same length of next CPU burst ,FCFS scheduling algorithm is used to break the tie. · SJF algorithm can be preemptive or non-preemptive. Non-preeptive SJF · In non-preemptive SJF, scheduling, CPU is always assigned to the ...

Monolithic Architecture

Monolithic Architecture Monolith means composed all in one piece. The Monolithic application describes a single-tiered software application in which different components combined into a single program from a single platform. Components can be: Authorization — responsible for authorizing a user Presentation — responsible for handling HTTP requests and responding with either HTML or JSON/XML (for web services APIs). Business logic — the application’s business logic. Database layer — data access objects responsible for accessing the database. Application integration — integration with other services (e.g. via messaging or REST API). Or integration with any other Data sources. Notification module — responsible for sending email notifications whenever needed. Example for Monolithic Approach Consider an example of Ecommerce application, that authorizes customer, takes an order, check products inventory, authorize payment and ships ordered products. This applicat...

Micro kernel architecture

Micro kernel architecture What is Kernel? A kernel is an important part of an OS that manages system resources. It also acts as a bridge between the software and hardware of the computer. It is one of the first program which is loaded on start-up after the bootloader. The Kernel is also responsible for offering secure access to the machine's hardware for various programs. It also decides when and how long a certain application uses specific hardware. What is Microkernel? Microkernel is a software or code which contains the required minimum amount of functions, data, and features to implement an operating system. It provides a minimal number of mechanisms, which is good enough to run the most basic functions of an operating system. It allows other parts of the operating system to be implemented as it does not impose a lot of policies. Microkernels and their user environments are usually implemented in the C++ or C programming languages with a little bit of assembly. Ho...

Easytolearn

Search This Blog