Explain the proper distribution of functionality and code, Operating System

Assignment Help:

Explain the Proper Distribution of Functionality and Code

It is important to note that the bandwidth of the server operating system and server processor availability is fixed. The amount of processing capability remains consistent across any number of workstation platforms. Sharing this server bandwidth between multiple fronts - ends (clients) will eventually degrade performance. There is a saturation point (number of stations * load) at which perceptible performance at the workstation will decrease due to the overloading of the server computer. The objective of client/server application designer is to distribute functionality and code so as to avoid this saturation point for all normal case scenarios.

The difficulty lies in determining the saturation point. For instance, some server operating systems are more scalable. By adding more horse-power or addition processors to these systems, the saturation point will change. Careful analysis on the target environments might be needed for fine- tuning finished client - server applications. In addition , some emerging technologies and application have the capability of dynamically the execution location of client - server components. These technologies, by being properly architected, greatly increase the scalability and load balancing of the overall system. A goal of the application developer should be to achieve and ideally balanced machine state, although application distribution will vary from application to application and from developer to developer. The developer should keep in mind that the proper architecture and a careful mix of application functions between server and client will eventually determine the viability of the client - server technology.


Related Discussions:- Explain the proper distribution of functionality and code

How are file sharing and protection implemented?, How are file sharing and ...

How are file sharing and protection implemented? To implement file protection and sharing, the system ought to maintain more file and directory attributes than are needed on a

Define drawback of distributed systems, Define drawback of Distributed syst...

Define drawback of Distributed systems Reliability is a drawback of Distributed systems

Three conditions that solution for critical section problem, What are three...

What are three conditions that a solution for the critical section problem must satisfy? The three conditions are as following:- a)      Mutual exclusion :- if a process is

What are the advantages of using unequal- size partitions, In fixed portion...

In fixed portioning scheme, what are the advantages of using unequal- size partitions? With unequal-size partitions there are two probable ways to assign process to partitions.

What is co-operative process, What is co-operative process? A process i...

What is co-operative process? A process is co-operating if it can influence or be affected by the other processes implementing in the system. Any process that share data with o

Explain lru page replacement, LRU page replacement In slightest recentl...

LRU page replacement In slightest recently used page replacement algorithm we will replace that page that hasn't been used for the longest period of time. This is similar as an

List five services provided by an operating system, List five services prov...

List five services provided by an operating system. Explain how each provides convenience to the users. Explain also in which cases it would be impossible for user-level programs t

Replacement algorithm for tlb, Consider the following C program where M, N,...

Consider the following C program where M, N, K are predefined constants. Assume int is 4 bytes. Suppose this program is run on a machine with 4KB page size and 32 TLB entries. Init

Linux kernel components, Example 1.  The diagram illustrating the data stru...

Example 1.  The diagram illustrating the data structures of in-memory VFS objects and on-disk objects and their relationships on slide 24 of the lecture notes OSD.4. This diagram i

Which algorithm makes the most efficient use of memory, Question : (a) ...

Question : (a) The dynamic allocation problem is how to satisfy a request of size n from a list of free holes into memory. The best-fit, first-fit and worst-fit strategies are

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