I/O-bound:
The execution of
Compute-bound:
The program takes time to complete a task and this time is determined by the speed of CPU. Most programs for the computations are within the CPU/memory system. The determined time for the task is called compute bound.
The process time that requires for the execution of the program is divided into intervals called time slice. CPU switches between the processes in which the execution of each process is restricted to only one time slice.
Want to see the full answer?
Check out a sample textbook solutionChapter 3 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
- How does pipelining improve CPU efficiency? What’s the potential effect on pipelining’s efficiency when executing a conditional BRANCH instruction? What techniques can be used to make pipelining more efficient when executing conditional BRANCH instructions?arrow_forwardProcessor R is a 64-bit RISC processor with a 2 GHz clock rate. The average instruction requires one cycle to complete, assuming zero wait state memory accesses. Processor C is a CISC processor with a 1.8 GHz clock rate. The average simple instruction requires one cycle to complete, assuming zero wait state memory accesses. The average complex instruction requires two cycles to complete, assuming zero wait state memory accesses. Processor R can’t directly implement the complex processing instructions of Processor C. Executing an equivalent set of simple instructions requires an average of three cycles to complete, assuming zero wait state memory accesses. Program S contains nothing but simple instructions. Program C executes 70% simple instructions and 30% complex instructions. Which processor will execute program S more quickly? Which processor will execute program C more quickly? At what percentage of complex instructions will the performance of the two processors be equal?arrow_forwardHow can we stop a central processing unit from squandering cycles by processing a huge number of instructions all at once? How much does the availability of certain resources affect the viability of carrying out this strategy? Provide an instance of one of the results they generate.arrow_forward
- If two processes are running, postponing execution until one finishes. Generally, phase 1 is more crucial than the other. Main memory can only hold one action. How does the CPU calculate? Both selections describe CPU phases.arrow_forwardIt is possible to build a system in which shared structures are stored in the local memory of each process and accessible via interprocess communication. This kind of system has been shown to be practical. What are some of the problems with the overall design?arrow_forwardAssuming that there are two processes in secondary memory; waiting to execute. Considering the process 1 has high priority and the other one has the lowest priority. Only one process can fit in the main memory at one time. Explain how CPU performs execution on it? You can choose among all the components of CPU to explain the process?arrow_forward
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage LearningPrinciples of Information Systems (MindTap Course...Computer ScienceISBN:9781305971776Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningFundamentals of Information SystemsComputer ScienceISBN:9781337097536Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning