Results 71 to 80 of about 87,332 (240)
Optimal Scheduling of Content Caching Subject to Deadline
IEEE Open Journal of the Communications Society, 2020 Content caching at the edge of network is a promising technique to alleviate the burden of backhaul networks. In this paper, we consider content caching along time in a base station with limited cache capacity. As the popularity of contents may vary over
Ghafour Ahani, Di Yuan
doaj +1 more source
Dynamic Hierarchical Cache Management for Cloud RAN and Multi- Access Edge Computing in 5G Networks [PDF]
, 2018 Cloud Radio Access Networks (CRAN) and Multi-Access Edge Computing (MEC) are two of the many emerging technologies that are proposed for 5G mobile networks.
Rajendiran, Deepika Pathinga
core +1 more source
An Algorithm for Variable Cache Ways [PDF]
International Journal of Computer and Communication Engineering, 2013 This paper proposed an algorithm for varying cache ways in set associative cache. The ways of the mapped cache set are extended to half of the ways of adjacent sets in this model. A set is thus viewed as growing in both ways. If a way is free in this extended model, the line is placed in the way. An owner vector indicates the set owner ship of the way.
openaire +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT Technological change and the increasing use of electronic devices have made electronic waste one of the fastest‐growing waste streams worldwide, posing significant environmental and social challenges. Thus, understanding consumer behaviour regarding the purchase, use and disposal of electronic products is key to developing effective circular ...
Idiano D'Adamo +4 more
wiley +1 more source
The K-Server Dual and Loose Competitiveness for Paging
, 1994 This paper has two results. The first is based on the surprising observation that the well-known ``least-recently-used'' paging algorithm and the ``balance'' algorithm for weighted caching are linear-programming primal-dual algorithms.
C. H. Papadimitriou +6 more
core +4 more sources
Hidden Markov graphical models with state‐dependent generalized hyperbolic distributions
Canadian Journal of Statistics, EarlyView.Abstract In this article, we develop a novel hidden Markov graphical model to investigate time‐varying interconnectedness between different financial markets. To identify conditional correlation structures under varying market conditions and accommodate shape features embedded in financial time series, we rely upon the generalized hyperbolic family of ...
Beatrice Foroni +2 more
wiley +1 more source
Cache Replacement Algorithm Based on Sudden-centralized Access Mode [PDF]
Jisuanji gongcheng, 2017 With the continuous expansion of computer access to the sudden-centralized problems,traditional Least Recency Used(LRU),Least Frequency Used(LFU) and other cache replacement algorithms are difficult to meet the requirements of high hit ratio and low ...
LI Cong,WEN Dongxin
doaj +1 more source
Adaptive Cache-Oblivious All-to-All Operation [PDF]
, 2004 Modern processors rely on cache memories to reduce the latency of data accesses. Extensive cache misses would thus compromise the usefulness of the scheme.
Chung, Shin Yee, Hsu, Wen Jing
core
International Journal for Numerical Methods in Fluids, EarlyView.The immersed boundary method (IBM) was coupled with the moment representation lattice Boltzmann method (MR‐LBM), reducing bandwidth requirements compared to population‐based LBM formulations. A systematic assessment of IBM parameters was conducted to quantify their effect on computational performance.
Marco A. Ferrari +2 more
wiley +1 more source
Adaptive TTL-Based Caching for Content Delivery
, 2017 Content Delivery Networks (CDNs) deliver a majority of the user-requested content on the Internet, including web pages, videos, and software downloads. A CDN server caches and serves the content requested by users.
Basu, Soumya +4 more
core +1 more source