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

Exokernel architecture

Exokernel architecture Most of us know what kernels are and how do they work to make programmers’ lives easier. But, how many of us know what exokernels are? I hope you will be able to get a brief introduction on this terminology through this blog. Let’s start with a brief introduction on kernel. What is a kernel? A kernel is the foundational layer of an operating system that functions at a basic level, communicating with hardware and managing resources, such as CPU and the memory. It works as an interface between the user application and the hardware. There are two main types of kernel 1. Micro kernel 2. Monolithic Kernel 1. Monolithic architecture 2. Layerd archtecture . 3. Virtual machine architecture 4. Exokernel architecture 5. Client server architecture 6. Micro kernel architecture Now let’s head into our main focus. What is an Exokern...

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 ...

Thread

Thread What is Thread? A thread is a flow of execution through the process code, with its own program counter that keeps track of which instruction to execute next, system registers which hold its current working variables, and a stack which contains the execution history. A thread shares with its peer threads few information like code segment, data segment and open files. When one thread alters a code segment memory item, all other threads see that. A thread is also called a lightweight process . Threads provide a way to improve application performance through parallelism. Threads represent a software approach to improving performance of operating system by reducing the overhead thread is equivalent to a classical process. Each thread belongs to exactly one process and no thread can exist outside a process. Each thread represents a separate flow of control. Threads have been successfully used in implementing network servers and web server. They also provide a suitable foundation ...

Multi user Operating System

Multi user operating system · In a multi-user operating system, multiple number of user can access different resources of a computer at a same time. · The access is provided using a network that consists of various personal computer attached to a mainframe computer system. diagram of multi -user operating system · The various personal computer can send and receive information to mainframe computer system. · The example of multi-user OS are UNIX, windows 2000,novell netware. sing...

Priority scheduling

Priority scheduling In priority scheduling , a priority is associated with all processes. Process are executed in sequence according to their priority. The CPU time is allocated to the process with highest priority. If the priority of two or more processes are equal than the process that has been inserted first into the ready queue is selected for execution. In other words, FCFS scheduling is performed when wo or more processes have same priority. The priorities are implemented as affixed range of numbers such as 0to 7 or 0 to 4,095. In other system, a low number indicates a high priority . in that case,a process with priority 0 is executed first. Priorities can be defined in two ways : internal or externall. ...

Easytolearn

Search This Blog