In modern society, intelligent devices equipped with flash memory are very popular. It has many wonderful characteristics, such as small, fast, little consumption, shock resistance and so on. Flash memory is divided into NOR memory and NAND memory. The NOR memory can be quickly read with byte data which is developed into data memory for code storage. A new algorithm is needed to optimize the pe...

This paper evaluates the Hawkeye cache replacement policy on the Cache Replacement Championship framework. The solution departs from that of the original paper by distinguishing prefetches from demand fetches, so that redundant prefetches can be identified and cached appropriately. Evaluation on SPEC2006 shows that in the absence of prefetching, Hawkeye provides a speedup of 4.5% over LRU (vs. ...

Recently, byte-accessible NVRAM (nonvolatile RAM) technologies such as PRAM and FeRAM are advancing rapidly and there are attempts to use these NVRAMs as part of buffer caches. A nonvolatile buffer cache provides improved consistency of file systems by absorbing write I/Os as well as improved performance. In this paper, we discuss the optimality of cache replacement algorithms in nonvolatile bu...

Data caching on mobile clients is widely seen as an effective solution to improve system performance. In particular, cooperative caching, based on the idea of sharing and coordination of cache data among multiple users, can be particularly effective for information access in mobile ad hoc networks where mobile clients are moving frequently and network topology is changing dynamically. Most exis...

BACKGROUND The costs and benefits of controlling nosocomial spread of antibiotic-resistant bacteria are unknown. METHODS We developed a mathematical algorithm to determine cost-effectiveness of infection control programs and explored the dynamical interactions between different epidemiological variables and cost-effectiveness. The algorithm includes occurrence of nosocomial infections, attrib...

Information-centric networking (ICN) has gained attention from network research communities due to its capability of efficient content dissemination. In-network caching function in ICN plays an important role to achieve the design motivation. However, many researchers on in-network caching have focused on where to cache rather than how to cache: the former is known as contents deployment in the...

The product replacement algorithm is a commonly used heuristic to generate random group elements in a nite group G, by running a random walk on generating k-tuples of G. While experiments showed outstanding performance, until recently there was little theoretical explanation. We give an extensive review of both positive and negative theoretical results in the analysis of the algorithm.

OSGi is a middleware standard for home gateways, designed for smart home applications. OSGi models services as separate components, called bundles. Smart home applications might differ in their importance. For example, home security system is more important than Internet game. Bundles collaborate to provide the required service. This paper proposes a bundle replacement algorithm that takes into...

A problem of great importance in computational group theory is to generate (nearly) uniformly distributed random elements in a finite groupG. A good example of such an algorithm should start at any given set of generators, use no prior knowledge of the structure of G, and in a polynomial number of group operations return the desired random group elements (see [Bb2]). Then these random elements ...

Data mining is the process of mining information from the large set of data. It further has many categories like text mining web usage mining and web content mining. There are many types of algorithm which are used in web mining i.e. Visitor method, Dom tree and least recent used algorithm. Visitor and Dom tree is the complex and time consuming method. Least Recent Used algorithm is less time c...