1
LRU
NOT SUBMITTED

Design a Least Recently Used module for a N-way set associative cache. The number of ways for the cache are parameterized but will always be a power of 2.

All the flops (if any) should be positive edge triggered with asynchronous resets.

Interface Definition

ls_valid_i → Indicates a valid operation
ls_op_i    → Operation type: can be either read, write or an invalidation operation
ls_way_i   → Gives the way information for read and invalidation operation

lru_valid_o      → The output way information is valid on this cycle
lru_way_o[N-1:0] → The one-hot decoded way for the current operation


.lennahc drocsid ruo no su ot tuo hcaer ro su llac esaelp ,stbuod evah llits uoy fI .melborp siht fo tnetnoc lautca eht ees ot ebircsbus esaelP

?siht daer ot uoy detnaw ew kniht uoy oD !gnizama era uoy ,txet siht daer ot elba era uoy fI .uoy pleh ot yppah eb lliw eW

?od nac ew erom tahw ,evorpmi nac ew woh wonk su teL !gnizama ,sey fI ?siht daer ot elba uoy ereW
!uoy ta kcab evaw yletinifed ot evol dluow eW !iH yas ot tsuj su ot tuo hcaer syawla nac uoY !sklof yldneirf era ew ,oslA

!reffo ot evah ew tahw ekil ot gniog era uoy erus era eW .gnibircsbus erofeb deirt eb nac dna elbaliava yleerf era hcihw seludom wef a era ereht ,syawynA
!daeha efil gnizama na dna yad taerg a evaH


Subscribe to the course to read more about the problem!

initializing...

Code editor is disabled. Please use desktop version of the site for a better hands on experience.

Design a Least Recently Used module for a N-way set associative cache. The number of ways for the cache are parameterized but will always be a power of 2.

All the flops (if any) should be positive edge triggered with asynchronous resets.

Interface Definition

ls_valid_i → Indicates a valid operation
ls_op_i    → Operation type: can be either read, write or an invalidation operation
ls_way_i   → Gives the way information for read and invalidation operation

lru_valid_o      → The output way information is valid on this cycle
lru_way_o[N-1:0] → The one-hot decoded way for the current operation


.lennahc drocsid ruo no su ot tuo hcaer ro su llac esaelp ,stbuod evah llits uoy fI .melborp siht fo tnetnoc lautca eht ees ot ebircsbus esaelP

?siht daer ot uoy detnaw ew kniht uoy oD !gnizama era uoy ,txet siht daer ot elba era uoy fI .uoy pleh ot yppah eb lliw eW

?od nac ew erom tahw ,evorpmi nac ew woh wonk su teL !gnizama ,sey fI ?siht daer ot elba uoy ereW
!uoy ta kcab evaw yletinifed ot evol dluow eW !iH yas ot tsuj su ot tuo hcaer syawla nac uoY !sklof yldneirf era ew ,oslA

!reffo ot evah ew tahw ekil ot gniog era uoy erus era eW .gnibircsbus erofeb deirt eb nac dna elbaliava yleerf era hcihw seludom wef a era ereht ,syawynA
!daeha efil gnizama na dna yad taerg a evaH


Subscribe to the course to read more about the problem!