. Q: In this problem you are to compare reading a file using a single-threaded file server and a multithreaded server. It takes 15 msec to get a request for work, dispatch it, and do the rest of the necessary processing, assuming that the data needed are in a cache in main memory. If a disk operation is needed, as is the case one-third of the time, an additional 75 msec is required, during which time the thread sleeps. How many requests/sec can the server handle if it is single threaded? If it is multithreaded?

. Q: In this problem you are to compare reading a file using a single-threaded file server and a multithreaded server. It takes 15 msec to get a request for work, dispatch it, and do the rest of the necessary processing, assuming that the data needed are in a cache in main memory. If a disk operation is needed, as is the case one-third of the time, an additional 75 msec is required, during which time the thread sleeps. How many requests/sec can the server handle if it is single threaded? If it is multithreaded?

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

Computer Science You are given a cache that has 16 byte blocks, 512 sets, and is 2-way set associative. Integers are 4 bytes. Give the C code for a loop that has a 100% miss rate in this cache but whose hit rate rises to almost 100% if you double the size of the cache. Do not assume the starting indexes of any arraysarrays.
Main memory size is 16 pages. Size of swap file on hard disk is 64 pages. Operating system locks down pages 0, 1, 2 and 7 in the main memory. Two programs are started and both are provided with a virtual address space of 10 pages. Initially operating system allocates 5 pages of main memory for each program and the rest from swap file. Virtual address space of each program starts from page 0. Construct page tables for both programs at program startup. A page table consists of P-bit which tells if the page is present in the main memory (1 = page is in main memory) and address of the page. Address tells either real address in main memory or the address of the page in swap file. b. A computer with a paged virtual memory system executes two load instructions that are adjacent to each other in memory. Describe the worst case scenario (in terms of performance) that can occur during the execution of the two instructions and explain under which conditions this case occurs. How does this affect…
2. Implement concurrent processing using multithreading Create a Java program which calculates the factorial for 5 numbers (values ranging from 1 to 10) specified by user. E.g. Enter 5 numbers [1-10]: 10 3 67 4 The factorials for 10 3 6 7 4 are 3628800 6 720 5040 24 You must use multithreading to perform the processing, by creating a thread to calculate the factorial for each number given. The threads may store all the results into a single array. Then print out the results after all results has been calculated and stored inside the array (You may also use other data structure other than array if it is more suitable).
Suppose we have a system with 50 active processes, P0, P1, ..., P49, some user processes, and some kernel processes. For simplicity, we are not concerned with threads in this question. Ready processes are scheduled to Run by some scheduler. The scheduling algorithm does not matter here. Suppose process P13 makes a disk_read() operating system call. Assume that the completion of disk transfer is signalled by an interrupt from the disk controller. Trace as accurately as you can what happens in the CPU (not the disk) until process P13 has received its requested information from the disk. Hints: The question is about interrupt handling I am looking for a trace of what processes run, why, and what they do. I am not looking for instruction-level explanations. I am not looking for a discussion of disk access, operation, or transfer.
Computer Science 17. Tree-structured directory design does not allow us to create links for a file or folder. Group of answer choices True/False 18. With the same amount of total data access, processes with larger working sets tend to run faster. True/False 19. A cache miss means that the requested data is not stored in the cache and must be fetched from the hard drive before the program can proceed.
cache.xls (or it can be a google sheet that you share with me in a cache.txt with the url in it )= a spreadsheet showing the cycle counts of a cached and non-cached machine. Also, you need to show the cache as the memory accesses progress in your program marking the hits and misses (misses in RED). You should have cells to show how many hits and how many misses your program has, and details on what is the cache replacement policy you implemented. Here is code: void c_cache_for_badge() { int na = 8, nb = -3, nc = 10; // pointers int *npa; npa = (int*)malloc(sizeof(int)*84); // init integer pointers for(int i = 0; i < 84; i++) { npa[i] = i; } // integer pointers for(int i = 9; i < 70; i= i + 3) { nb += npa[i % 5] + npa[i % 3] + npa[i % 6]; } } void main() { c_cache_for_badge(); }
me remaining: 00:09:34 Computer Science Create a MPI version of the program below that uses a striped decomposition. Each process is responsible for some number of columns of the square and also maintains two columns of ghost cells to mirror the columns on the neighboring processes. The ghost cells are needed in order to update the cells along the process boundary. At each time step, a ghost cell exchange takes place, then the update takes place. #include <stdlib.h> #include <assert.h> #include "anim.h" const int n = 200; // number of discrete points including endpoints int nstep = 200000; // number of time steps int wstep = 400; // time between writes to file const double m = 100.0; // initial temperature of rod interior const int h0 = n/2 - 2, h1 = n/2 + 2; // endpoints of heat source const double k = 0.2; // diffusivity constant char * filename = "diff2d.anim"; // name of file to create double ** u, ** u_new; // two copies of the temperature function ANIM_File…
CSC 472 Introduction to Database Systems Project Consider the CLOCK page replacement policy. Assume that there are only 3 page slots available in the buffer pool. If a page reference sequence is: 0, 4, 1, 4, 2, 4, 3, 4 (in order from left to right). What happens when the second 4 (i.e., the 4 underlined with blue color) is referenced? Group of answer choices Its reference bit is set to 1. Its reference bit is set to 0. It is evicted. Nothing changes.
Create a "least recently used" cache that evicts the least recently used item. The cache should be configured with a max size and should map from keys to values (enabling you to enter and retrieve a value associated with a certain key). When it is full, it should evict the item that has been utilised the least recently. Assume that the keys are integers and the values are strings.
Main Memory (MM) and Central Processing Unit are important resources of the computer system that must be carefully managed. The part of Operating System (OS) that manages the memory is called Memory Manager. 'Partition' is a memory management scheme, which allocates processes in MM into a unique fixed-size partition; each partition contains exactly one process. When a partition is free, the OS selects a process from the input queue and loads it into the free partition; when the process terminates, the partition becomes available; a free partition is called 'hole'. Please, reply to the following questions by giving your own ORIGINAL and UNIQUE answers: a) Draw a picture of the Main Memory (MM) divided into A 'assigned partitions' and B 'holes': fix your values for A and B1, and draw the corresponding MM layout. In the following, Pi, Pj and Pk are three processes residing in MM b) Considering the 7 states diagram, answer to the following questions: 1) Can Pi be in the 'New' state? Why?…
. Q: In this problem you are to compare reading a file using a single-threaded file server and a multithreaded server. It takes 15 msec to get a request for work, dispatch it, and do the rest of the necessary processing, assuming that the data needed are in a cache in main memory. If a disk operation is needed, as is the case one-third of the time, an additional 75 msec is required, during which time the thread sleeps. How many requests/sec can the server handle if it is single threaded? If it is multithreaded?
Computer Science In a data center, Nodes NO...N9 in Rack 1 Nodes N10...N19 in Rack 2 Total nodes N = 20 Student(ld, name, DOB, street, city, district) The tuples are: TO, T1, T2, T3 ....T399 ... ... Id ranges from 202105001 to 202105400 Question 3-1 a.Design a partition vector on Id for storage of student relation b.Find partitions PO, P1, P19