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

Tlb replacement algorithm, Suppose a logical address space is 1KB, and the ...

Suppose a logical address space is 1KB, and the page-size is 16 bytes. Assume no page is in the main memory for this process initially and the pure demand paging is used. Current f

Cpu scheduling alogarithm program in javascript, a program that can do cpu ...

a program that can do cpu scheduling algorithm priority using javascript or php to display gaant chart and calculate waiting and average waiting time

What is file allocation?, What is File Allocation? The structure that ...

What is File Allocation? The structure that offers the FAT file system its name is the file allocation table . In order to know what this important table does, you should fir

Define the term system software, Question: (a) Define the term system ...

Question: (a) Define the term system software and application software, giving an example for each. (b) Draw a diagram to represent the abstract view of a computer system i

What is a process control block?, What is a Process Control Block? Ever...

What is a Process Control Block? Every process in the operating system is represented by a process control block as well called a task control block. It contains several pieces

Explain a boot control block, Explain a boot control block A boot contr...

Explain a boot control block A boot control block can have the information required by the system to boot an operating from that partition. If the disk does not have an operati

Choice of operating systems to boot from, Q. How could a system be designed...

Q. How could a system be designed to allow a choice of operating systems to boot from? What would the bootstrap program need to do? Answer: Delieve a system that would like to

How free-space is managed using bit vector implementation, How free-space i...

How free-space is managed using bit vector implementation? The free-space list is implemented as a bit map or bit vector. Each block is shown by 1 bit. If the block is free, th

Garbage collection, The dynamic memory allocator is a layer between the app...

The dynamic memory allocator is a layer between the application and the OS, managing heap objects. When a program requests memory from the allocator (via malloc(), for instance), t

Why global variables are unacceptable, Why Global variables are unacceptabl...

Why Global variables are unacceptable Global variable, for instance, are unacceptable because they break the rules of self - containment. If all procedural components are runni

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