Explain the communications of request or response interface, Operating System

Assignment Help:

Explain the Communications of Request or Response Interface

The inter-application communication must provide four specific interface to the CSInterface() components. A client must be able to send and receive from the server and the server must be able to receive from the client and return results. The communications interface must provide these generic services to the application layer while remaining transport independent at the bottom layer. Communications interface components may be required to perform more advanced functions than simple send and receive. First, it is their responsibility to mask the underlying protocols from the developer.

Second the communications interface must manage the modes of operation for CSInterface(). Our previous example of CSInterface() used CallServer() to communicate with the server computer. The client uses the CallServer() procedure to send request to the server in either synchronous or asynchronous mode:

  • In synchronous mode, client request will be returned upon receipt of results from the server.
  • In asynchronous mode, the CallServer() function will need to send the request to the server and immediately return.

 

Third, with the inclusion of callback procedures, the communications interface component must initiate the callback to the application- level code. Callbacks are most easily managed by including a pointer to the procedure in the REQHEADER for each CSInterface() call as documented in the previous section.

When the server returns the result of executed procedure, the communications interface can scan the REQHEADER for configured callbacks. If they exist, the communications interface should dispatch CSInterfaceSetupCallback() for setup and execution of the callback.


Related Discussions:- Explain the communications of request or response interface

Comparing gc to malloc, Garbage collectors trade space for time. If we coll...

Garbage collectors trade space for time. If we collect all the time (which requires a lot of processing time), the GC allocator will use the least memory possible. On the other han

Process destruction, Most process abstractions support processes being dest...

Most process abstractions support processes being destroyed when the program terminates, or in response to a specific kill directive. There are two common implementations, one a "p

Explainoptimal page replacement in detail, Optimal page replacement An...

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that put back the page that will not be us

DOS, Ask question #Minimum 500 words accepted#

Ask question #Minimum 500 words accepted#

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Parent process: why not finishing and how to make finish, #include #inclu...

#include #include #include #include #include int main(void) { int pchan[2], pid, rval, cvar; char buf[20]; if (pipe(pchan) == -1){

Necessary conditions for deadlock, Here are the conditions necessary for a ...

Here are the conditions necessary for a deadlock to occur; note that all of them are necessary, and none is suf?cient: 1. ?nite resources: the resources are held in a mutually-e

What is meant by demand paging? explain, What is meant by demand paging? Ex...

What is meant by demand paging? Explain. Demand paging is a technique to implement virtual memory. In demand paging simply when a page is required it is brought into memory. As

Explain hashed page table method, Hashed page table method A general ap...

Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.

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