Results 1 to 10 of about 349,669 (308)
Secretive Coded Caching With Shared Caches [PDF]
IEEE Communications Letters, 2021 We consider the problem of \emph{secretive coded caching} in a shared cache setup where the number of users accessing a particular \emph{helper cache} is more than one, and every user can access exactly one helper cache. In secretive coded caching, the constraint of \emph{perfect secrecy} must be satisfied.
Shreya Shrestha Meel, B. Sundar Rajan
openaire +2 more sources
Efficient Stack Distance Approximation Based on Workload Characteristics
IEEE Access, 2022 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
Coded Caching With Shared Caches and Private Caches
IEEE Transactions on Communications, 2023 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
A Write-Buffer Scheme to Protect Cache Memories Against Multiple-Bit Errors
IEEE Access, 2022 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
Micromachines, 2022 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
Технічна інженерія, 2023 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
ACM Transactions on Computation Theory, 2013 We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is a storage with a certain capacity. For each time step, an online algorithm is given a price from the interval [1, α ], a consumption, and possibly a
Englert, Matthias +3 more
openaire +3 more sources
A Symbiotic Relationship Based Leader Approach for Privacy Protection in Location Based Services
ISPRS International Journal of Geo-Information, 2020 Location-based services (LBS) form the main part of the Internet of Things (IoT) and have received a significant amount of attention from the research community as well as application users due to the popularity of wireless devices and the daily growth ...
Hosam Alrahhal +3 more
doaj +1 more source
Research on Strong Cache Consistency Under Generic Cache Replacement Strategy [PDF]
Jisuanji gongcheng, 2022 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
Cache miss analysis of WHT algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 On modern computers memory access patterns and cache utilization are as important, if not more important, than operation count in obtaining high-performance implementations of algorithms.
Mihai Furis +2 more
doaj +1 more source