Skip to main content

ENTERPROCESS COMMUNICATION AND SYNCHRONIZATION

     

ENTERPROCESS COMMUNICATION AND SYNCHRONIZATION

·         In multi programming environment multiple process co-exit . a single  program may be broken into number of processes.

·         The process are classified into two categories : independent processes and cooperating processes.

·         An independent process is a standalone process that does not share any data with any other process. It cannot affect or be affected by the other processes executing  in the system. In other words, the modification made to an independent process does not affect the functioning of other process.

·         A cooperating processes is a process that shares data with other processes in a system it can affect or be affectedly the other processes executing in the system

·         Cooperating processes can communicate in a shred memory environment .

·         The various reasons for using cooperating processes are:

1.       Information sharing : when several  users want to access to these type of reasourses

2.       Computational speed up: a task can be broken into various subtak so that each of them can run in parallel and this gives faster computation results.

3.       To support modularity: when a system is to be created in module fashion by dividing in into small functional units, co-operating processes are required. Cooperation processes establishes communication between the different modulus.

 

INTERPROCESSES COMMUNICATION

·         Inter-process communication (IPC) is a facility provided by an operating system via which cooperating processes can communicate with each other.

·         IPC facility allows the processes to cooperate and synchronize their action without sharing the sme addresses space

·         IPC is particularly useful in a distributed environment where the communication processes may reside on different computers connected with a network. An example is chat program used in the world wide web

·         There several different methods for establishing interprocess communication. Some of these methods are:

Ø Message Passing

Ø Shared Memory

Ø Signals

Ø Shared Files ,I.E. Pipes

Ø Dynamic Data Exchange (DDE)

Ø Object Linking And Embedding(OLE)

MESSAGE PASSING MODEL

·         A message is a collection of information that may be exchanged between a sending and receiving processes.

·         A message may contain data, execution commands, or even some code to be transmitted between two or more process.

·         A message format is flexible and negotiable by each sender- reciver pair.

·         A message Is characterized by its type , length ,sender and receiver IDS and a data field.

MESSAGE FORMAT

·         The format of a message depends upon two factors:

1.       The objective of the message facilty.

2.       Whether the facility runs on a single computer or on a distributed system

·         In some operating system short, fixed length messages are preferred in order to minimize processing and storage overhead.

·         In case , a large amount of data is to be sent , the data is placed in a file and the message then simply reference that file

       

·         The header has a fixed format within a given operating system and contains the information about the message.

·         The message body is optional and contains the actual content of the message.

·         The header may contain an identification of the message a length field , and a type field to discriminate among various types of messages.

·         There may also be additional control information such as pointer field so that a linked list of message can be created ,  a sequence number , to keep track of the number and order of messages passed between source and destination and a priority field.

·         Processes generally send and receive message by using send and receive primitives:

                          Send(receiver process, message)

                          Receive (sender process, message)

·         The send and receive calls are normally implemented as operating system calls.

·         The send call sends a message to a give receiver process. The receiver call receives a message from a given sender process.

·         The following four system calls are used for message transfer among processes:

Ø  msgget(): it returns (and possibly creates ) message descriptors to designate a message from queue for in other system calls.

Ø  msgetl(): it has options to set and return parameters associated with a message descriptor. It also has an option to remove descriptors.

Ø  msgsnd(): it senda a message using a message queue.

Ø  msgrev(): it receives using a message queue.


Implementing Issues In Messages

The various implementation issues that arise in interprocess communication using messages are:

1.       naming of the sender and receiver processes : naming conventions used in the send and receive calls provide answer to some key questions:.

·         How does the sender process know the name of the receiver?

·         How does the receiver process know the name of sebder ?

2.       Message delivery protocol : protocol are the set of rules that determines the message data format and actions of processes while sending and receiving messages

3.       Operating system responsibilities : buffering of message, bloicking and waking of processes etc.

 

 

Naming

·         Processes that want to communicate must have a way to refer tro each other processes can name each other directly or indirectly.

·         If the processes use indirect naming , it is know as indirect communication.

 

 

 

Comments

Popular posts from this blog

OS its Resource Manager and its Function

  Operating system as resource manager:   ·           A computer system usually has many hardware and software resources such as processor , memory, disk printer, I/O devices etc. ·           The task of resources management becomes essential in multi-user operating system where different user compute for the same resource.   Operating system manages resources in two ways : 1.         Time multiplexing : it defines the sharing of resources on the basis of fixed time slices. For example, the operating system allocate the resources, such as CPUto program A for fixed time slice. 2.         Space timing:  it defines the concurrent sharing of resources among different programs.for example, sharing of hard disk and main memory is space multiplexing.     FUNCTION OF OPERATING SYSTEM     The primar...

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

Suspend a process

  Suspend a process A process is an active program. It can also be said as a program that is under execution. It is more than the program code as it includes the program counter, process stack, registers, program code etc. Compared to this, the program code is only the text section. A process passes through different states as it executes. These states may be different in different operating systems. However, the common process states are explained below with the help of a diagram − New This is the state when the process has just been created. It is the initial state in the process life cycle. Ready In the ready state, the process is waiting to be assigned the processor by the short term scheduler, so it can run. This state is immediately after the new state for the process. Ready Suspended The processes in ready suspended state are in secondary memory. They were initially in the ready state in main memory but lack of memory forced them to be suspended and gets placed in the second...

Layered Operating System

  Layered Operating System Layered Structure is a type of system structure in which the different services of the  operating system  are split into various layers, where each layer has a specific well-defined task to perform . It was created to improve the pre-existing structures like the Monolithic structure ( UNIX ) and the Simple structure ( MS-DOS ). Example –  The Windows NT operating system uses this layered approach as a part of it . Design Analysis : The whole Operating System is separated into several layers ( from 0 to n ) as the diagram shows. Each of the layers must have its own specific function to perform. There are some rules in the implementation of the layers as follows. The outermost layer must be the User Interface layer. The innermost layer must be the Hardware layer. A particular layer can access all the layers present below it but it cannot access the layers present above it. That is layer n-1 can access all the layers from n-2 to 0 but it canno...

Scheduler

  Scheduler   Scheduling Objectives Here, are important objectives of Process scheduling Maximize the number of interactive users within acceptable response times. Achieve a balance between response and utilization. Avoid indefinite postponement and enforce priorities. It also should give reference to the processes holding the key resources  Process Scheduling handles the selection of a process for the processor on the basis of a scheduling algorithm and also the removal of a process from the processor. It is an important part of multiprogramming in operating system. Process scheduling involves short-term scheduling, medium-term scheduling and long-term scheduling. Details about these are given as follows − Long-Term Scheduling Long-term scheduling involves selecting the processes from the storage pool in the secondary memory and loading them into the ready queue in the main memory for execution. This is handled by the long-term scheduler or job scheduler. The long-term s...