Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Hyper-threading works by duplicating those parts of processor which store architectural state but not duplicating main execution resources. This permits a Hyper-threading equipped processor to pretend to be two 'logical' processors to host operating system, allowing operating system to schedule 2 processed or threads concurrently. Where execution resources in a non-Hyper-threading capable processor aren't used by current task and particularly when processor is stalled a Hyper-threading equipped processor can use those execution resources to execute other scheduled task.
Besides its performance implications, this innovation is transparent to Programs and operating systems. All that is needed to take advantage of Hyper-Threading is symmetric multiprocessing (SMP) support in operating system as logical processors emerge as standard separate processors.
Though it's likely to optimize operating system behaviour on Hyper-threading capable systems like Linux techniques explained in Kernel Traffic. E.g. consider an SMP system with two physical processors which are both Hyper-Threaded (for a total of four logical processors). If operating system's process scheduler is unaware of Hyper-threading it will treat all four processors similarly.
Consequently if just two processes are entitled to run it may decide to schedule those processes on two logical processors which happen to belong to one of the physical processors. So one CPU will be very busy while other CPU will be entirely idle, leading to poor overall performance. This can be avoided by improving scheduler to treat logical processors in a different way from physical processors; in a sense it's a limited form of scheduler changes which are needed for NUMA systems.
Why pointer variable sometimes desirable to pass a pointer to a function as an argument? Frequently, a called function needs to make changes to objects declared in the calling
The data structure required to convert a recursion to an iterative procedure is Stack is the data structure required to convert a recursion to an iterative procedure
Q. Illustrate Internal Organisation of RAM? The construction displayed in Figure below is made up of one JK flip-flop and 3 AND gates. The two inputs to system are one input bi
Write the factors considered in designing an I/O subsystem? 1. Data Location: Device selection, address of data within device ( track, sector etc) 2. Data transfer: Amount
Amdahl's law is suitable for applications where response time is critical. On the other hand, there are a lot of applications which need that accuracy of the resultant output shoul
Define the term- Analysis The analysis involves some or all of the following stages: Fact finding - this is usually done in four ways. Understanding the current syst
Smart Card & E-Cash E-cash storable smart cards can kept and dispense cash electronically, making bills and coins lesser essential. It transfers funds over phone lines, making
How is the command Suppress-Dialog useful? Suppressing whole screens is possible using this command. This command permits us to perform screen processing "in the background".
Q. What do you mean by Video Memory ? As declared before video memory is also entitled framebuffer since it buffers video frames to be displayed. The quality of a video display
Describe the necessary conditions for Deadlock. Required conditions for deadlock 1. Mutual exclusion 2. Hold and wait 3. No preemption 4. Circular wait Mutual e
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd