Results 21 to 30 of about 24,781 (241)
MAD-RAPPEL: Mobility Aware Data Replacement And Prefetching Policy Enrooted LBS
Journal of King Saud University: Computer and Information Sciences, 2022 The features of mobile devices are being continuously upgraded to provide quality of services to the mobile user seeking location-based information by allowing the usage of context-aware data.
Ajay K. Gupta, Udai Shanker
doaj +1 more source
Timing Anomalies Reloaded [PDF]
, 2010 Computing tight WCET bounds in the presence of timing anomalies - found in almost any modern hardware architecture - is a major challenge of timing analysis.
Gebhard, Gernot
core +1 more source
Cache Optimization by Fully-Replacement Policy [PDF]
American Journal of Embedded Systems and Applications, 2016 Cache is an important component in computer architecture. It has great effects on the performance of systems. Nowadays, Least Recently Used (LRU) Algorithm is one of the most commonly used one because it is easy to implement and with a relatively good performance. However, in some particular cases, LRU is not a good choice.
openaire +1 more source
Instruction Cache Replacement Policies and Organizations [PDF]
IEEE Transactions on Computers, 1985 Instruction cache replacement policies and organizations are analyzed both theoretically and experimentally. Theoretical analyses are based on a new model for cache references —the loop model. First the loop model is used to study replacement policies and cache organizations.
null Smith, null Goodman
openaire +1 more source
Linux kernel compaction through cold code swapping [PDF]
, 2009 There is a growing trend to use general-purpose operating systems like Linux in embedded systems. Previous research focused on using compaction and specialization techniques to adapt a general-purpose OS to the memory-constrained environment, presented ...
A. Milanova +13 more
core +2 more sources
Adaptive Neuro-fuzzy Inference System as Cache Memory Replacement Policy
Advances in Electrical and Computer Engineering, 2014 To date, no cache memory replacement policy that can perform efficiently for all types of workloads is yet available. Replacement policies used in level 1 cache memory may not be suitable in level 2.
CHUNG, Y. M., HALIM, Z. A.
doaj +1 more source
Cache Strategy Based on Dynamic Popularity and Request Cost in Named Data Networking [PDF]
Jisuanji gongcheng, 2018 In order to replacing cache efficiently in Named Data Networking(NDN),a cache replacement strategy combining dynamic popularity and cost cache replacement policy is proposed in this paper,which named DPCP.Each node calculates the Dynamic Popularity and ...
GUO Chen,ZHENG Quan,DING Yao,WANG Song
doaj
IEEE Access, 2019 Many applications are hosted on cloud databases where several applications share the same database instance. Such database management system exhibits periodic behavior in terms of data references. For example, U.S.
Atul O. Thakare, Parag S. Deshpande
doaj +1 more source
Using Intelligent Prefetching to Reduce the Energy Consumption of a Large-scale Storage System [PDF]
, 2013 Many high performance large-scale storage systems will experience significant workload increases as their user base and content availability grow over time. The U.S. Geological Survey (USGS) Earth Resources Observation and Science (EROS) center hosts one
Fares, Ribel +4 more
core +2 more sources
Cache Scheme Based on Pre-Fetch Operation in ICN. [PDF]
PLoS ONE, 2016 Many recent researches focus on ICN (Information-Centric Network), in which named content becomes the first citizen instead of end-host. In ICN, Named content can be further divided into many small sized chunks, and chunk-based communication has merits ...
Jie Duan +5 more
doaj +1 more source