Garbage collection mechanism for the YAFFS file system incorporates a search strategy defined by the YAFFS garbage collection algorithm, O (K) space [1]. The total number of blocks targeted for sampling to identify the dirtiest block to be erased is algorithmically achieved based on the size of the flash storage, K, though the value of K increases with increasing number of victim blocks. The running time of the algorithm is characterized by O (K) space [1] of the priority queue. The paper focuses on experimental findings based on sampling performance measures and the factors that affect the overall performance of...