Computer Architecture
I
Q 21. In set associative and associative mapping there exists less flexibility.
I
Q 22. In associative mapping during LRU, the counter of the new block is set to ‘0’ and all the others are incremented by one when occurs.
I
Q 23. The directly mapped cache no replacement algorithm is required.
I
Q 24. Highly encoded schemes that use compact codes to specify a small number of functions in each micro instruction is
I
Q 25. The signals are grouped such that mutually exclusive signals are put together.
I
Q 26. To increase the speed of memory access in pipelining, we make use of _____
I
Q 27. Each stage in pipelining should be completed within ____ cycle.
I
Q 28. The fetch and execution cycles are interleaved with the help of _____
I
Q 29. _____ has been developed specifically for pipelined systems.
I