A Note on Linear based Set Associative Cache address System
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 8
Abstract
Based on the system request or application request a set of word is loaded on the cache memory. When the system is switched off the cache history gets abscond. The performance of CPU is based on the factors such as cache hit, write through cache, write back, cache memory mapping technique, CPU speed, bandwidth, cache memory size etc., Some of the standard cache addresses mapping techniques are set associative, associative and direct mapping technique. This paper proposes a novel idea of set associative cache address mapping using linear equation. The standard set associative mapping is remapped with linear set associative for to secure the data in a non sequential portion by having the standard mapping execution time. This is mainly focus on to design the cache enhancement and improvement.
Authors and Affiliations
Chandramowliswaran N , Srinivasan. S , Chandra Segar. T
Method for forecasting the volume of applications using probabilistic classifier based on Bayesian theorem for recruitment in the government organizations
In this paper, we propose a practical method to estimate or forecast the volume of applications based on Bayesian classifier which is a probability method that makes optimal decision based on known probability distributi...
A Survey on Optimistic Fair Digital Signature Exchange Protocols
Security services become crucial to many applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery, with the phenomenal growth of the Internet and open networks. For th...
Step Counting Using Smartphone-Based Accelerometer
This paper presents a method for counting the number of steps taken by a user, while walking at any variable speed, using smartphone-based accelerometer. For this purpose, the steps are detected based on a relation betwe...
A survey on the approaches in honeypot for implementing network security
Honeypot is a supplemented active defence system for network security. It traps attacks, records intrusion information about tools and activities of the hacking process, and prevents attacks outbound the compromised syst...
A New Look to Traversal Algorithms Using Set Construct Data Structure
Tree traversal refers to the process of visiting or examining or updating each node in a tree data structure, exactly once, in a systematic way. Such traversals are classified by the order in which the nodes of the tree...