A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Coded Caching with Heterogenous Cache Sizes
[article]
2015
arXiv
pre-print
Preserved Fulltext
Other Versions
We investigate the coded caching scheme under heterogenous cache sizes. ...
the server unicasts the part of content W d k that are not stored in user 1 to k's local cache to user k. ...
local cache is large, it approximates to the system 2 and much larger than the system 3. ...
arXiv:1504.01123v3
fatcat:4hrfxah4gfeithhppkwmeefoxa
Anti-caching
2013
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
The traditional wisdom for building disk-based relational database management systems (DBMS) is to organize data in heavily-encoded blocks stored on disk, with a main memory block cache. ...
Our results show that for higher skewed workloads the anti-caching architecture has a performance advantage over either of the other architectures tested of up to 9⇥ for a data size 8⇥ larger than memory ...
In addition, the authors would like to thank Donghui Zhang and VoltDB for their input in the early stages of this project. ...
doi:10.14778/2556549.2556575
fatcat:azermg3gpzgdpg3pmhwl4qwwlu
Caché
2010
ACM SIGMOBILE Mobile Computing and Communications Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present the design, implementation, and evaluation of Caché, a system that offers location privacy for certain classes of location-based applications. ...
Applications then retrieve content from a local cache on the mobile device when it is needed. ...
We also thank our shepherd, Landon Cox, for his insightful feedback. ...
doi:10.1145/1923641.1923649
fatcat:fb4qqbaidjelxeqkrccp4y63hy
Decentralized Coded Caching with Distinct Cache Capacities
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Decentralized coded caching is studied for a content server with N files, each of size F bits, serving K active users, each equipped with a cache of distinct capacity. ...
A new decentralized coded caching scheme is proposed for this scenario, and it is shown to improve upon the state-of-the-art in terms of the required delivery rate over the shared link, when there are ...
In a decentralized caching system with N files in the database, each of size F bits, and K users with cache capacities µ = {M 1 , ..., M K }, such that M 1 ≤ M 2 ≤ · · · ≤ M K , the following delivery ...
arXiv:1610.03792v1
fatcat:pu7n4tyibbbpzmkd67bmzzp7uq
Decentralized coded caching with distinct cache capacities
2016
2016 50th Asilomar Conference on Signals, Systems and Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Decentralized coded caching is studied for a content server with N files, each of size F bits, serving K active users, each equipped with a cache of distinct capacity. ...
A new decentralized coded caching scheme is proposed for this scenario, and it is shown to improve upon the state-of-the-art in terms of the required delivery rate over the shared link, when there are ...
In a decentralized caching system with N files in the database, each of size F bits, and K users with cache capacities µ = {M 1 , ..., M K }, such that M 1 ≤ M 2 ≤ · · · ≤ M K , the following delivery ...
doi:10.1109/acssc.2016.7869142
dblp:conf/acssc/AmiriYG16
fatcat:hnhodrofrbcw3pyrdl5l2yvthe
Hyperbolic Caching: Flexible Caching for Web Applications
2017
USENIX Annual Technical Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We design a hyperbolic caching variant for several production systems from leading cloud providers. We implement our scheme in Redis and the Django web framework. ...
Today's web applications rely heavily on caching to reduce latency and backend load, using services like Redis or Memcached that employ inflexible caching algorithms. ...
We thank Amit Levi for access to Memcachier traces and Asaf Cidon for his help in obtaining them. We thank Siddhartha Jayanti for his assistance with theoretical analyses. ...
dblp:conf/usenix/BlanksteinSF17
fatcat:eznte5th4rh5nd6a4s5t4ab2na
LP-Cache: Privacy-aware Cache Model for Location-based Apps
2016
Proceedings of the 13th International Joint Conference on e-Business and Telecommunications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The model applies a cache-based technique to determine the position of client devices by means of wireless access points and achieve data minimisation in the current process. ...
In this paper, we introduce a novel privacy-aware model for location-based apps to overcome the shortcomings related to user privacy during the location calculation process. ...
All these cache-based systems either intent to generalise or obfuscate the LBS query or minimise the number of queries sent to the app providers, but they do not provide privacy from WiFi content distributors ...
doi:10.5220/0005970101830194
dblp:conf/secrypt/PatelP16
fatcat:i5euiumn4jaxbehur32mwim5iy
Second-level buffer cache management
2004
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Buffer caches are commonly used in servers to reduce the number of slow disk accesses or network messages. These buffer caches form a multilevel buffer cache hierarchy. ...
local algorithms, and 4) implementation and evaluation of these algorithms in a real storage system connected with commercial database servers (Microsoft SQL Server and Oracle) running industrial-strength ...
ACKNOWLEDGMENTS The authors would like to thank James F. Philbin for the useful discussions on this work. They would also like to thank the anonymous reviewers and editors, especially Dr. ...
doi:10.1109/tpds.2004.13
fatcat:iiimauc5izda7nny2rrv7jztla
Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered. ...
A novel coded caching scheme for the cache capacity of M= (N-1)/K is proposed. ...
Fig. 4 . 4 Delivery rate-cache capacity trade-off for a caching system with N = 60 files and K = 130 users when 1/K ≤ M ≤ t * N/K, for which, according to (8) , t * = 3.
and 1/K ≤ M ≤ (N − 1)/K. ...
arXiv:1604.03888v2
fatcat:w4ztqmjq7bcbdfxzugxioal7pm
Reducing Cache Lookup and Publish Overhead through Locality Awareness in P2P Web Caching
2008
2008 10th IEEE International Conference on High Performance Computing and Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present the development of a locality aware P2P cache system to overcome these limitations by using routing table locality, aggregation and soft state. ...
Peer-to-Peer (P2P) web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. ...
Evaluation and Result Analysis A series of simulations and experiments have been developed to analyze the design trade-offs presented in Section 2 for LACS. ...
doi:10.1109/hpcc.2008.164
dblp:conf/hpcc/ZhouC08
fatcat:vouhmvgieveu5gwo23bmp2yzsa
Computational caches
2013
Proceedings of the 6th International Systems and Storage Conference on - SYSTOR '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Caching is a well-known technique for speeding up computation. We cache data from file systems and databases; we cache dynamically generated code blocks; we cache page translations in TLBs. ...
We use a state-space model of computation to support such caching, involving two interrelated parts: speculatively memoized predicted/resultant state pairs that we use to accelerate sequential computation ...
The authors would like to thank Gerald Sussman, Miguel Aljacen, Jeremy McEntire, Liz Bradley, Benjamin Good and Scott Aaronson for their contributions. ...
doi:10.1145/2485732.2485749
dblp:conf/systor/WaterlandACKAAS13
fatcat:jiyblu3rjfeh7ea4gbrecbuxfa
Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Tradeoff
2017
IEEE Transactions on Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered. ...
A novel coded caching scheme for the cache capacity of M = (N − 1)/K is proposed. ...
Fig. 4 . 4 Delivery rate-cache capacity trade-off for a caching system with N = 60 files and K = 130 users when 1/K ≤ M ≤ t * N/K, for which, according to (8) , t * = 3.
and 1/K ≤ M ≤ (N − 1)/K. ...
doi:10.1109/tcomm.2016.2638841
fatcat:7gohsp5edvcd3ggrlxa2jborzu
RACE: A Robust Adaptive Caching Strategy for Buffer Cache
2008
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Although many block replacement algorithms for buffer caches have been proposed to address the well-known drawbacks of the LRU algorithm, they are not robust and cannot maintain a consistent performance ...
which is crucial in deciding which blocks are to be replaced upon a cache miss. ...
ACKNOWLEDGMENTS The authors are grateful to Dr. Song ...
doi:10.1109/tc.2007.70788
fatcat:crm5n2okyjgn5ms3skgtccue5y
Estimating Application Cache Requirement for Provisioning Caches in Virtualized Systems
2011
2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The first technique is based on operating system (OS) page coloring and does not require change in commodity hardware or application. ...
In our research, we use MRCs to provision caches for applications in a consolidated environment. ...
We evaluate a variety of cache partitioning techniques which make different trade-offs along accuracy, flexibility, and intrusiveness dimensions. ...
doi:10.1109/mascots.2011.67
dblp:conf/mascots/KollerVR11
fatcat:yul3xqonjjf37epirjnfmqbtiy
ECI-Cache
2018
Proceedings of the ACM on Measurement and Analysis of Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1805.00976v1 fatcat:x576wnjfcbhejau56ufomwzhea
To evaluate the proposed scheme, we have implemented ECI-Cache in an open source hypervisor, QEMU (version 2.8.0), on a server running the CentOS 7 operating system (kernel version 3.10.0-327). ...
Recent studies suggest using SSDs as a caching layer for HDD-based storage subsystems in virtualization platforms. ...
ACKNOWLEDGMENTS We would like to thank the reviewers of SIGMETRICS 2017 and SIGMETRICS 2018 for their valuable comments and constructive suggestions. We especially thank Prof. ...
doi:10.1145/3179412
dblp:journals/pomacs/AhmadianMA18
fatcat:mbntaebpqzh3jfsoevivszj7aq
« Previous
Showing results 1 — 15 out of 13,914 results