Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
The objects that a program can access directly are those objects which are referenced by local vari-ables on the processor stack, or by any global/static variables that refer to ob
Hashed page tables A common approach for handling address spaces larger than 32 bits is to use a hashed page table. Every entry in the hash table having a linked list of elemen
Buffering Messages exchanged by communication processes reside in a impermanent queue. Such a queue can be executed in three ways. Zero capacity: The queue length is 0.
Q. How would utilize of a RAM disk affect your selection of a disk-scheduling algorithm? What factors would you require to consider? Do the similar considerations apply to hard-di
what is Number System
Question: a) There are main goals of data security. List them and elaborate on how they provide protection. b) Describe threats associated with data security. c) Describe
What are the various page replacement algorithms used for page replacement? FIFO page replacement Optimal page replacement LRU page replacement LRU approximat
Explain the Resource Ownership and Control Operating systems are required to handle many different types of resources. CPU , memory, and I/O devices are some of the varied sys
Inverted page table In page table the page table has one entry for every page that the process is using. The operating system must translate this reference into a physical memo
Explain DosCreateThread Functions Used in the OS/2 DosCreateThread(&threadID,MyThreadFunction,arg,flags,stackSize) DosCreateThread creates a thread within the context of th
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd