Consider the following string of memory accesses. All of these access will miss, thus the hit rate will be zero. li t0, 0x1000 sw t1, 0(t0) # 1 sw t1, 0x10(t0) # 2 sw t1, 0x20(t0) # 3 sw t1, 0x30(t0) # 4 sw t1, 0x40(t0) # 5 What is the smallest offset greater than 0x10 that you can change #3 to that creates a conflict miss (specifically, evicting the data that was placed in the cache by instruction #2) in a 32-entry 4-word direct-mapped cache? Answer with the leading "0x".

1. How does the memory allocated and released in a buddy system? Implement the following statements as an example, if there is a 1 Mbyte block of memory vacant to occupy. a) a request came to reserve 100K in the memory, b) then another request came to reserve of 240K.c) then another request came to reserve 64Kd) then another request came to reserve 256K. e) a requested quoted to release 240K, f) then to release 100K. g) then another request quoted to reserve 75K, h) then release 64Ki) then release 75Kj) then release 256K

Consider a disk that rotates at 3600 rpm. The seek time to move the head between ad- jacent tracks is 2 ms. There are 32 sectors per track, which are stored in linear order from sector 0 through sector 31. The head sees the sectors in ascending order. Assume the read/write head is positioned at the start of sector 1 on track 8. There is a main memory buffer large enough to hold an entire track. Data is transferred between disk locations by reading from the source track into the main memory buffer and then writing the date from the buffer to the target track. a. How long will it take to transfer sector 1 on track 8 to sector 1 on track 9? b. How long will it take to transfer all the sectors of track 8 to the corresponding sec- tors of track 9?

No plagarism please! Correct and detailed answer will be Upvoted else downvoted. Thank you!

dont post copied answer directly downvote

Imagine a virtual memory system where the RAM can only store two pages at a time. Suppose a program makes the following sequence of page accesses: At time 0, page 5At time 1, page 1At time 2, page 5At time 3, page 2At time 4, page 5At time 5, page 3At time 6, page 5At time 7, page 4 Show at what points in time page replacements occur, and which pages are evicted, using the following page replacement algorithms:(a) FIFO(b) LRU

Assume there is a PCI buffer that is used for data transfers between primary memory and a webcam. The memory transfers 15 frames where each frame is 1M byte in size and the buffer size is 1K byte. 1-How many data transfers will be required? 2-A transfer operation requires 2 interrupts. Start and stop. How many interrupts will occur for the data transfer? 3-What are the two commands that will be issued by the supervisor for each interrupt?

For a 100-cylinder disk, compute the total number of head movements for the request queue provided below, using FCFS scheduling and a 100-cylinder disk (0-99). It is expected that the read write head is present at cylinder number 50 at the start of the program. Request queue for disk cylinders has the following numbers: 75, 25, 30, 68, 40, 89, 10.

Suppose we have one floating-point multiplication unit in our microprocessor, and it takes seven cycles for it to complete the multiplication. If we get 3 back-to-back floating-point multiply instructions with no data dependency on the previous values, then what type of Hazard can we run into? a. Exception or Interrups b. Control Hazard c. No Hazard, as there is no dependency on the data between the three instructions e. Data Hazard f. Structural Hazard

For a single cycle Processor, how many clock cycles are required to execute the following code segment that clears a string of length 5bytes ($a1=5) ? Bzero : beq $a1, Szero, End Loop: sb $zero, 0($a0) # sb store byte in memory add $a0, $a0, 1 sub $a1, $a1, 1 bne $a1, $zero, Loop End : jr $ra # jump to an instruction with an address given in register $ra

Suppose the OS on your computer uses the Buddy system for memory management. Initially the system has a 1 megabyte (1024K) block of memory managment Show the result of each request. A: Request 25 K B: Request 500 K C: Request 70 K D:Request 100 K E: Request 40 K Release A F: Request 20 K Release B After memory is allocated to process F, how much internal fragmentation exist inthe system. (Subject:operating system )

Suppose the OS on your computer uses the Buddy system for memory management. Initially the system has a 1 megabyte (1024K) block of memory available. Show the result of each request/release via successive figures similar to the one illustrated in the lecture slides. A: Request 25 K B: Request 500 K C: Request 70 K D:Request 100 K E: Request 40 K Release A F: Request 20 K Release B After memory is allocated to process F, how much internal fragmentation exist in the system.

A machine has a memory of 64 frames, with each frame being 1K bytes. Current free-frame list is: ×ばつ2E, Ox27, Ox37, Ox25, OX0C, Ox04, OXOE, Ox09, ×ばつ1D, Ox14, Ox16, Ox07, 0x22, ×ばつ3E, and Ox30. You just scheduled a process that requires 10 frames. Show the resulting page table. Show the translation of logical address Ox240B and OX5A32 into physical addresses using your page table. Express your result in hex.