1- Write a MIPS assembly program that stores the values in consecutive successive words in the data segment with the initial offset 3000A, ending at offset 3FFEB. Then store the value 3000F to location 1000F. Next, write a code segment that sums the 128 words starting at the address found in location 1000F. This portion of the program cannot assume that 1000B contains 3000A. Print the sum and then quit. 2- Write a MIPS program that access an array of words starting at address 1000F and memory, of the length specified by the value in cx, and searches the maximum value in the array. Print the value after finding an element. 3- Write a MIPS assembly language program to reverse the numbers for two dimensional array of size 4X4

1- Write a MIPS assembly program that stores the values in consecutive successive words in the data segment with the initial offset 3000A, ending at offset 3FFEB. Then store the value 3000F to location 1000F. Next, write a code segment that sums the 128 words starting at the address found in location 1000F. This portion of the program cannot assume that 1000B contains 3000A. Print the sum and then quit. 2- Write a MIPS program that access an array of words starting at address 1000F and memory, of the length specified by the value in cx, and searches the maximum value in the array. Print the value after finding an element. 3- Write a MIPS assembly language program to reverse the numbers for two dimensional array of size 4X4

Name: 10. 1- Write a MIPS assembly program that stores the values in consecu
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 10. 1- Write a MIPS assembly program that stores the values in consecutive successive words in the datasegment with the initial offset 3000A, ending at offset 3FFEB. Then store the value 3000F to location1000F. Next, write a code segment that sums th

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 30VE

See similar textbooks

Similar questions

Suppose a computer using direct mapped cache has 4M byte of byte-addressable main memory, and a cache of 512 blocks, where each cache block contains 64 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag, block, and offset fields? c) To which cache block will the memory address 0x00007266 map?
Suppose a computer using fully associative cache has 224 bytes of byte-addressable main memory and a cache of 128 blocks, where each cache block contains 64 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag and offset fields? c) To which cache block will the memory address 0x01D872 map?
Write and document an assembly program to set R0=1 if there's a 5 in one of ten memory locations, starting at x3100. At the beginning of the program, set R0 = 0. If no 5 is found, it should leave R0 set to 0. If a 5 is found, output the following message to the console. "A 5 was found at x31xx." 31xx is the hex address of the 5.
Suppose a computer using direct-mapped cache has 232 (that's 232)232) bytes of byte-addressable main memory, and a cache size of 512 bytes, and each cache block contains 64 bytes. How many blocks of main memory are there? What is the format of a memory address as seen by cache, i.e. what are the sizes of the tag, block, and offset fields? To which cache block will the memory address 0x13A4498A map?
Suppose we have a byte-addressable computer using direct mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 16 bytes. a. Determine the number of bits of the offset field. b. Determine the number of bits of the block (or slot) field. c. Determine the number of bits of the tag field. d. To which cache block would the hexadecimal address 0x2468 map? e. What is the tag of the hexadecimal address 0x2468 f.To which cache block would the hexadecimal address 0x864A map? g. What is the tag of the hexadecimal address 0x864A?
Write an assembly program to set R0=1 if there's a 5 in one of ten memory locations, starting at x3100. At the beginning of the program, set R0 = 0. If no 5 is found, it should leave R0 set to 0. Please submit your assembly program below. I will run it with my data. If a 5 is found, output the following message to the console. "A 5 was found at x31xx." 31xx is the hex address of the 5.
Write an ALP to exchange block of data word by word (8 words) betweentwo memory locations. Assume memory1 address is 6000h and memory2address is 7000h
Write 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)
A computer is using a fully associative cache and has 216 bytes of main memory (byte addressable) and a cache of 64 blocks, where each block contains 32 bytes. a. How many blocks of main memory are there? b. What will be the sizes of the tag, index, and byte offset fields? c. To which cache set will the memory address 0xF8C9(hexadecimal) map?
1- Write an X86 assembly program that searches through a block of 100H characters starting from data segment memory location BLOCKA. This program must count all lower-case letters and all upper-case letters. Byte-sized data segment memory location LOWER must contain the count of small letters, and data segment location UPPER must contain the count of capital letters. 2- Write an X86 assembly program that copies the contents of the previous byte-sized memory block (BLOCKA) into a new byte-sized memory block (BLOCKB) after converting the case of the letters taking into account the block BLOCKA ends with the symbol #. Hint: Use your name, ID No. and your points in our previous assignments and terminates the string using the character ‘#’ as follows: BLOCKA db ‘nAME sURNAME id nO. 16-155-777 aSSG1=90, aSSG2=100, aSSG3=60 sPRING 2020 #’