Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092997
Author: Bryant
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 7, Problem 7.12HW
A.
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>
From the given question,
And then value of “ADDR(.text)” is “0x4004e0” and value of “ADDR(swap)” is “0x4004f8”.
- 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”
B.
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>
From the given question,
From the given question,
And then value of “ADDR(.text)” is “0x4004d0” and value of “ADDR(swap)” is “0x400500”.
- 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”
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Do execution paths 3 and 4 encompass the first three conditions for a deadlock to occur?
1. In a certain device, the disk rotates at 5000rpm. a) how long does one revolution take? b) what is the average rotational delay of this disk drive 2. Consider a disk dirve with 1000 tracks, numbered 0 to 999. The request queue has the following composition: 300 740 150 940 200 850 145 555 775 695. The current position is 197 and the previous request was served at 100. For each of the following disk scheduling algorithsm, compute the total distance (in tracks) that the disk arm would move. Include the calculation steps in your answers. 2.1 First - In-First-Out (FIFO) 2.2 Shortest - Service-Time - First (SSTF) 2.3 SCAN (no LOOK variation) 2.4 C-SCAN (No C-LOOK variation)
Input file sample.txt contains a hex dump of some data in the following format:<address> <byte1> <byte2> ... <byte16>Example Input File:00000000 54 68 69 73 20 69 73 20 61 6e 20 65 78 61 6d00000010 70 6c 65 20 6f 66 20 68 65 78 20 64 75 6d 70...Construct a pipeline using Ubuntu bash to discard the first column (address) and to reformat bytesinto a single column:
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
- Suppose that we have an atomic test-and-set-lock instruction that atomically copies val to old_val, and sets val to 1. void test_and_set(int* old_val, int* val); Write the implementations for the following functions of a Spinlock. void acquire(int* lock) { // your code } void release(int* lock) { // your code } PROVIDE CODE IN Carrow_forwardDo Execution Paths 3 and 4 encompass the first three conditions for a deadlock to occur? Explain your answer.arrow_forwardWrite a program in HACK assembly, without using symbols, that computes thebitwise exclusive or (XOR) of the values stored in RAM[1] and the value of thememory location with address stored in RAM[2]. The result of the computationshould be stored in RAM[0].You can think of RAM[2] as being a pointer to where the second operand of the XORis stored.arrow_forward
- Write a C program for a linux partition. 1. Start from the first data block of each block group 2. Read the block into a buffer 3. Compare the relavant bytes in the buffer to the png signature then print out this data block number (png header in hex: 89 50 4E 47 0D 0A 1A 0A) 4. Scan each data block until the end of the partitionarrow_forwardIn the above, we had the three concurrent processes p1, p2 and p3, each with the number s1 = 2, s2 = 3 and s3 = 2 of states, respectively.arrow_forwardWrite a c++ code that implements a program that compares the running time for two loops which access very different number of array elements but which should have roughly the same number of cache misses. Try to estimate the average time for an array access with a cache miss and one without. use the following two loops (in the screenshot provided)arrow_forward
- Below is a program block written in ARM Assembly. Since initially PC = 0x2000, Stack pointer sp = 0x400 (no data in the stack memory and shown next), what are the LR and SP values when PC = 0x2028 (when the corresponding row is executed)? A. LR = 0x2048,SP = 0x3F0 B. LR = 0x201C,SP = 0x3F4 C. LR = 0x202C,SP = 0x408 D. LR = 0x2008,SP = 0x3F8 E. LR = 0x201C,SP = 0x404arrow_forwardSuppose a malloc implementation returns 8-byte aligned addresses and uses an explicit free list where the next and previous pointers are each 32-bits. Blocks have a 32-bit header and 32-bit footer, where the low-order bit of the header and footer are used to indicate whether the block is allocated (1) or free (0). Furthermore, the block size (which includes the header, payload, footer, and any necessary padding) is rounded up to the nearest multiple of 8, and this size (in bytes) is stored in the header and footer. Assume any padding must be between the payload and the footer.If we call malloc(1), what block size will be allocated, in bytes? With the same conditions as #1, and assuming we've already called malloc(1), if the heap used by malloc starts at address 0x4000 (16384 in decimal), what address would be returned if we then called malloc(32)?arrow_forwardSuppose a malloc implementation returns 8-byte aligned addresses and uses an explicit free list where the next and previous pointers are each 32-bits. Blocks have a 32-bit header and 32-bit footer, where the low-order bit of the header and footer are used to indicate whether the block is allocated (1) or free (0). Furthermore, the block size (which includes the header, payload, footer, and any necessary padding) is rounded up to the nearest multiple of 8, and this size (in bytes) is stored in the header and footer. Assume any padding must be between the payload and the footer. a)If we call malloc(1), what block size will be allocated, in bytes? b)Using the same condition, assuming we've already called malloc(1), if the heap used by malloc starts at address 0x4000 (16384 in decimal), what address would be returned if we then called malloc(32)?arrow_forward
- For a data segment there are 2 lists in the following memory demonstration(from 0007 offset address) with 5 elements called LIST1(list type:byte) and another list with 4 elements called LIST2(list type: Word), respectively. a) write how registers change when the following code is executed. MOV DI,2 DI = LEA BX, LIST2 BX = MOV DX, [BX][DI]+1 DX = MOV BX, OFFSET LIST1 BX = INC DI DI = SUB BX, DI BX = MOV CL, LIST1[BX] CL = b) Write code that copies 1 byte sized data that is in 0014 address, from 000DH address. c) Write code that copies 3rd element of LIST2 to 0th element of LIST2.arrow_forwardWrite an MPI program segment for all-to-all personalized broadcast on a ring of p processors, eachprocessor Pi, 0 ≤ i ≤ p − 1, holding M(i, 0), M(i, 1), ·M(i,(p − 1)). Message M(i, j), an integer, is destinedfrom Pi to Pj . Show only the p − 1 iterative loop. Ensure proper buffer size, MPI message size, howitems are organized and ordered at the destination buffer, etc., through each loop.arrow_forwardWrite a service routine which resets all elements of an array that resides in memory location from A000 H to A0FF H with DS equal to 0000 H. The service routine address is CS:IP where CS is 2000 H and IP is 0100H. Assume the interrupt type that is called is 50 (x8086- nano)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