Here are the comments taken from the above of the function, 
HeapKeyGen_StoreEntry_LFUDA. 
/////////////////////////////////////////////////// 
but with aging to handle turnover of the popular document set
///////////////////////////////////////////////////
Here are the codes taken from the same function, 
///////////////////////////////////////////////////
 key = age + (double) e->refcount - tie;
///////////////////////////////////////////////////
I think age means how long the object has been in cache. 
And if an object has a minimal key value then the 
object will be purged out from cache. Am I correct? 
The comment says that the purpose of LFUDA algorithm is to 
let the hot objects has less ability to stay in cache. Am 
I correct? 
But the (popular, I think "popular" here is the same as "hot") 
hot object will have a greater age value. So, the hot 
objects will have greated key value. And then the popular object 
will stay in cache without being purged out. So, I think it conflicts 
with the aim of the algorithm, which is " turnover of the popular 
document set". 
Am I correct? 
Best regards,
George Ma
Received on Tue May 28 2002 - 07:20:35 MDT
This archive was generated by hypermail pre-2.1.9 : Tue Dec 09 2003 - 16:15:31 MST