Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 4.5, Problem 4.43PP
Program Plan Intro
Processing stages:
- The processing of an instruction has number of operations.
- The operations are organized into particular sequence of stages.
- It attempts to follow a uniform sequence for all instructions.
- The description of stages are shown below:
- Fetch:
- It uses program counter “PC” as memory address to read instruction bytes from memory.
- The 4-bit portions “icode” and “ifun” of specifier byte is extracted from instruction.
- It fetches “valC” that denotes an 8-byte constant.
- It computes “valP” that denotes value of “PC” plus length of fetched instruction.
- Decode:
- The register file is been read with two operands.
- It gives values “valA” and “valB” for operands.
- It reads registers with instruction fields “rA” and “rB”.
- Execute:
- In this stage the ALU either performs required operation or increments and decrements stack pointer.
- The resulting value is termed as “valE”.
- The condition codes are evaluated and destination register is updated based on condition.
- It determines whether branch should be taken or not in a jump instruction.
- Memory:
- The data is been written to memory or read from memory in this stage.
- The value that is read is determined as “valM”.
- Write back:
- The results are been written to register file.
- It can write up to 2 results.
- PC update:
- The program counter “PC” denotes memory address to read bytes of instruction from memory.
- It is used to set next instruction’s address.
- Fetch:
Backward taken, forward not taken (BTFNT):
- It predicts that if branches to lower addresses the next instruction will be taken.
- If it branches to higher addresses then next instruction will not be taken.
- This strategy has a success rate of 65%.
- The loops are executed multiple times and are closed by backward branches.
- The forward branches are used for conditional operations, and are less likely to be taken.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Please help step by step with Program R (CS) with a final code for understanding thank you.
COMMUNICATION AND COMPUTER NETWORKS
[11] Convert each of the following expressions into sum of products and product of sums :
(a) F = (AB+C)(B+CD)
(b) F= x + x(x + y) (y + z)
[12] Express the following functions as CSOP and CPOS expressions:
(a) F(x,y,z) = (x+y+z)(x+z') + yz
(b) F(w, x, y, z)=xy(wz+wz) (w+xz)
in terms of x, y, and z
in terms of w, x, y, and z
[13] Given the following pulse trains for A, B and C, draw the pulse trains for F₁ and F2.
B
A
C
D
F1
D
Draw the answers here
F2 B 0
F₁
A 1
F2
C 0
1
0
1
1
1
0
1
0
0
0 1
1
1
0 1
0
0
1
1
Chapter 4 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 4.1 - Prob. 4.1PPCh. 4.1 - Prob. 4.2PPCh. 4.1 - Prob. 4.3PPCh. 4.1 - Prob. 4.4PPCh. 4.1 - Prob. 4.5PPCh. 4.1 - Prob. 4.6PPCh. 4.1 - Prob. 4.7PPCh. 4.1 - Prob. 4.8PPCh. 4.2 - Practice Problem 4.9 (solution page 484) Write an...Ch. 4.2 - Prob. 4.10PP
Ch. 4.2 - Prob. 4.11PPCh. 4.2 - Prob. 4.12PPCh. 4.3 - Prob. 4.13PPCh. 4.3 - Prob. 4.14PPCh. 4.3 - Prob. 4.15PPCh. 4.3 - Prob. 4.16PPCh. 4.3 - Prob. 4.17PPCh. 4.3 - Prob. 4.18PPCh. 4.3 - Prob. 4.19PPCh. 4.3 - Prob. 4.20PPCh. 4.3 - Prob. 4.21PPCh. 4.3 - Prob. 4.22PPCh. 4.3 - Prob. 4.23PPCh. 4.3 - Prob. 4.24PPCh. 4.3 - Prob. 4.25PPCh. 4.3 - Prob. 4.26PPCh. 4.3 - Prob. 4.27PPCh. 4.4 - Prob. 4.28PPCh. 4.4 - Prob. 4.29PPCh. 4.5 - Prob. 4.30PPCh. 4.5 - Prob. 4.31PPCh. 4.5 - Prob. 4.32PPCh. 4.5 - Prob. 4.33PPCh. 4.5 - Prob. 4.34PPCh. 4.5 - Prob. 4.35PPCh. 4.5 - Prob. 4.36PPCh. 4.5 - Prob. 4.37PPCh. 4.5 - Prob. 4.38PPCh. 4.5 - Prob. 4.39PPCh. 4.5 - Prob. 4.40PPCh. 4.5 - Prob. 4.41PPCh. 4.5 - Prob. 4.42PPCh. 4.5 - Prob. 4.43PPCh. 4.5 - Prob. 4.44PPCh. 4 - Prob. 4.45HWCh. 4 - Prob. 4.46HWCh. 4 - Prob. 4.47HWCh. 4 - Prob. 4.48HWCh. 4 - Modify the code you wrote for Problem 4.47 to...Ch. 4 - In Section 3.6.8, we saw that a common way to...Ch. 4 - Prob. 4.51HWCh. 4 - The file seq-full.hcl contains the HCL description...Ch. 4 - Prob. 4.53HWCh. 4 - The file pie=full. hcl contains a copy of the PIPE...Ch. 4 - Prob. 4.55HWCh. 4 - Prob. 4.56HWCh. 4 - Prob. 4.57HWCh. 4 - Our pipelined design is a bit unrealistic in that...Ch. 4 - Prob. 4.59HW
Knowledge Booster
Similar questions
- (1) Let M be the PDA defined by Q = {q, 9o, I1, 42), E= {a,b}, T = {a}, F := {q , q1}. 8(9,, a , Zo) = {(q, Zo) } d(q, a, Zo) = {(q, aZo)} 8(q, a, a) = {(q, aa)} 8(q, b, a) = {(q1,e)} 8(q1, b, a) = {(qı,e)} 8(q1, b, Zo) = {(q2, e)} a) Describe the language accepted by M. b) Trace all computations of the strings aab, abb, aba in M. c) Show that aaabb, aaab E L(M ).arrow_forwardMatlab/ X1=1 , X=8 ؛ i want a solution only for D and E.arrow_forwardProblem 2. Use the 3 point approach and calculate (without programming) the expected sum (via Taylor expansion) at infinite terms from the partial sums at N+1, N and N-1 terms for function e. Assume N=5 and x-0.5 (i.e., max power = 4).arrow_forward
- (a) A ssume that five generation unıts with third order cost function (F, (P) = A; P+ B;P+C; P; + D;) are in the circuit. Write a computer program using any arbitrary programming language (MATLAB, C++, C#, Python,.) to calculate economic load dispatch (ELD) using first order gradient method. Note that all parameters and variables should be defined inside the program (at tirst limes) such that units' charactenistics and demand can be changed easily. Neglect grid losses. O using lambda - iteration method.arrow_forwardU U U Assume an MIP with five integer variables, X1, X2, X3, X4, and x5. Given the following LP relaxation solution, = ×₁ = 2.5, x2 = 3.7, x3 = 4, x4 = 5.9 and X5 1.7, which of the following are valid down- branch and up-branch restrictions, respectively, that would be used in branch and bound (select all that apply) x1 ≤ 2, x1 ≥ 2 x2 ≤ 4, x2 ≥ 3 x3 ≤ 4, x3 > 5 x4≤ 5, x4 ≤ 6 x5 ≤ 1, x5 > 2 All of the branches listed ☐ None of the branches listedarrow_forward2arrow_forward
- Hi this subject is digital system design i want the full answer with each steparrow_forwardMOV OT weMA MOV TH0,#-12 (a) (c) (e) (g) MOV MOV TH0,#-34 (d) MOV TH1,#-120 (f) MOV TH1,#-222 (h) MOV TH1,#-104 MOV TH1,#-67 41. In Problem 40, indicate by what number the machine cycle frequency of 921.6 kHz (XTAL = 11.0592 MHz) is divided. 42. In Problem 41, find the time delay for each case from the time the timer starts to the time the TF flag is raised. SECTION 9.2: COUNTER PROGRAMMING 43. To use the timer as an event counter we must set the C/T bit in the TMOD reg- ister to 44. Can we use both of the timers as event counters? 45. For counter 0, which pin is used to input clocks? 46. For counter 1, which pin is used to input clocks? 47. Program Timer 1 to be an event counter. Use mode 1 and display the binary count on P1 and P2 continuously. Set the initial count to 20,000. 48. Program Timer 0 to be an event counter. Use mode 2 and display the binary count on P2 continuously. Set the initial count to 20. 49. Program Timer 1 to be an event counter. Use mode 2 and display the…arrow_forwardMLarrow_forward
- 2arrow_forward2.20. The normalized radiation intensity of an antenna is approximated by U = sin 0 where 0 < 0 < , and 0arrow_forward2.13. The normalized radiation intensity radiated by an antenna is given by sin 0 cos? o 0° <0< 180° 90° <0< 270° U(0, 4) = Elsewhere The maximum of the radiation intensity occurs towards 0 = 90° and o = 180°. Find the: (a) Exact maximum directivity (dimensionless and in dB). (b) Half-power beamwidth (in degrees) in the principal azimuth (horizontal) plane. (c) Half-power beamwidth (in degrees) in the principal elevation (vertical) plane. (d) Maximum directivity (dimensionless and in dB) using an appropriate approximate method that you know. Indicate which one you are using.arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education