Problem: A 1024 × 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?

Problem: A 1024 × 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?

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

3. Draw the memory map for 8 bytes starting at 0x2000_0030 as shown in the form given above.
How many bits are needed to address a 4M x 16 main memory if and only if the following conditions are met: a) Is the main memory reachable in bytes? b) Is the main memory reachable in words?
Make a single process (the root process) collects data from the other processes in a group and combines them into a single data item. Compute the sum of the elements of an array that is distributed over several processors. Use: Broadcasting and apply synchronization using barrier
Microprocessor 8085 : Note 1: Use F for fetch, R for memory read, W for memory write, IOR for IO read, and IOW for IO writeNote 2: Use hexadecimal where possible Q/Write a program to find the largest number among 6 numbers data array starting at 2070 h, and save the result at 2076 h.
How many bits are needed to address a 4M x 16 main memory if and only if the following conditions are met: a) Is the main memory reachable in bytes? b) Is the main memory reachable in words?
Write a fortran 90 program using subroutine Let A be the 50x50 tridiagonal matrix as shown below: 5 -1 0 0 x1 1 ... -1 0 0 x2 2 ... -1 5 0 x3 3 0 ... ... ... ... 0 5 -1 x49 49 0 0 -1 5 x50 50 *** Consider the problem Ax = b, find the solutions for the following vectors b b = [1,2,3,...,49,50] 500000 TSTOOO -1 5 0 0 000
Assuming that EBX contains a row index into a two-dimensional array of 32-bit integersnamed myArray and EDI contains the index of a column, write a single statement thatmoves the content of the given array element into the EAX register.
In H-partition algorithm, for a reverse array, the instruction exchangea.Never executes b.Executes times c.Executes n times d.Executes n+1 times
code code code
Create a program that uses the direct addressing method to store data DFH in RAM memory regions 30H through 39H.
There are many parameters that could be used to describe disk performance; among them are: number of bits per track disk capacity (in bits) number of disk surfaces rotational speed rotational latency transfer rate tracks per surface sectors per track blocks per track sectors per block seek time speed of disk arm block-read time number of blocks Some of these parameters are independent, and others are (approximately) linearly related. That is, doubling one doubles the other. Decide which of these parameters are linearly related. Then, select from the list below, the relationship that is true, to within a close approximation. Note: none of the statements may be true exactly, but one will always be much closer to the truth than the other three. Also note: you should assume all dimensions and parameters of the disk are unchanged except for the ones mentioned. a) If you divide tracks into half as many blocks, then you double the read time for a block.…
Let's pretend that something unexpected happens: the CPU makes a partially-completed request to the cache at the same time as a block is being returned from the write buffer to main memory. The following steps need to take place.