Supermarkets are constantly faced with a problem similar to page replacement in virtual memory systems. They have a fixed amount of shelf space to display an ever increasing number of products. If an important new product comes along, say, 100% efficient dog food, some existing product must be dropped from the inventory to make room for it. The obvious replacement algorithms are LRU and FIFO. Which of these would you prefer?

Supermarkets are constantly faced with a problem similar to page replacement in virtual memory systems. They have a fixed amount of shelf space to display an ever increasing number of products. If an important new product comes along, say, 100% efficient dog food, some existing product must be dropped from the inventory to make room for it. The obvious replacement algorithms are LRU and FIFO. Which of these would you prefer?

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

Write a c++ code that implement a loop that accesses a number of different locations in an array over-and-over again, and see how the average access time changes as the array size increases, from a size small enough to fit in L1 cache to a size too large to fit in L2 (or L3) cache. Try to estimate the sizes of your caches.
Merge sort is an efficient sorting algorithm with a time complexity of O(n log n). This means that as the number of elements (chocolates or students) increases significantly, the efficiency of merge sort remains relatively stable compared to other sorting algorithms. Merge sort achieves this efficiency by recursively dividing the input array into smaller sub-arrays, sorting them individually, and then merging them back together. The efficiency of merge sort is primarily determined by its time complexity, which is , where n is the number of elements in the array. This time complexity indicates that the time taken by merge sort grows logarithmically with the size of the input array. Therefore, even as the number of chocolates or students increases significantly, merge sort maintains its relatively efficient performance. Regarding the distribution of a given set of x to y using iterative and recursive functions, the complexity analysis depends on the specific implementation of each…
Although most of your programming courses have focused on writing sequential programs, using lots of parallelism is the way to faster execution. We talked about two different basic execution models that can support massively-parallel execution: MIMD and SIMD. One of the easiest ways to get some speedup by parallel processing is to simultaneously execute multiple copies of the same sequential program with different input data. For example, if you need to convert thousands of images from color to black & white, simultaneously running 32 copies of a sequential program that converts a single image at a time could easily get you nearly 32X speedup over running one copy of the program at a time to process each image. Is that type of parallel execution essentially MIMD, SIMD, or equally suited to both MIMD and SIMD? Why?
Write a C program Producer – Consumer as a classical problem of synchronizationStep 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo code for implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer thread do {…produce next item…wait(empty); wait(mutex);…add the item to buffer…signal(mutex); signal(full);} while (1);//Consumer thread do {wait(full) wait(mutex);…remove next item from buffer…signal(mutex); signal(empty);…consume the item } while (1);
Now suppose that you are given two unsorted arrays A and B, containing m and n elements respectively. You are also given a black box O(n) selection algorithm SEL that can be called on A and B separately and, in addition, a small number (say, ten) of extra memory words that can be used to store some extra data. Using SEL as a subroutine, design an O(n + m) algorithm for finding the kth smallest element in the combined set of O(m + n) elements. You may not merge the two arrays in another array and call an algorithm (either SEL or something you wrote) on this third array. This is because there is no extra memory available to build this third array.
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?
Write a program using C++ to implement the three disk-arm scheduling algorithms. Write a driver program that generates a sequence of cylinder numbers (0–999) at random, runs the three algorithms for this sequence and prints out the total distance (number of cylin-ders) the arm needs to traverse in the three algorithms. Please add comments to understand the program .
Using Java Modify the program 1 in guided activity 3 to compute the multiplication of two vectors with the sizes 1xn and nx1. The result is a number (one element matrix) computed as the sum of the products of the corresponding elements from the first vector with the ones from the second vector: m1[0][0]m2[0][0]+m1[0][1]*m2[1][0]+...+m1[0][n-1]m2[n-1][0
Case Study Assume a computer system has a main memory of 256 Bytes. The following is a memory byte-access trace history of a program run on this system. For example, as it is shown, the program first accesses memory address 0000 0000, and then it accesses memory address 0000 0001 and so on. Note the memory addresses are represented in binary: 00000000, 00000001, 00000010, 00000011, 00001000, 00010000, 00010001, 00000100, 00000101, 00000110, 00000111, 00001001, 00001010, 00001011, 00001100, 00001000, 00001001, 00001010, 00011100, 00011101. Q3. Assume the system has a 16-Byte direct mapped unified L1 cache with a block size of 2 Bytes. The following table shows how the cache looks like after the first access to the memory is finished. Please show; in the provided table, how it looks like after the 20th access is finished. You could ignore the "Data" Column. (Add or remove Rows/Columns in the provided table for your answer, as you see fit). Cache contents after the 1st access: Cache Index…
Write an efficient parallel program with dynamic task assignment that reads n integers from any input file and finds the 2nd largest (without sorting), using p processors (p << n). Assume m is the largest array size slave computers can handle due to memory limitation (m << n/p) and n is divisible by m. Note: Master has no memory limitation. Please do as follow: Name your file xxxxxH2.c, where xxxxx is at most the first 5 characters of your last name and H2 is the program number. Remember all I/O should be done ONLY by master. Your program should be modular i.e. using subprograms. Make sure to print input data. Print your name at the end of OUTPUT. To execute: mpiexec -n p a.out n m < inputfile Example: mpiexec -n 3 a.out 120 15 < inputfile
Let's say p contains a memory address and the 8 bytes in memory beginning at that address are (in hex): 01 12 23 34 45 56 67 78. If p's type is "uint32_t *", what is the value of x on a little-endian computer after executing: uint32_t x = p[0]; Ox01122334 Ox0112233445566778 Ox34231201 Ox7867564534231201 O O O O