Traditional cache replacement algorithms are not easily applicable to a dynamic and heterogeneous environment. Moreover, the frequently used hitratio and byte-hit ratio are not appropriate measures in grid applications, because non-uniformity of the resource object sizes and non-uniformity cost of cache misses in resource information traffic. In this paper, we propose a Least Frequently Cost ca...

With the rise of new memory technologies such as Flash we expect future systems to rely on a flatter memory hierarchy using multiple heterogeneous memory units in parallel. Operating systems face new challenges in managing these memories in a costand energy-efficient way while maximizing performance. We believe that the key to meet these challenges is to leverage the full potential of each memo...

Many of the current bio-inspired delivery networks set their focus on search, e.g., by using artificial ants. If the network size and, therefore, the search space gets too large, the users experience high delays until the requested content can be consumed. In previous work, we proposed different replication strategies to reduce the search space. In this report we further evaluate measures for s...

Caching issues in meta-search engines are considered. We propose a popularity-driven cache algorithm that utilizes both popularities and reference counters of queries to determine cache data to be purged. We show how to calculate query popularity. Empirical evaluations and performance comparisons of popularity-driven caching with the least recently used (LRU) and least frequently used (LFU) sch...

The Internet has enabled the dissemination and access of vast amounts of information to be easy. But dramatic increases of the number of users of Internet cause server overload, network congestion and client perceived latency. In addition, currently the number of continuous media data such as audio and video is growing rapidly on the Internet. In this paper, we propose a proxy caching scheme th...

Learning strategies today represent a topical field of research in glottodidactics. Oxford (1990) defines them as specific actions taken by the learner to make learning easier, faster, more enjoyable, and more transferrable to new situations of language learning and use. Deployment of appropriate strategies ensures greater success in learning and more confidence. The first part of the paper lis...

The number of unique references in any program represents a small part of the total number of requested references. The unique references (small part of the total requested references) consist of two types: unique references that are used several times (most frequently used references) and unique references that are used once (least frequently used references). In this new cache design, the mos...

In this paper, we present a comprehensive performance study of Least Recently Used and Least Frequently Used with Dynamic Aging as traditional replacement schemes as well as for the newly proposed schemes Greedy Dual Size and Greedy Dual *. The goal of our study constitutes the understanding how these replacement schemes deal with different web document types. Using trace-driven simulation, we ...

Background: Defaulting from Anti-Retroviral Treatment(ART) possess serious consequences to the patient as well on the public health. Especially those patients who are Lost to Follow Up(LFU) require special attention. Aims: To study the characteristics of adult patients who were Lost to Follow Up and to determine the reason for the same. Methods: Between January 2012 and March 2012, 85 adult pat...