Originally posted by: Jeff7181
Originally posted by: carlosd
Originally posted by: Acanthus
Originally posted by: Aenslead
Surfing the net is not cpu intensive, nor is the windows enviroment overall. Should you want to rip/encode/burn while surfing the web, listening to some music, downloading stuff and chating, you will not notice any problems whatsoever.
BUT, if you where encoding, while playing a VERY CPU intensive game, while doing a virus scan, and burning at the same time, and making a backup of all your mails, and ziping a 1Gb file... well, you might just get a little hicup in your responsiveness.
Youre joking right, an A64 would run like garbage doing that... not a "hiccup".
It only takes 2 cpu intensive apps to cause problems, for me encoding video and gaming.
Encoding and gamming on P4 also run like crap, at leats if you are gaming pacman or something like this. Don't you know hot Hyper Threading work? Do some reading. For example running a game like HL2 alone will take all the P4 resources, also the same will happen while encoding alone. If you do the two works at the same time, HT won't allow the game or encoding to use more than 50% of CPU, running HL2 like crap (I have done this) and encoding at half speed. Rememver after all there is only one Physical CPU.
I think you need to do some reading too...
This is a good article...
particularly this page.
Quote from Xbitlabs:
"So, both logical processors work on the same physical core. We have already mentioned above that all core resources will be split into large categories: ?shared? and ?distributed?. The so-called distributed resources include Fetch Queue, Uop Queue and Scheduler Queue. For each logical processor the queue depth is smaller because a part of its capacity is assigned to another logical processor. In other words, these resources are split in two halves: one for each logical processor. Or, for example, there is a position in the queue, which can be occupied only by the first logical processor, and another position can be used only by the second one. In case of shared resources their actual distribution between the logical processors will be arranges individually for each particular case. However,
note that there is a special system preventing one logical processor from using up the entire resource capacity. You understand why this system is necessary: if we have one fast and one slow (or stalled) commands thread, then the latter can theoretically occupy all queues thus blocking the execution of the first thread.
Therefore, there should be a certain algorithm which would allow distributing the queue capacity between the two processors in the most efficient way. How can two threads share the positions in the UopQ (or any other queue) with the fixed number of positions? There are two different ways:
competitive way (when each of the threads tries to take as much of the resources from the opponent as possible) and fixed way (50:50, for instance). In the first case it is quite possible that one of the threads will slow down or oust the second thread from the queue completely. In the second case, the resources will not be used efficiently, if one of the micro-operations threads requires more than 50% of them: one of the threads will lack resources, while the other one will simply waste them.
In the Pentium 4 processor the queue capacity for each thread is fixed: each of the logical processors has twice as short Fetch Queue, Uop Queue and Schedulers Queue at its disposal than in the example above with the disabled (absent) Hyper Threading technology.
This certainly has some negative influence on the performance of each logical processor, but makes it impossible for any of the threads to block the processor. So, here the resources are distributed absolutely equitably. Important notice: the micro-operations are moving along the queue independently for each logical processor."
Just A depeer explanation of what I am saying.