Explain about hyper-threading, Computer Engineering

Assignment Help:

Q. Explain about Hyper-threading?

Non threaded program instructions are executed in a single order at a time until the program completion. Presume a program have four tasks namely A, B, C, D. Assume that every task comprises 10 instructions involving a few I/O instructions. A simple sequential execution would need A→ B→ C→ D sequence.

In a threaded system these tasks of a single program/process can be performed in parallel offered is no data dependency. Because there is just one processor these tasks will be executed in threaded system like interleaved threads e.g. 2 instructions of A, 3 instructions of B, 1 instruction of C, 4 instruction of D, 2 instruction of C until completion of threads.

Hyper-threading allows 2 threads A & B to execute at the same instance. How? Some of the more significant parts of CPU are duplicated. So there exist 2 executing threads in CPU at the exact same instance. Please note that both these sections of the CPU works on same memory space (because threads are same program). Ultimately dual CPUs will enable computer to execute two threads in two different programs at the same instance.

So Hyper-threading technology enables a single microprocessor to behave as two separate threaded processors to operating system and application program which use it.


Related Discussions:- Explain about hyper-threading

Data structure, Sort the following list using selection sort technique, dis...

Sort the following list using selection sort technique, displaying each step. 20,12,25,6,10,15,13

Create a scatterplot for each set of variables, For each of the following v...

For each of the following variables: YEARofBIRTH transformed into a new variable called . To do this you will need to use the Command. Hint codes 9998 and 9999 are missin

Design a nand-to-and gate network, Q Use as few gates as possible, design a...

Q Use as few gates as possible, design a NAND-to-AND gate network that realize the following Boolean algebra expression. ABCD + A'BC'D + A'BC'D' + A'BCD + (A'B'C'D' + A'BCD')

Explain the criteria to classify data structures, Explain the criteria to c...

Explain the criteria to classify data structures used for language processors? The data structures utilized in language processing can be classified upon the basis of the subse

Breif on loosely coupled systems, Loosely Coupled Systems These s...

Loosely Coupled Systems These systems don't share global memory since shared memory concept increases the problem of memory conflicts, which consecutively slows down the

Explain bitwise-exclusive-or operator, Bitwise-Exclusive-OR Operator: ^ ...

Bitwise-Exclusive-OR Operator: ^ exclusive-OR-expression : AND-expression exclusive-OR-expression ^ AND-expression The  bitwise-exclusive-OR  operator  (^)  compares

What is the length of function code at user-command, What is the length of ...

What is the length of function code at user-command? Every menu function, push button, or function key has an associated function code of length FOUR (for example, FREE), which

Two layer artificial neural networks, Two Layer Artificial Neural Networks:...

Two Layer Artificial Neural Networks: However decision trees are whenever powerful they are as a simple representation scheme. Whereas graphical on the surface that they can b

Variable-partition multiprogramming, Choose the descriptions below with the...

Choose the descriptions below with the most appropriate memory management scheme (A through D).  Solutions may be used once, more than once, or not at all. A.     Fixed-partitio

What is the last entry in all bdc tables, What is the last entry in all BDC...

What is the last entry in all BDC tables? In all BDC tables the last entry is to save the data by using the field name BDC_OKCODE and a field value of '/11'.

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