Consider a program that declares global integer variables x, y[10]. Thesevariables are allocated starting at a base address of decimal 1000. All thesevariables have been initialized to zero. The base address 1000 has been placed in$gp. The program executes the following assembly instructions:lw $s1, 0($gp)addi $s1, $s1, 25sw $s1, 0($gp)lw $s2, 12($gp)add $s2, $s2, $s1sw $s2, 8($gp)sw $s2, 12($gp) What are the memory addresses of variables x, y[0], and y[1]? What are the values of variables x, y[0], y[1], and y[2] at the endof the program?

Consider a program that declares global integer variables x, y[10]. Thesevariables are allocated starting at a base address of decimal 1000. All thesevariables have been initialized to zero. The base address 1000 has been placed in$gp. The program executes the following assembly instructions:lw $s1, 0($gp)addi $s1, $s1, 25sw $s1, 0($gp)lw $s2, 12($gp)add $s2, $s2, $s1sw $s2, 8($gp)sw $s2, 12($gp) What are the memory addresses of variables x, y[0], and y[1]? What are the values of variables x, y[0], y[1], and y[2] at the endof the program?

Name: Consider a program that declares global integer variables x, y[10]. Th
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Consider a program that declares global integer variables x, y[10]. Thesevariables are allocated starting at a base address of decimal 1000. All thesevariables have been initialized to zero. The base address 1000 has been placed in$gp. The program ex

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 1PE: Develop a program consisting of primitive CPU instructions to implement the following procedure:...

See similar textbooks

Similar questions

