Consider a fully-associative cache of size 4. Each slot in the cache can have just one item (i.e. the line size is 1 item). The cache is empty to start with.The cache uses an LRU replacement policy: every slot has a counter; every time a slot is accessed, a global counter is incremented and the value is stored in the slot counter; the slot withthe lowest counter value is chosen for replacement.SequenceId1234567810Address Ox0012 0x0014 Ox0016 Ox0018 0x0016 0x0012 0x0020 Ox0022 0x0014 Ox0012Hit/MissAccesses 1 to 10 are respectively: Select one:O a. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Miss, MissO b. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Hit, HitO. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Hit, MissO d. Miss, Miss, Miss, Miss, Hit, Miss, Miss, Miss, Miss, HitO e. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Miss, Hit

Consider a fully-associative cache of size 4. Each slot in the cache can have just one item (i.e. the line size is 1 item). The cache is empty to start with. The cache uses an LRU replacement policy: every slot has a counter; every time a slot is accessed, a global counter is incremented and the value is stored in the slot counter; th the lowest counter value is chosen for replacement. Sequence Id 1 4 5 7 8 9. Address Ox0012 0x0014 Ox0016 0x0018 0x0016 0x0012 0x0020 0x0022 0x0014 Ox0 Hit/Miss Accesses 1 to 10 are respectively: Select one: O a. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Miss, Miss O b. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Hit, Hit O. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Hit, Miss O d. Miss, Miss, Miss, Miss, Hit, Miss, Miss, Miss, Miss, Hit Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Miss, Hit

Consider a fully-associative cache of size 4. Each slot in the cache can have just one item (i.e. the line size is 1 item). The cache is empty to start with. The cache uses an LRU replacement policy: every slot has a counter; every time a slot is accessed, a global counter is incremented and the value is stored in the slot counter; th the lowest counter value is chosen for replacement. Sequence Id 1 4 5 7 8 9. Address Ox0012 0x0014 Ox0016 0x0018 0x0016 0x0012 0x0020 0x0022 0x0014 Ox0 Hit/Miss Accesses 1 to 10 are respectively: Select one: O a. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Miss, Miss O b. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Hit, Hit O. Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Hit, Miss O d. Miss, Miss, Miss, Miss, Hit, Miss, Miss, Miss, Miss, Hit Miss, Miss, Miss, Miss, Hit, Hit, Miss, Miss, Miss, Hit

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

In a system with fixed partitions, there are 4 partitions available to jobs. Their sizes are 16, 32, 48, and 64 KB. Four jobs executed by the system at the moment have the following sizes: 12, 22, 42, and 55 KB. The amount of internal fragmentation expressed in KB is: نه نه نه نن فم a. b. C. d. e. f. g. h. 0 12 17 25 29 34 41 56
Operating sys :In the following producer and consumer problem using semaphores, explain with an example (semaphore values), how a producer sends a signal to a consumer, so that the consumer does not have to check the buffer all the time. /*program, Producer/Consumer */ semaphore n = 0; /* no of items in the buffer */ semaphore s = 1; /* ME semaphore */ void Producer () { while(TRUE) { produce(); wait(s); append(); signal(s); signal(n); } } void Consumer () { while(TRUE) { wait(n); wait(s); take(); signal(s); consume(); } }
Do
Which of the following statements best describes this code that is attempting to print the value of a disk block. Note that syntax of queue has changed slightly from the assignment to simplify it. void interrupt_service_routine(){ int* result; void (*callback) (int*); queue_dequeue(&result, &callback); callback(result); void printInt(int* i){ printf("%d\n", *i); free(i); void read (int blockno){ malloc(sizeof(int)); queue_enqueue(result, printInt); disk_read(result, blockno); int* result It has an error : it might print before the read has completed. X O It makes incorrect use of function pointers. O It has a dangling pointer bug. OIt has an error: it never calls interrupt_service_routine. It has a memory leak bug. OIt is correct. X 0%
A message slot is a cache line that contains status flags and the message itself. The state can be empty or ready, and communication occurs through a single cache line. Both the sender and the receiver write the message to the cache line. The receiver updates the state from empty to ready, then polls the cache line in a loop waiting for the sender to send a message. The sender waits in a tight loop until the receiver acknowledges the cache line, changes the state from ready to empty, and acknowledges receipt. Explain that the system uses a snooping cache coherence protocol and describe the cache-coherence transaction taking place on the coherence bus when a message transfer occurs.
Quiz-1: Refer to Lecture-3 Module 1 swap (int* V, int k) { temp = V[k]; /* temp in $t0 */ V[k] = V[k+1]; V[k+1] = temp; } Write the swap() function using special registers required for accessing parameters passed to this function. Use “t” registers for any needed temporary registers.
Exercise: A computer has 4 frames. Page size is 2KB (2048). The loaded time, the R and M bits for each page are shown below Page Frame Loaded time M R 11 1 15 3 13 4 5 5 7 6. 3 3 Question: compute the physical address of the following virtual address a) 1000 using FIFO b) 3100 using NRU c) 3100 using LRU d) 6200 using Second chance Note: consider each case separately
What registers does _GetDate use?
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:
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);
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.
Student information is stored in a data area, and each student entry is formatted as follows:The first nine bytes are the student ID in ASCII format.The following byte is the course score.The following phrase is the section identifier. There are over 300 such student records in memory, which have been loaded consecutively beginning at address $10000. To indicate the conclusion of the records, the last record loaded is a dummy record with a section identifier of $FFFF. Create an assembler subroutine GetMax that searches the complete list for the highest mark. If there is a tie, the student with the highest score on the list should be found. The beginning address of the subroutine should be returned.