Increasing CPU speed will maintain the current level of CPU utilization, in the case where the process mix is compute bound, or decrease CPU utilization, in the case where the process mix is I/O bound.
The CPU processes data, so data would be using the CPU.
Check your Task Manager, under the processes tab. You can sort it by Memory or CPU.
I/O-bound programs have the property of performing only a small amount of computation before performing IO. Such programs typically do not use up their entire CPU quantum. CPU-bound programs, on the other hand, use their entire quantum without performing any blocking IO operations. Consequently, one could make better use of the computer's resources by giving higher priority to I/O-bound programs and allow them to execute ahead of the CPU-bound programs.
The round-robin scheduling algorithm allocates CPU time to processes by sequentially assigning the CPU to processes of equal priority that are in the state of being able to use the CPU. (Not blocked) This works by appearing to evenly distribute the CPU amongst CPU ready processes. Processes that are waiting on something, such as an I/O event, particularly waiting on the user to press Enter, are not considered for allocation. Often, there is a priority assigned to the process, which factors in the allocation strategy. Processes that are mostly I/O intensive tend to have higher priority, giving them good response time. Processes that are mostly CPU intensive tend to have lower priority, so they don't interfere with overall system responsiveness.
The Central Processing Unit (CPU) chip carries out all of the processes for a computer...CPU chips can operate as fast as 3 billion processes a second....For example if you see advertised 2.8GHz CPU, that means the CPU can process 2.8 billion processes a second.
A program is CPU bound if it would go faster if the CPU were faster, i.e. it spends the majority of its time simply using the CPU (doing calculations). A program that computes new digits of π will typically be CPU-bound, it's just crunching numbers. A program is I/O bound if it would go faster if the I/O subsystem was faster. Which exact I/O system is meant can vary; I typically associate it with disk. A program that looks through a huge file for some data will often be I/O bound, since the bottleneck is then the reading of the data from disk.
Time of CPU usage per minute, Number of processes running at once
Random Access
Any CPU will have an I/O which en ply external devices data transfers. The CPU internally will process data. While both are data bus they are definitely not the same
system unit
Clock Speed