Write an LC-3 assembly language program that counts the number of 1s in the value stored in R0 and stores the result in R1. For example, if R0 contains 0001001101110000 (x1370), then after the program executes, the value stored in R1 would be 0000000000000110 (decimal 6) Here are some hints ORIG x3000 AND R5, R5, #0 ADD R5, R5, #1 ;R5 will act as a mask AND R1, R1, #0 ;zero out the result register AND R2, R2, #0 ;R2 will act as a counter LD R3, NegSixt MskLoop AND R4, R0, R5 ;mask off the bit Add code here... if you want more than a 0 Solicit the number to be inspected via the keyboard. 10 points for a single digit (e.g. 5) decimal number, which must be converted to binary. 20 points for a two digit (e.g. 55) decimal number, which must be converted to binary.
Write and simulate a MIPS assembly-language routine that: 1. Prints your group number, for example “Group 1”, 2. Computes the dot product of two vectors, A_vec and B_vec, as described in Lab 4 of the Lab Manual, 3. Stores the result at memory word DOTPROD, and 4. Prints the result preceded by the phrase: “The result of the dot product is: “. Your data segment should look like the following: .data group: .asciiz “\nGroup x” msg: .asciiz "\nThe result of the dot product is: " A_vec: .word x, 4, 20, 13, 3, 10, 5 B_vec: .word 4, 2, 1, 2, 5, 2, 4 n: .word 7 DOTPROD: .word 0 Replace each “x” with your group number.
Write a new program in MIPS Assembly language using your LFSR function from the first problem. Start from state 0x00000001, then run a loop counting all the possible states in the LFSR before it cycles back to 0x00000001. This is shown by the following pseudocode: count = 0; initial = state = 0x00000001; do { state = LFSR(state); count++; while (state != initial); print count; Verify that the number of states is (2^15) - 1 = 32767 . Your program should complete within 30 seconds. If it takes longer then you likely have entered an infinite loop.
Write an assembly language program that reads a specified number of positive integer inputs from standard input and outputs the largest value that was read. For example, if standard input contains: 5 3 2 7 9 4 The 5 indicates that there will be 5 additional values. Then program should read those 5 additional values and print the largest of them (e.g 9 in this case). One strategy here would be to outline the program in high-level language code and then translate it into assembly code. Be sure to assemble, run and test your program to ensure that it is syntactically correct and that it works correctly. The program should work for any valid input not just the one shown above.
What the code below does? Consider the following code used to implement a new instruction: foo $t3,$t1,$t2: mask : . word 0xFFFFF83Fs t a r t : l a $t0 , masklw $t0 , 0 ( $ t 0 )l a $t3 , s h f t rlw $t3 , 0 ( $ t 3 )and $t3 , $t3 , $ t 0a ndi $t2 , $t2 , 0 x 0 0 1 fs l l $t2 , $t2 , 6o r $t3 , $t3 , $ t 2l a $t5 , s h f t rsw $t3 , 0 ( $ t 5 )s h f t r : s l l $t3 , $t1 , 0 What does foo does?
Write a Java program that prompts the user for the page size used in a virtual memory system; this will be a power of two between 512 (29) and 16384 (214), inclusive. Your program should check the user input for page size to make sure it is one of the allowable inputs (must be a power of 2 and cannot be smaller than 512 or larger than 16384), and should then prompt the user for a virtual address (assume 32-bit virtual addressing, so your code must be able to accept any input between 0 and 4294967295, which is 232-1). Given this input, the program must output the virtual page number and the offset within the page. Sample output might look like this: Please enter the system page size: 1024 Please enter the virtual address: 10000 This address is in virtual page: 9 At offset: 784
An assembly language program is given below, where assume that, SS=2000H andSP=2009H; Flag register, F=FFCDH. MOV AX, 7645HMOV BX, 4477HMOV CX, 8899HMOV DX, BXPUSH DXPUSH AXPUSH BXPUSHFPOP CXFind Out: • The physical address.• The value of CX, DX and Flag register F after the end of program.• Draw memory map.
Consider a 32-bit computer with the MIPS assembly set, that executes the following code fragment loaded in memory in the address 0x0000000. li $t0, 1000 li $t1, 0 li $t2, 0 loop: addi $t1, $t1, 1 addi $t2, $t2, 4 beq $t1, $t0, loop This computer has a 4-way associative cache memory of 32 KB and lines of 16 bytes. Calculate the number of cache miss of the previous code, and the hit ratio, assuming that no other program is executing and that the cache memory is initially empty.
What the code below does? Consider the following code used to implement a new instruction: foo $t3,$t1,$t2: mask : . word 0xFFFFF83Fstart : la $t0 , masklw $t0 , 0 ( $ t 0 )la $t3 , s h f t rlw $t3 , 0 ( $ t 3 )and $t3 , $t3 , $ t 0andi $t2 , $t2 , 0 x 0 0 1 fsll $t2 , $t2 , 6or $t3 , $t3 , $ t 2la $t5 , s h f t rsw $t3 , 0 ( $ t 5 ) shftr: sll $t3 , $t1 , 0 What does foo does?
CODE IN JAVA !!!!!!!!!!!!!!!!!!!!!!! Provide a code for LRU The Last Recently Used (LRU) solution for the memory page replacement but using two bits (boolean variable in Java) for the clock algorithm with one indicates the reference bit and the other indicates the read/write bit. Here we assume for all the processes, the pages with the number 2 and 5 involve data writing operation; all the other numbers (1, 3, 4, 6) only involve reading operations. Provide output examples of the code at the bottom.
Write a program in assembly language that copies three string “S1, S2, S3” to “S4” using indexed addressing insuch a pattern that String S4 would become: [SSStttrrriiinnnggg123]. The data is given below..dataS1 byte "String1",0S2 byte "String2",0S3 byte "String3",0S4 byte sizeof S1*3-2 Dup(0) solve this with assembly language
write a program in ( assembly language (8086) )that compare two blocks of 64 consecutive bytes, the first block starting at address 0020 H in the current data segment 0300 H & the Second block starts at 0020 H in the current extra segment 0500 H. if the blocks is symmetrical put 0FF0 H in register BX otherwise put 0000H.