Multithreaded architecture, Computer Engineering

Assignment Help:

Multithreaded Architecture: It is clear now that if we give many contexts to multiple threads, then processors with multiple contexts are known as multithreaded systems. These systems are executed in a manner same to multitasking systems. A multithreaded processor will suspend the current context and switch to another. In this way, the processor will be busy most of the time and latency problems will also be optimized. Multithreaded architecture depends on the context switching time between the threads.

The switching time should be very small as compared to latency time.

The processor utilization or its efficiency can be calculated as: U = P / (P + I + S)

Where

P = useful processing time for which processor is busy

I = Idle time when processor is waiting

S = Context switch time used for changing the active thread on the processor.

The purpose of any parallel system is to keep U as high as possible. U will be high if I and S are negligible or very low. The thought of multithreading systems is to decrease I such that S is not increasing. If context-switching time is more when measure to idle time, then the purpose of multithreaded systems is lost.


Related Discussions:- Multithreaded architecture

State about the indirect addressing, Indirect addressing A memory locat...

Indirect addressing A memory location is given that holds another memory location. This second memory location holds the real data. This mechanism solves problems caused by rea

By which transport protocol used, The transport protocol used by TFTP (Triv...

The transport protocol used by TFTP (Trivial File Transfer Protocol) is? The transport protocol used through Trivial File Transfer Protocol is UDP.

Explain traffic handling capacity, Traffic Handling Capacity is given by ...

Traffic Handling Capacity is given by (A)  Switching capacity × Theoretical maximum load (B)  Switching capacity / Theoretical maximum load (C)  Theoretical maximu

Explain wait for graph-resource request and allocation graph, Explain Wait ...

Explain Wait for graph (WFG) with Resource request and allocation graph (RRAG). WFG with RRAG: A graph G = (V,E) is termed as bipartite if V can be decomposed in two

Labels in the sub trees, A sorting method which uses the binary tree concep...

A sorting method which uses the binary tree concept such that label of any node is larger than all  the labels in the sub trees, is called A Sorting method which uses the binar

Internal conditioning, types of internal conditioning with explanations and...

types of internal conditioning with explanations and examples

Address - operand data types, Q. Address - operand data types? A...

Q. Address - operand data types? Addresses : Operands residing in memory are specified by their memory address while operands residing in registers are specified by a re

Explain e-brokerage, E-brokerage. An e-brokerage is an investment house...

E-brokerage. An e-brokerage is an investment house that permits you to buy and sell stocks and get investment information from its Web site.

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