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
Expert Solution & Answer
Chapter 7.7, Problem 7.5PP
Explanation of Solution
Computing the value of the relocated reference to swap in the “callq” instruction:
From the given question, the function “swap” in object file “m.o” is
9: e8 00 00 00 00callqe<main+oxe>
Based on the relocates PC-relative references,
- Here “ADDR” means run-time addresses for each section.
Compute the run time address of the references using the formula of “refaddr = ADDR(s) + r.offset”
Then updates the reference by using the below formula
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
5.14
Write a version of the inner product procedure described in Problem 5.13 that
uses 6 x 1 loop unrolling. For x86-64, our measurements of the unrolled version
give a CPE of 1.07 for integer data but still 3.01 for both floating-point data.
A. Explain why any (scalar) version of an inner product procedure running on
an Intel Core i7 Haswell processor cannot achieve a CPE less than 1.00.
B. Explain why the performance for floating-point data did not improve with
loop unrolling.
I need the answer in machine code (binary) pls.
Example 2.9
Chapter 7 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 7.5 - Prob. 7.1PPCh. 7.6 - Practice Problem 7.2 (solution page 718) In this...Ch. 7.6 - Practice Problem 7.3 (solution page 718) Let a and...Ch. 7.7 - Prob. 7.4PPCh. 7.7 - Prob. 7.5PPCh. 7 - This problem concerns the m. o module from Figure...Ch. 7 - Without changing any variable names, modify bar5.c...Ch. 7 - Prob. 7.8HWCh. 7 - Consider the following program, which consists of...Ch. 7 - Let a and b denote object modules or static...
Knowledge Booster
Similar questions
- 9.23 The starting address of the trap routine is stored at the address specified in the TRAP instruction. Why isn't the first instruction of the trap routine stored at that address instead? Assume each trap service routine requires at most 16 instructions. Modify the semantics of the LC-3 TRAP instruction so that the trap vector provides the starting address of the service routine.arrow_forwardQ2. Refer to datapath design on slide no. 26 with added blocks for jump instructions as shown inslide 33 in Chapter 4 (part 1). Let’s assume a program has 500 instructions. These instructions aredistributed as follows:R-Type Immediatearithmetic(addi)Load Store Branch Jump25% 5% 20% 20% 10% 20%Answer the following questions (show calculations):a) How many instructions will use instruction memory?b) How many instructions will use data memory?c) How many instructions will use the sign extend block?d) In the clock cycles, where the sign extend block is not required, does it remain idle? If yes,how? If not, what happens to the output of the block in that cycle? chapter 4, slide 33 is added as an image needed to solve the questionarrow_forwardIn C++, the instruction is given in pic. 2nd img contains the expected output. Please explain what your code is as well so I can understand, thank you so much!arrow_forward
- Partial Question 18 Select true statements from the following. extern' directive asks assembler to reserve specified amount of space in memory without a need to initialize the space. MIPS provides native PUSH and POP operations for STACK access. By convention, stack in MIPS grows downwards (i.e. from higher address to lower address). Stack pointer ($sp) starts 4 bytes below the memory boundary for application program data space. PUSH in MIPS always needs to store data first and then move Ssp to next free address.arrow_forwardDo execution paths 3 and 4 encompass the first three conditions for a deadlock to occur?arrow_forward(3) (a) Consider the following interaction with Python: x= [1,2,34 ,5 ,6 , np.nan] y= (10,i,2,5, 'Missing',6.3) z= [0.1, 1.2 , np.nan , 4,5.1,0.5] df1=DataFrame ({'col1':Series (z),'co12':Series (y), 'col3': Series (x)}). df1.index= ['a','b','c', 'd','e','f'] Replace the NaN value in coll with -9, the Missing value in col2 with -99, and the NaN value in col3 with -999 with relevant functions. Name as dfl_replaced (b) Consider the following interaction with Python: df2=DataFrame (np. array ( [[1, np.nan ,3, 8], [np.nan , 2,3,5] , [10,2,3, np.nan], [10,2,3 , np.nan], [10,2,3,11]])) df2.columns = ['one', 'two', three', four '] df2. index= ['a','b','c 'd','e'] Remove the rows that have nan values from df2 and name as df2_row. Remove the columns that have nan values from df2 and name as df2_column. Use relevant functions.arrow_forward
- Question 5 Multiple Choice: We have been assigned the task of selecting an interface language for a disk controller that must count disk reads. In particular, the controller must count how many reads have occurred since the last write to the disk and confirm that the count of reads does not exceed 1,000,000. Two proposals have been made. Method C uses C++ while Method R uses regular expressions. Then I would use Method C because Method R would translate into a finite automaton with at least 1,000,000 states. I cannot use Method C because it is not able to keep track of the count of reads. I would use Method C because Method R cannot keep track of the count of reads. I cannot use Method R because regular expressions cannot represent integers.arrow_forwardQ2. Refer to datapath design on slide no. 26 with added blocks for jump instructions as shown in slide 33 in Chapter 4 (part 1). Let's assume a program has 500 instructions. These instructions are distributed as follows: R-Type 25% Immediate arithmetic (addi) 5% Load 20% Store 20% Branch 10% Jump 20% Answer the following questions (show calculations): a) How many instructions will use instruction memory? b) How many instructions will use data memory? c) How many instructions will use the sign extend block? d) In the clock cycles, where the sign extend block is not required, does it remain idle? If yes, how? If not, what happens to the output of the block in that cycle?arrow_forward* We have declared some functions in "timer.c" and corresponding function * prototypes in "timer.h": * void timer_init(void); // Initialise TCB0 to produce interrupts every 1ms * * Your task for Ex 9.3 is to complete the ISR declared in "timer.c" to display * simultaneously the first digit of your student number on the LHS of the 7-segment * display and the second digit of your student number on the RHS of this display (only * after timer_init() is called). * * TIP: Every time a new interrupt occurs you should swap which digit you are displaying. * * TIP: You will want to declare a global or static variable so you know which digit to * display on each iteration. * * TIP: You might like to refer to the following truth table for 7-segment digit mapping. * (remember to check which output Q0..Q6 maps to which segment on the QUTy) * * ABCDEFG * 0: 0000001 * 1: 1001111 * 2:…arrow_forward
- do { flag[i] = true; turn = i; while (flag[j] && turn == j); Critical section flag[i] = FALSE; Remainder section } Three processes P1, P2, and P3 are sharing a resource R1 in a mutually exclusive manner. Using compare_and_swap instruction, show code for P1, P2, and P3 that shows the entry section and exit section (similar to the code shown in Question 1). Using this code, show a scenario if all three processes want to enter their critical sections.arrow_forwardUse c language, please follow the instruction.arrow_forwardPlz tryarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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