Explain processing predefined application protocols, Operating System

Assignment Help:

Explain Processing Predefined Application Protocols

Implementing and swift processing of predefined application protocols is sure to improve performance of server - side applications. As we learned earlier, they are geared for high performance by a twofold mechanism. First, because they are inflexible, a minimal amount of time is spent massaging parameters into communications buffers. Second, they may be efficiently processed by the server application if properly architected.

In fact, even a flexible application- level protocol can be made much more efficient at the server with good coding techniques. Fundamentally, a server component is either aware of its execution as a separate server component or unaware; as is the case with RPCs. Optimizing the execution based on the efficient processing of application-level protocols requires the server components to become very aware. The modification is simple, however. Server processing of application-level protocols can be optimized by passing actual protocol buffers to the server procedure for processing. This removes the overhead of unpacking the protocols, and possibly the wasted memory space of copying the inter- application protocol data into formalized parameters.


Related Discussions:- Explain processing predefined application protocols

What are the various process scheduling concepts, What are the various proc...

What are the various process scheduling concepts? a) Scheduling queues with diagram b) Queuing diagram c) Schedulers d) Context switch with diagram

Which are the different states of a process, Which are the different states...

Which are the different states of a process?   Different status of a process is: New: When the process is created. Running: When instructions are executed. Wait

What is the translation look aside buffer (tlb), Translation Look aside Buf...

Translation Look aside Buffer In a cached system, the base addresses of the last few indexed pages is maintained in registers named the TLB that adds in faster lookup. TLB has

Hashed page table, Hashed page tables A common approach for handling ad...

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

Explain optimal page replacement, Optimal page replacement An optimal ...

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that a 'replace the page that will not be

Why do systems stay track of the type of a file, Q. Why do some systems sta...

Q. Why do some systems stay track of the type of a file while others leave it to the user or simply don't implement multiple file types? Which system is "better?" Answer: A f

Bio, how it is work.

how it is work.

Prevention of a data race in a parallelised program, Present your own fully...

Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

Explain the fork-join, Explain the Fork-join This is primitives in a hi...

Explain the Fork-join This is primitives in a higher level programming language for implementing interacting processes. The syntax is like this: fork ; join ; where

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