Adaptive Block Memory Management for Spatial and Temporal Locality in Flash Based Storage Systems
S M Shamsheer Daula1, G. Amjad Khan2, K E Sreenivasa Murthy3, D R Srinivas4
1Dr. S. M. Shamsheer Daula, Associate Professor, G Pulla Reddy Engineering College, Kurnool (Andhra Pradesh), India.
2G. Amjad Khan, Assistant Professor, Department of ECE, G Pulla Reddy Engineering College, Kurnool (Andhra Pradesh), India.
3Dr. K E Sreenivasa Murthy, Professor and HOD, Department of ECE, G Pullaiah College of Engineering and Technology (GPCET), Kurnool (Andhra Pradesh), India.
4Dr. D R Srinivas, Associate Professor, Department of ECE, G Pulla Reddy Engineering College, Kurnool (Andhra Pradesh), India.
Manuscript received on 25 April 2019 | Revised Manuscript received on 07 May 2019 | Manuscript Published on 17 May 2019 | PP: 324-326 | Volume-7 Issue-6S4 April 2019 | Retrieval Number: F10610476S419/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The shifting of cold clean pages and hot dirty pages along with the inner sets of the cold dirty and the hot clean pages is emphasized in the adaptive predictive clean least recently used technique, but it fails in exploring more on the spatial contents rather than sticking more in the temporal locality maintenance. In that, the concepts of hot page, clean, cold and dirty page management is presented with an efficient kind whose benefits are utilized in the global adaptive algorithm also in both spatial locality and temporal locality management. The role of the three issues in erase, read, write and their interlinks with page transaction from the data buffer cache to the flash translation layer, which is shown in virtual presentation but proves its essence in more nearest way in address mapping, and with the flash storage is implemented using a flash sim simulator version from the very first block padding lru clean first lru or may it be the cold clean first technique. The clear point of growth in each of the sequenced algorithms is simulated at suitable memory sizes showing the prior to latter enhanced may it be in the cluster management or may it be the creation of necessary list like hot list or cold list or key data list. The suggestive solutions have been proved with acceptable solutions and also laid away some more improvable steps to still reduce the speed gaps in the symmetry of the two major issues. The techniques are near to precise in lowering and minimizing the number of times of addressing during the cache handling to efficiency with respect to reducing the erases.
Keywords: APCLRU, WBLRU, GASST Clock Selection, FTL,TLB, NAND Flash Memory, Control Block, Advanced Processors.
Scope of the Article: Adaptive Systems