Open AccessHybrid LRU Algorithm for Enterprise Data Hub
Author(s) -
Shankar Ganesan,
A. Murugan
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.l3489.119119
Subject(s) - computer science , cache , cache algorithms , leverage (statistics) , key (lock) , distributed computing , database , parallel computing , cpu cache , operating system , machine learning
In the computing theory, cache is key concept to process the in memory data from slow storage layer into faster. Key objective is to speed up the end user requests from cache storage. As cache is limited in size, it is essential to build the efficient algorithm to replace the existing unused content from faster memory. Enterprise Data Hub makes a single golden storage to produce any kind of reports at any point of time from the various sources of any system. Data integrity and governance parameters add the credibility to this centralized data. In general, Big Data processing uses the disk based technique to handles the business logic processing. This research paper is to leverage the in memory processing for the business use case of Enterprise Data Hub. This paper provides an algorithm to handle Enterprise Data Hub in efficient design using prioritized Least Recently Used algorithm. This paper depicts about the experimental advantage of execution time optimization and efficient page/cache hit ratio, using hybrid Least Recently Used algorithm with priority mechanism. It helps the industry Enterprise Data Hub for the faster execution model.