Consider a TLB with 3 entries that uses an LRU (least recently used) algorithm. Assume the following sequence of virtual page number accesses: Virtual page 9, then Virtual page 7, then Virtual page 9, then Virtual page 5, then Virtual page 3, then Virtual page 7, then Virtual page 5, then Virtual page 3, then Virtual page 3, then Virtual page 2 What was the TLB hit rate (as a percentage)? the 2 ends up in slot (0-2)??

Consider a TLB with 3 entries that uses an LRU (least recently used) algorithm. Assume the following sequence of virtual page number accesses: Virtual page 9, then Virtual page 7, then Virtual page 9, then Virtual page 5, then Virtual page 3, then Virtual page 7, then Virtual page 5, then Virtual page 3, then Virtual page 3, then Virtual page 2 What was the TLB hit rate (as a percentage)? the 2 ends up in slot (0-2)??

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

2. Implement the frame replacement algorithm for virtual memory In Java For this task, you need to perform the simulation of page replacement algorithms. Create a Java program which allows the user to specify: • the total of frames currently exist in memory (F), the total of page requests (N) to be processed, • the list or sequence of N page requests involved, For example, if N is 10, user must input a list of 10 values (ranging between 0 to TP-1) as the request sequence. Optionally you may also get additional input, the total of pages (TP) This input is optional for your program/work. It only be used to verify that each of the page number given in the request list is valid or invalid. Valid page number should be within the range 0, .. , TP-1. Page number outside the range is invalid. Then use the input data to calculate the number of page faults produced by each of the following page replacement algorithms: • First-in-first-out (FIFO) - the candidate that is the first one that entered…
8.5. A process references five pages, A, B, C, D, and E, in the following order: A; B; C; D; A; B; E; A; B; C; D; E Assume that the replacement algorithm is first-in-first-out and find the number of page transfers during this sequence of references starting with an empty main mem- ory with three page frames. Repeat for four page frames.
A common implementation of sequential files on disk has each block point to its successor, which may be any block on the disk. This method requires a constant amount of time to write a block (as the file is originally written), to read the first block in the file, and to read the ith block, once you have read the 1 - 1” block. Reading the lth block therefore requires time proportional to 1. Show how by adding just one additional pointer per node, you can keep all the other properties, but allow the lth block to be read in time proportional to log I. [Hint: heaps have implicit pointers from node I to what other nodes?] Explain what the algorithm for reading the th block has in common with an algorithm for raising a number to the ith power in time proportional to log 1.
Write a program that implements the FIFO and LRU page-replacement algorithms presented in this chapter. First, generate a random page reference string to each algorithm, and record the number of page faults incurred by each algorithm. Implement the replacement algorithms so that the number of page frames can vary from 1 to 7. Assume that demand paging is used.
* Problem 2: create an HTML <iframe> element for the given url. * * An iframe hosts one web page within another. Here is how we might use HTML * to use an iframe: * * <iframe src="https://web222.ca" height="500"></iframe> * * Our <iframe> has two attributes: * * - src: the URL to a web page * - height: the height to use (in pixels) when showing the iframe * * Write the createIframe() function to accept a URL and height, and return the * properly formatted iframe tag. For example: * * createIframe('https://web222.ca', 500); * * should return the following string of HTML: * * '<iframe src="https://web222.ca" height="500"></iframe>' * * A <iframe> can also optionally contain an `allowfullscreen` attribute, * which tells the browser that it's OK for the iframe to expand to fill * the whole screen
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifier There are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records. If a2 has the address of a student record, what is the location of the next record in the array / data area:
06. Assume that you have built a dense primary B+ tree index on a heap file containing 20,000 records. The key field for this B+ tree index is a 40 byte string and it is a candidate key. Pointers (i.e. record ids and page ids) are (at most) 10 byte values. The size of one disk page is 1,000 bytes . The index was built in a bottom-up fashion using the bulk-loading algorithm, and the nodes were filled up as much as possible. Then there are number levels in the tree.
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifier There are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records. If a2 has the address of a student record, if using indexed addressing mode, what is the index value X such that X(a2) addresses the course mark?
Implement the page replacement algorithm a) LIFO B) FIFO Reference string = 9 1 0 4 0 2 0 8 2 3 1 3 1 2 9 4 7 8 9 12 Calculate page fault ratio. Calculate page hit ratio Please show all step how to do provide correct solution.
A file has r=30,000 EMPLOYEE records of fixed-length. Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long and a record pointer is P R =7 bytes long. Each record has the following fields: NAME (30 bytes), SSN (9 bytes), DEPARTMENTCODE (9 bytes), ADDRESS (40 bytes), PHONE (9 bytes), BIRTHDATE (8 bytes), SEX (1 byte), JOBCODE (4 bytes), SALARY (4 bytes, real number). An additional byte is used as a deletion marker. a) Calculate the record size R in bytes. b) Calculate the blocking factor bfr and the number of file blocks b assuming an unspanned organization. c) Suppose the file is ordered by the key field SSN and we want to construct a primary index on SSN. Calculate the index blocking factor bfr i.
PROVIDE THE SOURCE CODE FOR LINUX C WITH OUTPUT Write a program to implement page replacement technique. Consider a reference string: 4, 7, 6, 1, 7, 6, 1, 2, 7, 2. the number of frames in the memory is 3. Find out the number of page faults respective to: a. Optimal Page Replacement Algorithm b. FIFO Page Replacement Algorithm c. LRU Page Replacement Algorithm
For the scramble.c problem, write a program that: • Has a main () function and another function that has this prototype: void scramble str (char s[]); • The scramble_str() function scrambles the contents of the string in a random way so that the string has the same length as before, but the contents are all mixed around. It does this in-place, i.e., there is only one buffer that holds a string. You're free to scramble it any way you want to, but use rand () repeatedly so it gets really scrambled. • The main () function will read a string entered by the user into the buffer, call scramble_str(), and output the resulting string. This will be done in a loop forever, until the entered string is the string "bye". When the user says "bye", the program will exit with a polite message. Do note that reading a string using scanf (), which is the only tool I've introduced you to so far, will just read up to the first whitespace. So, multiple-word strings won't work! Let's use something that will…