What are the various available scheme in ipc, Operating System

Several schemes available are as follows:

Pipes: One-way communication process through which different process can interact. The problem is that the two processes could have a unique ancestor. However this problem was fixed with the help of named-pipes (FIFO).

Message Queues : Message queues may be used between unrelated and related processes executing on a machine.

Shared Memory: This is the fastest of all IPC process. The memory to be shared is examined into the address space of the processes. The speed gain is attributed to the fact that there is no kernel use. But this scheme requires synchronization.


441_IPC available schema.png

Posted Date: 7/30/2012 12:57:52 AM | Location : United States

Related Discussions:- What are the various available scheme in ipc, Assignment Help, Ask Question on What are the various available scheme in ipc, Get Answer, Expert's Help, What are the various available scheme in ipc Discussions

Write discussion on What are the various available scheme in ipc
Your posts are moderated
Related Questions
RESOURCE ALLOCATION GRAPH When a process Pi wishes an instance of resource type Rj, a request edge is inserted in the resource allocation graph. When this request is able to be

What is the main function of the memory-management unit? The runtime mapping from virtual to physical addresses is done by a hardware device known as a memory management unit (

Give an overview of WINDOWS 2000 file management. Windows makes use of the NTFS and File Allocation Table file systems. The Older versions of the FAT file system had file name

Q. How Program execute in operating system? Program execution: Operating system loads a program in memory and executes the program. The program should be able to end its exec

Allocators can also be used to avoid problems with unsafe languages. C and C++ are pervasive, with huge amounts of existing code. They are also memory-unsafe languages, in that the

Question: A set of processes are in a deadlock state when every process in the set is waiting for an event that can be caused by only another process in the set. (a) There

When do we write a page from physical memory back to the disk? In general, caches have two broad types of writing policies. One approach is a write-through cache. In this case,

What is virtual memory? Virtual memory is a method that allows the execution of processes that might not be completely in memory. It is the separation of user logical memory fr

Q. Explain the actions taken by a kernel to context switch between kernel level threads. Answer: Context switching among kernel threads classically requires saving the value