Bissoy.com
Doctors Medicines MCQs Q&A

Consider the following statements: 1. Better memory utilization is possible with non-contiguous allocation using fixed size pages 2. Associative memory is used for providing fast access to data stored in cache memory. 3. Direct mapping of cache memory is hard to implement Which of the above statements are correct?

Consider the following statements: 1. Better memory utilization is possible with non-contiguous allocation using fixed size pages 2. Associative memory is used for providing fast access to data stored in cache memory. 3. Direct mapping of cache memory is hard to implement Which of the above statements are correct? Correct Answer 1 and 2 only

Non-contiguous memory allocation:

  • In this allocation, the available free memory space is scattered here and there, and all the free memory space is not at one place.
  • A process will acquire the memory space, but it is not at one place it is at the different locations according to the process requirement.
  • This technique of non-contiguous memory allocation reduces the wastage of memory which leads to internal and external fragmentation.
  • This utilizes all the free memory space which is created by a different process and hence better memory utilization is possible.

 

Associative memory is used to store the address of the data stored in the cache. So, it provides fast access of data stored in cache memory.

A direct-mapped cache is the simplest approach, each main memory address maps to exactly one cache block.

Related Questions

Assume a memory access to main memory on a cache "miss" takes 30 ns and a memory access to the cache (on a cache "hit") takes 3 ns. If 80% of the processor's memory requests results in a cache "hit", what is the average memory access time?
Consider a computer with 8 Mbytes of main memory and a 128K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block?
Which of the following statements are CORRECT? 1) Static allocation of all data areas by a compiler makes it impossible to implement recursion. 2) Automatic garbage collection is essential to implement recursion 3) Dynamic allocation of activation records is essential to implement recursion 4) Both heap and stack are essential to implement recursion
Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers. double sum (double A [64] [64] ) { int i, j ; double sum = 0 ; for (i = 0 ; i < 64; i++) for (j = 0; j < 64; j++) sum += A [i] [j] ; return sum ; } Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?
If a Xerox machine can print 2 pages in a second. A bundle of A4 size pages has 64 pages. A Xerox machine owner wants to print 3, A4 size bundle of pages. The Xerox machine takes how much time to print these pages?
Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.
If the main memory is of 8K bytes and the cache memory is of 2K words. It uses associative mapping. Then each word of cache memory shall be __________
Consider a machine with a byte addressable main memory of 220 bytes, block size of 16 bytes and a direct mapped cache having 212 cache lines. Let the addresses of two consecutive bytes in main memory be (E201F)16 and (E2020)16. What are the tag and cache line address (in hex) for main memory address (E201F)16?
A book has 250 pages. Person A reads 6 pages in an hour. Person B reads 8 pages in an hour. There are two chapters of 72 pages that are difficult for person B to read in the book, so person B takes double the time to read those pages. Who among them will finish the book first and how much sooner than the other?
Working together R and S have to type a book containing 200 pages. R takes 8 hrs to type 64 pages and S takes 10 hrs to type 40 pages. R typed first 80 pages alone and the last 120 pages were typed by R and S together. How much time will be taken to type the complete book?