A novel method of dynamic permanent caching with resourceful built up and imperative access
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 4
Abstract
Caching is built up each time when the machine starts up according to user’s application usability. This built up rocedure escalates the efficiency of application’s usage for the next coming access of same application. This cache history is vanished when power is switched off. Most of the time, a user uses the same common applications in his/her daily routine, articularly during the working hours. Moreover, against every ew start up, the user bears the penalty of cache rebuilt to achieve better and efficient access because on first time access, the application is opened without caching which results more time to open rather than the second time after the cache has already built up. This paper proposes a novel idea of intelligent and permanent caching which can build up dynamically and can be stored permanently in one part of cache chip according to user’s application usability. This paper describes an algorithm that how CPU can build a dynamic and intelligent Electrically Editable Permanent Cache (EEPC) according to the probability of user’s application usage in a computer machine. For proposed EEPC, we implement a Probability Calculation Table (PCT) by reusing available compression techniques and through introducing some basic change in cache storage policy. On the other hand L1 and L2 implementation is also the part of this study; for example, History Table (HT) is maintained for L1 and L1 is physically addressed to the main memory. Whereas, L2 is virtually addressed with the main memory and fully associative to handle misses. We mainly focus on Cache design enhancement, improvement in cache speed and implementation issues.
Authors and Affiliations
Ijaz Ali Shoukat , Mohsin Iftikhar
Keywords
Related Articles
- EP ID EP113533
- DOI -
- Views 138
- Downloads 0
Efficiency of K-Means Clustering Algorithm in Mining Outliers from Large Data Sets
This paper presents the performance of k-means clustering algorithm, depending upon various mean values input methods. Clustering plays a vital role in data mining. Its main job is to group the similar data together base...
Performance Comparison for Resource Allocation Schemes using Cost Information in Cloud
A wide variety of different types of virtual computer are available in cloud computing, each with different usage costs for processing performance and time. Consequently, similar processing tasks can incur different proc...
Record Matching : Improving Performance in Classification
Duplication detection identifies the records that represent the same real-world entity. This is a vital process in data integration. Record matching refers to the task of finding entries that refer to the same entity in...
Analysis of MAC layer protocol of Wireless Sensor Network Using QualNet
There is an uprising trend of enabling the smaller and sensitive information network to capitalize its worthiness using the Wireless Sensor Network. The various Network protocols can be implemented in order to achieve us...
A NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES
Generation and prioritization of test cases is one of the major issue in software testing.Maximum number of faults are identified through test cases only. Clients confidence can be gained through software testing. This p...