For the first part, you are going to write six functions. • unsigned int getL1SetID(u_int32_t address) returns the setID assocated with the input address for L1 cache. unsigned int getL1Tag(u_int32_t address) returns the tag assocated with the input ad- dress for L1 cache. • unsigned int getL2SetID(u_int32_t address) returns the setID assocated with the input address for L2 cache. • unsigned int getL2Tag (u_int32_t address) returns the tag assocated with the input ad- dress for L2 cache. • int Llaccess (u_int32_t address, int type, u_int32_t data) performs a L1 cache ac- cess. This function returns 1 if the input address is in the cache and 0 otherwise. Please note that this function UPDATE the cache content if we are writing to the cache. • int L2access (u_int32_t address, int type, u_int32_t data) performs a L2 cache ac- cess. This function returns 1 if the input address is in the cache and 0 otherwise. Please note that this function UPDATE the cache content if we are writing to the cache.

For the first part, you are going to write six functions. • unsigned int getL1SetID(u_int32_t address) returns the setID assocated with the input address for L1 cache. unsigned int getL1Tag(u_int32_t address) returns the tag assocated with the input ad- dress for L1 cache. • unsigned int getL2SetID(u_int32_t address) returns the setID assocated with the input address for L2 cache. • unsigned int getL2Tag (u_int32_t address) returns the tag assocated with the input ad- dress for L2 cache. • int Llaccess (u_int32_t address, int type, u_int32_t data) performs a L1 cache ac- cess. This function returns 1 if the input address is in the cache and 0 otherwise. Please note that this function UPDATE the cache content if we are writing to the cache. • int L2access (u_int32_t address, int type, u_int32_t data) performs a L2 cache ac- cess. This function returns 1 if the input address is in the cache and 0 otherwise. Please note that this function UPDATE the cache content if we are writing to the cache.

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

SAME PARAMETERS: In the RENTALS table shown in fig 2, 40 customers have created 50 rental contracts over time. A RENTALS record is 122 bytes and the block size for your OS is set to 1024 bytes with each block having a 1 byte pointer to the next written block as well as a 1 byte pointer to the next physically consecutive block. Assuming spanned organization, how many blocks do you estimate the RENTALS file is using at its current size? multiple choice a.50 b.6 c.400 d.7
When implementing a dynamic memory allocator based on implicit free lists, which of the following block placement policies often results in the highest amount of fragmentation? O First Fit O Perfect Fit OBest Fit ONext Fit
implement greatestBitPos function Compute a mask marking the most significant 1 bit. you are only allowed to use the following eight operators: ! ~ & ^ | + << >> “Max ops” field gives the maximum number of operators you are allowed to use to implement each function /* * greatestBitPos - return a mask that marks the position of the* most significant 1 bit. If x == 0, return 0* Example: greatestBitPos(96) = 0x40* Legal ops: ! ~ & ^ | + << >>* Max ops: 70* Rating: 4 */int greatestBitPos(int x) {return 2;}
Using C Language In this function, b has the address of a memory buffer that is num_bytes long. The function should repeatedly copy the 16 byte pattern that pattern16 points at into the memory buffer until num_bytes have been written. If num_bytes is not a multple of 16, the final write of the 16 byte pattern should be truncated to finish filling the buffer. void memset16(void *b, int num_bytes, void *pattern16) For example if the 16 bytes that pattern16 points at is 00 11 22 33 44 55 66 77 88 99 aa bb cc dd ee ff, then memset(b, 20, pattern16) should write to the buffer pointed at by p the 20 bytes 00 11 22 33 44 55 66 77 88 99 aa bb cc dd ee ff 00 11 22 33. Use SSE instructions to improve efficiency. Here's pseudocode. x = SSE unaligned load from pattern16while (num_bytes >= 16) SSE unaligned store x to p advance p by 16 bytes decrement num_bytes by 16while (num_bytes > 0) store 1 byte from pattern16 to p advance p by 1 byte advance pattern16 by 1 byte…
How many hexadecimal digits are used when representing a nibble in hex form? 0 1 O 3 O 2 O O Patti the Programmer decides to create a function with three int16 parameters, sending all three by-reference. Will she need to pad her functions activation record to make it 32-bit aligned? O The answer will depend on how many registers get preserved on the stack O Yes O No O The answer will depend on the value of the passed parameters How many bits of stack memory are used when passing an int16 variable by-value to a function? O 32 O 64 O 16 O 8
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.
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 function in python : def find_avg ( dataframe, column): takes 2 input. one is a data frame(dataframe) and (column): the name of a numeric-valued col in the DataFrame. this function returns a dataframe with average of the column for each row
switch (c) { case 1: a = 10; break; case 2: a = 20; break; case 3: a = 30; break; default: a = 0; } Translate this piece of C codes into ILOC codes. Variable c and a should be stored in the activation record. Your translated codes start at address 1000 and grow to larger addresses. The address of a variable in the activation record is r_arp[@name], where r_arp is the register storing the activation record address and @name is the macro for the offset of the variable name. You may use labels instead of address number in jump/branch instructions.
A developer has written an AWS Lambda function. The function is CPU-bound. The developer wants to ensure that the function returns responses quickly. How can the developer improve the function's performance? O A. Increase the function's CPU core count. OB. Increase the function's memory. OC. Increase the function's reserved concurrency. OD. Increase the function's timeout.
3. I/O Management: Disk Arm Scheduling & RAIDa. It is known that a disk drive has 256 cylinders, with cylinder numbers starting from 0 and ending at 255. The position of the needle on the disk drive currently stops at 128. It is also known that the needle always “goes to the cylinder with the smaller number first”. The order of the positions visited sequentially is: 254, 64, 32, 100, 50, 70. From the 3 choices of algorithms below, which one is the best algorithm? Make each image and determine the seektime.i. SCANii. C-SCANiii. FIFO
Complete the following sequence of three MIPS instructions: mul28: $t0, 28 mul $to ir by dragging four items from the below list into the correct spaces. Your code should implement a procedure, using the standard conventions covered in class for passing parameters and returning results, that returns the product of its argument and 28. $ra li sb $a0 $v0 Ib move lui Give a sequence of two MIPS instructions that branches to the target address represented by the name "loop" if and only if the contents of $$0 are less than or equal to the contents of $s1. Do this by dragging two items from the below list into the correct spaces. slt $at, $s1, $s0 bne $at, $zero, loop bltz $at, loop slt $at, $s0, $s1 beq $at, $zero, loop