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

Components of the r/e system, What components of the R/e system initiate th...

What components of the R/e system initiate the start of background jobs at the specified time? The batch scheduler initiates the begin of background job.  The dispatcher then s

Write a note on deadlocks, Write a note on deadlocks. The proper defini...

Write a note on deadlocks. The proper definition of deadlock A set of processes is deadlocked if every process in the set is waiting for an event that only a proces

What are the various page replacement algorithms, What are the various page...

What are the various page replacement algorithms used for page replacement? FIFO page replacement Optimal page replacement LRU page replacement LRU approximat

Time-Sharing Operating System, Advantages and disadvantages of time-sharing...

Advantages and disadvantages of time-sharing operating system

Calculate maximum average bandwidth, You have a system with two primary wor...

You have a system with two primary workloads. One performs sequential access to a set of large files, the other performs small, independent, random reads to a separate set of large

Is data in a file access sequentially or randomly, Q. Give an instance of ...

Q. Give an instance of an application in which data in a file should be accessed in the following order: a. Sequentially b. Randomly Answer: a. Print the content of

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Naming scheme for servers in an enterprise, Problem: Within a corporate...

Problem: Within a corporate environment, there are usually many servers located across various departments. Naming of servers is often a tedious task. In many circumstances, w

Producer-consumer using condition variables, Now let us present an implemen...

Now let us present an implementation of a producer-consumer system using condition variables. This implementation works. dequeue() lock(A) while (queue empty) { wait(A, C)

What are placement and replacement algorithms, Placement algorithms :calcu...

Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :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