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 impotant keys
How branching takes place in Instruction pipeline. Explain with suitable examples
Explain bit pair recoding with an example? Ans: Bit pair recoding halves the maximum number of summands. Group the Booth-recoded multiplier bits in pairs and see the following
TRP is the number of clock cycles required to terminate access to an open row of memory, and open access to the next row. It stand for row precharge time.
Control Unit (CU) : Every PEs are under the control of one control unit. CU controls the inter communication among the PEs. There is a local memory of CU also known as CY memory.
Object Orientation and Analysis An Object is anything that exists within the problem domain that can be recognized by data and/or behaviour. An example of an object is a bike.
Explain with the help of examples FIFO algorithms? FIFO policy: This policy easy removes pages in the order they arrived into the main memory. By using this policy we easily
System Software System software is a group of programs written to service another programs. Some system software (e.g., compilers editors and file management utilities) proc
Canonical genetic algorithm - Mating: In such a scenario this continues until the number of offspring that is produced is the required number. Further this required number is
What are the registers generally contained in the processor? MAR-memory address register MDR-memory data register IR-Instruction Register RO-Rn-General purpose registe
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