Results (6)
Search Parameters:
Keyword: Cache
A Proactive Mobile Edge Cache Policy Based on the Prediction by Partial Matching
The proactive caching has been an emerging approach to cost-effectively boost the network capacity and reduce access latency. While the performance of which extremely relies on the content prediction. Therefore, in this paper, a proactive cache policy is proposed in a distributed manner considering the prediction of the content popularity and user location to minimise…
Read More Extended Buffer-referred Prefetching to Leverage Prefetch Coverage
This paper is an extension of the work originally presented in the 26th International Con- ference on Automation and Computing. This study regarding hardware prefetching aims at concealing cache misses, leading to maximizing the performance of modern processors. This paper leverages prefetch coverage improvement as a way to achieve the goal. Original work proposes two…
Read More Securing IPv6 Neighbor Discovery using Pre-Shared Key
Neighbor Discovery Protocol (NDP) is used to discover the MAC address of the connected hosts in Internet Protocol Version 6 (IPv6) in a networked environment. Neighbor Cache Entry (NCE) table holds the association between a host’s IP address and MAC address. However, according to the protocol, the MAC address could be overwritten by sending a…
Read More Issues in File Caching and Virtual Memory Paging with Fast SCM Storage
Storage-Class Memory (SCM) like OptaneTM has advanced as a fast storage medium, and conventional memory management systems designed for the hard disk storage need to be reconsidered. In this article, we revisit the memory management system that adopts SCM as the underlying storage medium and discuss the issues in two layers: file caching and virtual…
Read More Fine Tuning the Performance of Parallel Codes
We propose a multilevel method to speed highly optimized parallel codes whose runtime increases faster than their workload. This method requires the ability to solve large in- stances by decomposing them into smaller instances. Using a simple parallel computing model, we derive a mathematical model that predicts whether or not our method can im- prove…
Read More Efficient Alignment of Very Long Sequences
We consider the problem of aligning two very long biological sequences. The score for the best alignment may be found using the Smith-Waterman scoring algorithm while the best alignment itself may be determined using Myers and Miller’s alignment algorithm. Neither of these algorithms takes advantage of computer caches to obtain high efficiency. We propose cache-efficient…
Read More