This is the simplest of all mapping and by knowing the memory address

Comments · 225 Views

This is the simplest of all mapping and by knowing the memory address, the possible location in cache can be computed easily and a comparison with tag bits in that single location alone will tell you if a cache is hit or miss.


It is a type of memory in which the data is stored in the form of a charge.The data is stored in the capacitor.Hence, to keep the data in the memory, the device must be regularly refreshed.A computer has a memory of 256 Kilobytes.How many address bits are needed if each byte location needs to be addressed?A Program Counter is a register that holds the address of the instruction being executed currently.An Instruction Register is a register that holds the instruction that is currently getting executed.General Purpose Registers are registers that can store any transient data required by a program.The Stack Pointer Register is a special purpose register that stores the address of the most recent entry that was pushed on to stack.T he most typical use of a stack is to store the return address of a subroutine call.Explain the concept of pipelining in computer architecture?The basic instruction cycle is broken up into a series of steps called a pipeline.Pipelining increases instruction throughput by performing multiple operations at the same time, but does not reduce instruction latency, which is the time to complete a single instruction from start to finish, as it still must go through all steps.This allows the processor to work on several instructions in parallel.What are the different types of hazards in a pipelined microprocessor design?A pipeline hazard is a situation where the next instruction in a program cannot be executed for a certain reason.These hazards arise because of resource conflict that prevents overlapped execution.Another resource that can conflict is memory/cache access.These hazards arise when an instruction depends on the result of a previous instruction in a way exposed by the pipeline overlapped execution.These hazards arise because of branch and jump instructions that changes the sequence of program execution.A pipelined machine has 10 stages as shown below.Each stage takes 1 ns to process a data element.Assuming there are no hazards, calculate the time taken to process 100 data elements by the machine.Each stage of pipeline takes 1ns to process a data element.In this mode, the address of the operand is directly specified in the instruction.Locality of reference is a principle that defines if a memory location is accessed by a program, how frequently will the same memory location or nearby storage locations be accessed again.If at one point in time a particular memory location is referenced, then it is likely that the same location will be referenced again in the near future.If a particular memory location is referenced at a particular time, then it is likely that nearby memory locations will be referenced in the near future.What are different kinds of memories in a system?Cache is a small amount of fast memory.Give an overview of Cache Operation.What’s the principle behind functioning of cache?Cache includes tags to identify which block of main memory is in each cache slot.What is a cache miss or hit condition?When an address is looked up in the cache and if the cache contains that memory location, it is knows as a cache hit.When the address looked up in the cache is not found, then it is known as a cache miss condition.Will there be a difference in the performance of a program which searches a value in a linked list vs a vector on a machine that has cache memory present?Because of this, searching through a vector will be faster than searching through a linked list on a machine which has cache memory.


Comments