Secretive Coded Caching With Shared Caches [PDF]
To appear in IEEE Communications Letters.
Shreya Shrestha Meel, B. Sundar Rajan
openaire +2 more sources
Research on Strong Cache Consistency Under Generic Cache Replacement Strategy [PDF]
Establishing an accurate cache analysis model helps to predict the cache behavior better, which is vital for network performance analysis and planning.However, existing analysis models for cache consistency studies are based on the Least Recently Used ...
YANG Tao, ZHENG Quan, XU Zhenghuan, SHI Qianbao, PENG Siwei
doaj +1 more source
Coded Caching With Shared Caches and Private Caches
This work studies the coded caching problem in a setting where the users are simultaneously endowed with a private cache and a shared cache. The setting consists of a server connected to a set of users, assisted by a smaller number of helper nodes that are equipped with their own storage. In addition to the helper cache, each user possesses a dedicated
Elizabath Peter +2 more
openaire +2 more sources
Efficient Stack Distance Approximation Based on Workload Characteristics
A stack distance of a reference is the depth from which the reference must be extracted from a stack. It has been widely applied to a variety of applications utilizing temporal locality information.
Sooyoung Lim, Dongchul Park
doaj +1 more source
Cache Partitioning and Caching Strategies for Device-to-Device Caching Systems [PDF]
The amount of traffic in wireless networks is increasing exponentially, and this problem can be mitigated using device-to-device (D2D) caching technology, which installs a cache on a mobile end device. Devices can reduce the cell load through self-offloading via content in their own cache and D2D offloading using content in others' caches.
Minjoong Rim, Chung Gu Kang 0001
openaire +2 more sources
Learning to Cache and Caching to Learn: Regret Analysis of Caching Algorithms [PDF]
Crucial performance metrics of a caching algorithm include its ability to quickly and accurately learn a popularity distribution of requests. However, a majority of work on analytical performance analysis focuses on hit probability after an asymptotically large time has elapsed. We consider an online learning viewpoint, and characterize the "regret" in
Archana Bura +4 more
openaire +2 more sources
Named data network dynamic cache placement strategy based on programmable data plane
Aiming at the efficiency and implementation of in‐network cache in Named Data Network, an in‐network cache method based on the programmable data plane was proposed.
Saifeng Hou, Yuxiang Hu, Le Tian
doaj +1 more source
A Write-Buffer Scheme to Protect Cache Memories Against Multiple-Bit Errors
Protecting cache memories against radiation-induced soft errors is critical in designing highly reliable processors. Dirty lines in write-back data caches are more critical, since the dirty lines have no backups in lower-level memory (LLM).
Jie Li +5 more
doaj +1 more source
High-Performance and Flexible Design Scheme with ECC Protection in the Cache
To improve the reliability of static random access memory (SRAM), error-correcting codes (ECC) are typically used to protect SRAM in the cache. While improving the reliability, we also need additional circuits to support ECC, including encoding and ...
Yulun Zhou +3 more
doaj +1 more source
Optimizing the rendering of an object-based web application with deep nesting and many dependencies
The article is devoted to the study of the application of optimization methods for drawing web applications using deeply nested objects. The task of analyzing the user interface, which includes a complex data structure received from the server part, is ...
O.V., D.D.
doaj +1 more source

