Keywords : Cache Algorithm
European Journal of Molecular & Clinical Medicine,
2021, Volume 8, Issue 2, Pages 986-996
In general computing theory, Array is one of the data structures to hold a group of same data type elements. Static array holds the underlying elements in an initial allocated memory space. In contrast, dynamic array grows the memory allocation automatically and dynamically based on the insertion request volume. Our research work is to leverage dynamic memory overlay array mechanism in Enterprise Data Hub. It is continuation of our earlier work on Hybrid LRU Algorithm, which depicts about the experimental advantage of execution time optimization and efficient page/cache hit ratio, using hybrid Least Recently Used algorithm with priority mechanism. With the ability to change the allocated space dynamically using memory overlay concept, Dynamic array improves the storage scalability and faster execution.