What problem is faced by multicore processors running older software written for single-brain chips? O Multicore processors draw more power than single-brain processors to solve the same problem. O Multicore processors still have some fair distance to go before going mainstream. O Multicore processors need emulators to be able to compile programs that were written for single-core processors. O Individual cores in multicore processors have smaller memories than single-brain chips and are consequently slower. O Multicore processors usually run older software by using only one core at a time.
Added by David F.
Close
Step 1
Step 1: The question asks about the problem faced by multicore processors when running older software written for single-core chips. Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 65 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
6. Until which CPU is the P4 backward compatible? A: 80386 B: 8088 C: 80486 D: 80286 23. What is the most unpleasant matter with variable-length instructions? A: It's hard to determine how many bytes we have to fetch into the pipeline. B: It's hard to determine how fast different instructions execute. C: It's hard to determine how much space the program allocates in memory. D: It's hard to determine how many instructions we have to fetch into the pipeline. 24. What is expanding opcodes? A: Instructions are with the same length, but the opcode part and operand part lengths can vary. B: Adding new instructions with which we can carry out more operations. C: Instructions can work with more types of data after the expansion. D: Instructions are with different lengths, so we can expand them unlimitedly. 25. What is register addressing? A: The register contains a memory address. B: The register contains an index with which we can calculate a memory address. C: The register contains the data we need. D: The mode of how we select a register. 26. Which one is a monadic instruction? A: OR B: XOR C: NOT D: AND 11. What advantages do we have to merging the original Main 1-line with the microprogram? A: We need less microprogram store. B: Some microprograms will run in shorter time. C: All microprograms will run faster. D: Some microprogram operands will not be needed.
Akash M.
1.7 [15] <§1.6> Compilers can have a profound impact on the performance of an application. Assume that for a program, compiler A results in a dynamic instruction count of 1.0E9 and has an execution time of 1.1 s, while compiler B results in a dynamic instruction count of 1.2E9 and an execution time of 1.5 s. a. Find the average CPI for each program given that the processor has a clock cycle time of 1 ns. b. Assume the compiled programs run on two different processors. If the execution times on the two processors are the same, how much faster is the clock of the processor running compiler A's code versus the clock of the processor running compiler B's code? c. A new compiler is developed that uses only 6.0E8 instructions and has an average CPI of 1.1. What is the speedup of using this new compiler versus using compiler A or B on the original processor? 1.9 Assume for arithmetic, load/store, and branch instructions, a processor has CPIs of 1, 12, and 5, respectively. Also assume that on a single processor a program requires the execution of 2.56E9 arithmetic instructions, 1.28E9 load/store instructions, and 256 million branch instructions. Assume that each processor has a 2 GHz clock frequency. Assume that, as the program is parallelized to run over multiple cores, the number of arithmetic and load/store instructions per processor is divided by 0.7 × p (where p is the number of processors) but the number of branch instructions per processor remains the same. 1.9.1 [5] <§1.7> Find the total execution time for this program on 1, 2, 4, and 8 processors, and show the relative speedup of the 2, 4, and 8 processors result relative to the single processor result. 1.9.2 [10] <§§1.6, 1.8> If the CPI of the arithmetic instructions was doubled, what would the impact be on the execution time of the program on 1, 2, 4, or 8 processors? 1.9.3 [10] <§§1.6, 1.8> To what should the CPI of load/store instructions be reduced in order for a single processor to match the performance of four processors using the original CPI values?
Adi S.
Another pitfall cited in Section 1.10 is expecting to improve the overall performance of a computer by improving only one aspect of the computer. This might be true, but not always. Consider a computer running programs with CPU times shown in the following table: | | FP Instr. | INT Instr. | L/S Instr. | Branch Instr. | Total Time | |---|---|---|---|---|---| | a. | 70 s | 85 s | 55s | 40s | 250s | | b. | 40 s | 90s | 60s | 20s | 210s | 1) How much is the total time reduced if the time for FP operations is reduced by 20%. 2) How much is the time for INT operations reduced if the total time is reduced by 20%. 3) Can the total time be reduced by 20% by reducing only the time for branch instructions?
Patha S.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD