COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG
3rd Edition
ISBN: 9780134671123
Author: Bryant
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
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.
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.
2. Design a Read Only Memory (ROM) to implement the following, A097803, polynomial
A = 3(2x? + 1), with input (x) : 0< (x) <7
(a) What is the size of the initial (unsimplified) ROM ?
(b) What is the size of the final (simplified) ROM ?
(c) Show in detail the final ROM layout, using LogiSim.
Chapter 7 Solutions
COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG
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
- 5.16 Write a version of the inner product procedure described in Problem 5.13 that uses 6 x la loop unrolling to enable greater parallelism. Our measurements for this function give a CPE of 1.10 for integer data and 1.05 for floating-point data.arrow_forward[8] A C program containing the function food has been compiled into LC-3 assembly language. The partial translation of the function is:food:ADD R6, R6, #2STR R7, R6, #0ADD R6, R6, #1STR R5, R6, #0 ADD R5, R6, #1 ADD R6, R6, #4...How many local variables does this function have?a. 3b. 4c. 5d. 6arrow_forwardQ7. ] Given the following ARM64 assembly code for a function, add comments to each line, use its stack frame with corresponding variables, and trace the code execution to figure out what it does. Notice that local variables are stored in the function's stack frame. Hint: this is a void function that takes two input parameters. tunct: sub sp. sp, #32 str x0, (sp, 8] Address Contents x1, [sp) Idr x0, Isp, 81 str SP Sp + 4 Sp +8 Sp + 12 Sp + 16 Sp + 20 Sp + 24 Sp + 28 Idr wo, [x0] str wo, [sp, 28] Idr x0, [sp) Idr w1, [x0] Idr x0, [sp, 8] w1, [x0] Idr x0, Isp) str Idr w1, [sp, 28] str w1, [x0] DOR add Sp. sp, 32 retarrow_forward
- Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.” And answer the following questions: Question:The Ricart& Argwala mutual exclusion algorithm: (a) Does not depend on time stamps in messages while Lamport's does. (b) Cannot handle the case where two or more processes request the same resource at the same time. (c) Does not require a process to send messages to the entire group while Lamport's does. (d) Requires fewer messages than Lamport's algorithm.arrow_forward4) Write Y86 code to multiply 3 and 5 (store result in %rcx) (HINT: add 3 to itself 5 times or vice- versa.) Execute the code on Y86 simulator. Include screenshot of code and simulator window.arrow_forwardQUESTION 7 Convert the following symbolic microoperations into register transfer statements. Maintain the order accordin to the microoperation fields. a. WRITE (F1), ARTPC (F3), ACTDR (F2) b. READ (F2), INCPC (F3), CLRAC (F1) c. ACTDR (F2), DRTAR (F1) For the toolhar. oress ALT+F10 (PC) or ALT+FN+F10 (Mac).arrow_forward
- Do execution paths 3 and 4 encompass the first three conditions for a deadlock to occur?arrow_forwardQuestion 3: On a byte addressable machine a string COMSATS UNIVERSITY ISLAMABAD PAKISTAN, starting from logical address 0 (zero) to 36 is to be loaded into memory, in noncontiguous fashion, using 'Paging' technique. The string is divided mechanically into equal sized pages of 4 bytes; similarly the memory is also divided into equal sized frames of 4 bytes. The ASCII code of each Character occupies one byte. The free frame list is given as follows: 8,3,4,2,6,7 ,5,1,9,21,24, 11 Answer the following questions a. What is the page map table? b. What are the linear logical addresses of characters 'U' and_'B'? c. What are the linear physical addresses of characters 'U' and_'B'? d. What is the difference between Internal and External fragmentation? e. What is the internal fragmentation in loading given string?arrow_forward1.3 Assemble the following assembly code into machine code. Assume that the machine language op-codes for load, store, mult, add, div, and sub are 18, 19, 13, 14, 15, and 16, respectively. Also assume that the variable x is stored at location M[50]. load R1, x mult R2, R1, #9 store x, R2 sub R0, R1, #8 div R2, R0, #2 I NEED THE MACHINE CODE IN DECIMAL PLEASE,arrow_forward
- 1.3 Assemble the following assembly code into machine code. Assume that the machine language op-codes for load, store, mult, add, div, and sub are 18, 19, 13, 14, 15, and 16, respectively. Also assume that the variable x is stored at location M[50]. load R1, x mult R2, R1, #9 store x, R2 sub R0, R1, #8 div R2, R0, #2arrow_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* 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
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