Hi all! A disk is divided into large number of blocks and each of them is identified by a logical block address (LBA). An Operating System will access LBAs randomly. Frequent and recently accessed LBAs are considered as Hot LBAs. I need a data structure and an algorithm that take an LBA as input and says whether this LBA is hot or not. A hot LBA is accessed more than (or equal to) N times in the past M hours. A small proportion, say 3% of false identification in identifying Non Hot LBA as Hot is allowed. However, identifying Hot as Non Hot LBA is not allowed. I have found a solution which uses Hash table with multiple hash functions: http://www.cis.nctu.edu.tw/~lpchang/papers/EMBS05_006.pdf Please let me know if there any other solutions exist that best suits to this problem.
Thank you. Regards, Prashanth -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
