Explain message passing among systems, Operating System

Q. Explain Message passing among systems?

Communications- Message passing among systems requires messages to be turned into packets of information and sent to the network controller also transmitted across a communications medium and reassembled by the destination system. Packet ordering as well as data correction must take place. Again user programs mightn't coordinate access to the network device or they might receive packets destined for other processes.

Posted Date: 7/27/2013 2:26:48 AM | Location : United States

Related Discussions:- Explain message passing among systems, Assignment Help, Ask Question on Explain message passing among systems, Get Answer, Expert's Help, Explain message passing among systems Discussions

Write discussion on Explain message passing among systems
Your posts are moderated
Related Questions
Develop a user mode command interpreter which support these functions: "list-short" -- just like ls without any options "list-long" -- same as ls -l "change" -- same as cd Your co

Q. Consider a system in which a program is able to be separated into two parts: code and data. The CPU recognizes whether it wants an instruction (instruction fetch) or data (data

Question 1: a) State the different file attributes and briefly explain the operations that can be performed on each files. b) What is a semaphore? Describe why it is impor

What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. 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

Q. Why might a system utilize interrupt-driven I/O to manage a single serial port however polling I/O to manage a front-end processor such as a terminal concentrator? A

Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s

Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are

QUICK FIT ALGORITHAMS Here we keep apart lists for holes and processes. Therefore this reduces the searching time for holes Hole list and Process list. If we organize the li

what is independent process? distinguished between independent process and co-operating process