Networking sockets with the use of shared memory, Operating System

Assignment Help:

Q. Compare the utilization of networking sockets with the use of shared memory as a mechanism for communicating data between processes on a single computer. What are the merits of each method? When might each one be preferred?

Answer: Utilizing network sockets rather than shared memory for local communication has a number of advantages. The major advantage is that the socket programming interface features a rich set of synchronization features. A process can effortlessly determine when new data has arrived on a socket connection how much data is present and who sent it. Processes are able to block until new data arrives on a socket or they can request that a signal be delivered when data arrives. A socket as well manages separate connections. A process with a socket open for receive is able to accept multiple connections to that socket and will be told when new processes try to connect or when old processes drop their connections.

Shared memory provided none of these features. There is no means for a process to determine whether another process has delivered or else changed data in shared memory other than by going to look at the contents of that memory. It is unfeasible for a process to block and request a wakeup when shared memory is delivered as well as there is no standard mechanism for other processes to establish a shared memory link to an existing process.

Nevertheless shared memory has the advantage that it is extremely much faster than socket communications in many cases. When data is transmit over a socket it is typically copied from memory to memory multiple times. Shared memory updates necessitate no data copies- if one process updates a data structure in shared memory that update is instantaneously visible to all other processes sharing that memory. Sending or else receiving data over a socket requires that a kernel system service call be made to initiate the transfer but shared memory communication can be performed completely in user mode with no transfer of control required.

Socket communication is usually preferred when connection management is significant or when there is a requirement to synchronize the sender and receiver. For instance server processes will typically establish a listening socket to which clients can connect when they want to use that service. Once the socket is conventional individual requests are as well sent using the socket as a result that the server can easily determine when a new request arrives and who it arrived from. In some cases nevertheless shared memory is preferred. Shared memory is frequently a better solution when either large amounts of data are to be transferred or when two processes require random access to a large common data set. In this case nevertheless the communicating processes may still require an extra mechanism in addition to shared memory to achieve synchronization among them. The X Window System a graphical display environment for UNIX is a good illustration of this most graphic requests are sent over sockets however shared memory is offered as an additional transport in special cases where large bitmaps are to be displayed on the screen. In this situation a request to display the bitmap will still be sent over the socket however the bulk data of the bitmap itself will be sent via shared memory.


Related Discussions:- Networking sockets with the use of shared memory

File system versus swap space, Q. What are the tradeoffs concerned in rerea...

Q. What are the tradeoffs concerned in rereading code pages from the file system versus using swap space to store them? Answer: If codes pages are accumulate in swap space th

priority-based scheduling algorithm , Your task is to replace the round ro...

Your task is to replace the round robin CPU scheduling scheme you developed in Practical 6 with a priority-based scheduling algorithm. To simplify matters, you can maintain the ori

What are the various page replacement algorithms, What are the various page...

What are the various page replacement algorithms used for page replacement? FIFO page replacement Optimal page replacement LRU page replacement LRU approximat

What is the translation lookaside buffer, What is the Translation Lookaside...

What is the Translation Lookaside Buffer (TLB) In a cached system, the base addresses of the last few referenced pages is maintained in registers known as the TLB that aids in

Define secondary memory, Define secondary memory. This memory holds tho...

Define secondary memory. This memory holds those pages that are not there in main memory. The secondary memory is usually a high speed disk. It is called as the swap device, an

What are overlays, What are overlays? To enable a process to be larger ...

What are overlays? To enable a process to be larger than the amount of memory allocated to it, overlays are used. The idea of overlays is to keep in memory only those instructi

What is meant by file management systems?, What is meant by file management...

What is meant by file management systems? File Management systems are as well referred to as simply a file system .File system is the system that an OS operating system or prog

Determine scheduling policy for time-shared operating system, Determine a s...

Determine a scheduling policy that is most suitable for a time-shared operating system   Round-Robin is a scheduling policy that is most suitable for a time-shared operating s

Android operating system, Android operating system is an open source, Linux...

Android operating system is an open source, Linux-based Smartphone OS. It is the world's most popular mobile platform with more than 700,000 applications and 25 billion downlo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd