Problem: A 1024 x 1024 array of 32-bit numbers is to be normalized as follows. For each column, the largest element is found and all elements of the column are divided by the value of this element. Assume that each page in the virtual memory consists of 4K bytes, and that 1M bytes of the main memory are allocated for storing array data during this computation. Assume that it takes 10 ms to load a page from the disk into the main memory when a page fault occurs. (a) Assume that the array is processed one column at a time. How many page faults would occur and how long does it take to complete the normalization process if the elements of the array are stored in column order in the virtual memory? (b) Repeat part (a) assuming the elements are stored in row order? (c) Propose an alternative way for processing the array to reduce the number of page faults when the array is stored in the memory in row order. Estimate the number of page faults and the time needed for your solution.

Problem: A 1024 x 1024 array of 32-bit numbers is to be normalized as follows. For each column, the largest element is found and all elements of the column are divided by the value of this element. Assume that each page in the virtual memory consists of 4K bytes, and that 1M bytes of the main memory are allocated for storing array data during this computation. Assume that it takes 10 ms to load a page from the disk into the main memory when a page fault occurs. (a) Assume that the array is processed one column at a time. How many page faults would occur and how long does it take to complete the normalization process if the elements of the array are stored in column order in the virtual memory? (b) Repeat part (a) assuming the elements are stored in row order? (c) Propose an alternative way for processing the array to reduce the number of page faults when the array is stored in the memory in row order. Estimate the number of page faults and the time needed for your solution.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Problem: A 1024 x 1024 array of 32-bit numbers is to be normalized as follows. For each column, the largest element is found and all elements of the column are divided by the value of this element. Assume that each page in the virtual memory consists of 4K bytes, and that 1M bytes of the main memory are allocated for storing array data during this computation. Assume that it takes 10 ms to load a page from the disk into the main memory when a page fault occurs. (a) Assume that the array is processed one column at a time. How many page faults would occur and how long does it take to complete the normalization process if the elements of the array are stored in column order in the virtual memory? (b) Repeat part (a) assuming the elements are stored in row order?
Microprocessor 8086 write An array called (A) has 300 unsigned byte numbers (chose your Owen data), write only one assemble to the following1-store the Maximum number of (A) in physical address AB200h. 2- store the Minimum number of (A) in the physical address CD100h. 3-rearrange the array given (A) ascending and save the new array in the memory starting at 3050e 4-save only the maximum odd number in the logical address 5200:0350
1. Suppose an array with six rows and eight columns is stored in a row major order starting at address 20 (base 10). If each entry in the array requires only one memory cell, what is the address on the entry in the third row and fourth columns? What if each entry requires two memory cells?
An array Array[20][15] is stored in the memory along the column with each element occupying 8 bytes of memory. Find out the Base address and address of the element Array [2][3], if the element Array [10][25] is stored at the address 1000.
An integer array [41,11,121,163] is stored in memory. Each integer has 32 bits. Suppose the first byte of the array data has a hexadecimal address of F8D4A0C8, and the content of the $s4 register is also F8D4A0C8 in hexadecimal. List the integer values in decimal in the array starting with element 0, after the following MIPS code is executed. Separated them by comma, for example, 11,22,33,44. lw $t5, 0($s4) lw $t4, 12($s4) add $t4, $t5, $t4 Sw $t4, 0($s4) Answer:
4. The figure below shows an 8-way interleaved, byte-addressable memory. The total size of the memory is 4 KB. The elements A[i]G) of a 2-dimensional array A are 4-bytes (one-word) in length and can be stored in the memory as shown, where 0 < ij <7. The width of the bus between CPU and memory is 32 bits, that is, it can carry only one word at a time. Bank 1 Bank 7 Bank 0 31 7 A[7][0] A[I][0] A[0]|0] 32 A[7]1] 64 A[7]|2] A[I][2] A[0||2] RANKO 255 224 AI기기 A[I][7] A[0||7) RANKN ...... Since the address space of the memory is 4 KB, 12 bits are needed to uniquely identify each memory location, i.e., Addr[11:0]. Find out and explain which bits of the address will be used for: • Byte on bus: Addr […... :...] Bank index bits within a bank: Addr [.... .] • Chip select address bits within a rank: Addr […... .] • Rank bits: Addr […... :....]
For the following loop, assume the array arr2[][] has never been referenced before in the code. Also assume that a cache line is 32 Bytes, and an int is 4 Bytes. 1. How many memory references are there?2. How many cache misses are there?
For the following loop assume the array arr2[][] has never been referenced before in the code. Also assume that a cache line is 32 Bytes, and an int is 4 Bytes. 1. How many memory references are there?
Comment on each snippet with what the snippet does. Assume that there is an array, int arr [6] = {3, 1, 4, 1, 5, 9}, which starts at memory address 0xBFFFFF00. You may assume that each integer is stored in 4 bytes. Register a0 contains arr's address lw t0, 0(a0) lw t1, 8(a0) add t2, t0, t1 sw t2, 4(a0) 2. add t0, x0, x0 loop: slti t1, t0, 6 beq t1, x0, end slli t2, t0, 2 add t3, a0, t2 lw t4, 0(t3) sub t4, x0, t4 sw t4, 0(t3) addi t0, t0, 1 j loop end: pseudo-instructions are not allowed
An array is stored I the memory with each element requiring 4 bytes of storage. If the base address of array VAL is 1500, determine the location of VAL[12][9] when the array VAL is stored (1) Row wise (ii) Column wise. VAL[1..15][1..10]
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
80x86 Intel Assembly language Write an 80x86 Intel assembly language program: Declare two integer arrays and initialize the first one with 7, 6, 5, 4 and 3. Initialize the second one with 3, 6, 9, 10, 15 Declare the third array of the same size but do not initialize. Your program must initialize ESI and EDI to have the addresses of the array1 and array2 respectively. Use EBX and place the address of the third array in that register. Use these registers to add the first element of the first array to the first element of the second array and place the result in the third array. Updated the values of these registers so all of them refer to the next location.