Explain the architecting for threads, Operating System

Assignment Help:

Explain the Architecting For Threads

When available, threads are an integral part of any multitasking server application program. It is important that the operating system provide an efficient mechanism for thread creation, execution, and manipulation. Ii is this increased efficiency and decreased overhead that makes the threads an invaluable resource. Threads may be widely used to make the server application more concurrent. Thread may be widely used to make the server application more concurrent. Introducing more executing agents working on behalf of the client application component increases the performance. For the developer, there is an even finer level of control over the application. In a multithreads system, each application program may have more than one thread executing.

Multithreading adds power to the developer by allowing the programmer to dispatch multiple (> 1) units of execution. The application can execute more quickly and efficiently because each thread is working concurrently with the others. In may example of multitasking, I showed how the operating system increased efficiency by running multiple applications at the same time. Application developers can add that power to their server applications by starting multiple threads. With each thread executing portions of code concurrently, application throughput is increased. Architecting code to fully utilize threads will maximize the efficiency by using the available CPU cycles. Server application developers should take this into consideration for optimizing their code on a given platform.

A common mechanism for architecting server applications using threads is the Worker Model discussed in the next section. It should be noted that resource requirements in the Worker Model may be relatively high. For example, stack allocation of 8 K FOR 250 threads alone would equal 2MB. Other designs, modeled after one thread per client, are acceptable as well. It is possible to define pools of available threads to execute application requests as they are received.


Related Discussions:- Explain the architecting for threads

Explain the general structure of a typical process, Explain the general str...

Explain the general structure of a typical process? There are basically four main sections through which each of the process has to pass through.The universal algorithm is:-

Describe the purpose of the open and close operations, Q. Describe the pur...

Q. Describe the purpose of the open() and close() operations. Answer: The open() operation notifies the system that the named file is about to become active. The c

What inference does recovery in distributed systems, Q. Consider a distrib...

Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.

Explain about directory structure, Normal 0 false false fal...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Explain contiguous allocation, Contiguous allocation The contiguous-all...

Contiguous allocation The contiguous-allocation method needs each file to occupy a set of contiguous blocks of the disk. Disk addresses explain a linear ordering on the disk. T

Galvin, difference between process and thread

difference between process and thread

Page faults, Assume there are only 4 page frames in the physical memory, fo...

Assume there are only 4 page frames in the physical memory, for the following reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2, 8. a) What i

Processes, draw a state diagram showing the transissions of a process from ...

draw a state diagram showing the transissions of a process from creation to termination

Define buffering, Define buffering. A buffer is a memory area that keep...

Define buffering. A buffer is a memory area that keeps data whereas they are transferred among two devices or among a device and an application. Buffering is done for three rea

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

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