The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Theoretical study of cache syatems
[article]
2003
arXiv
pre-print
Preserved Fulltext
The aim of this paper is a theoretical study of a cache system in order to optimize proxy cache systems and to modernize construction principles including prefetching schemes. ...
An internet traffic caching system based on Zipf-like distribution (ZBS) is invented. The additional module to the cache construction gives an effective prefetching by lifetime. ...
The aim of this paper is a theoretical study of a cache system in order to find a way for optimization of proxy systems and to modernize construction principles. ...
arXiv:cs/0303014v1
fatcat:xzbfgyhdfjg6dlo6cybut3iz3q
Comparative Measurement of Cache Configurations' Impacts on Cache Timing Side-Channel Attacks
2019
USENIX Security Symposium
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.
Time-driven and access-driven attacks are two dominant types of the timing-based cache side-channel attacks. ...
The difficulty comes from the unavailability of the configurable caches in existing CPU products. ...
This challenge prevents the experimental study about the impact of cache parameters on time-driven attacks. ...
dblp:conf/uss/YuXCY19
fatcat:52tz67jexrbubiycmazdy2yf4m
Secure caching with non-uniform demands
2014
2014 4th International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace & Electronic Systems (VITAE)
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.
For this scenario, the cache memory of each user is split into two parts: one part is used to store data (some function of the files), whereas the other part is used to store keys. ...
The secure-rate-vs-memory trade-off of the proposed scheme is analyzed and shown to be close to the information theoretic optimal for all feasible values of problem parameters. ...
A more general case of non-uniform file popularity distribution and corresponding coded caching approach was studied in [5] . ...
doi:10.1109/vitae.2014.6934447
dblp:conf/vitae/SenguptaTC14
fatcat:s3wf2vcxara7beqti4ojzdksvi
Miss behavior for caching with lease
2015
Performance Evaluation 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 2015; you can also visit the original URL.
The file type is application/pdf.
For the related theoretical studies, lease of each data record, also known as cache characteristic time and Time-To-Live (TTL), provides a convenient approximation that can simplify the complexity in analyzing ...
It calls for further theoretical investigation on the lease term in presence of a finite cache capacity. ...
Implications in engineering and theoretical studies Due to the high performance of Remote Direct Memory Access (RDMA), recently many in-memory key-value stores have adopted RDMA to realize ultra-low latency ...
doi:10.1145/2825236.2825260
fatcat:223jsx4hznc6ricr7i7t3kbbva
A Game Theoretic Approach to Web Caching
[chapter]
2004
Lecture Notes in Computer Science
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.
In this paper, the Game Theoretic framework is applied to Web caching. The interaction of multiple clients with a caching subsystem is viewed as a non-cooperative game. ...
arge segment of the cache disk space and thus, enjoy high hit rates. ...
Other Game Theoretic studies of networking problems are discussed in Section 4. Section 5 concludes the paper. ...
doi:10.1007/978-3-540-24693-0_115
fatcat:eamc5ocsozgkvp4lw3s3yl6fmm
A Computationally Efficient P-LRU based Optimal Cache Heap Object Replacement Policy
2017
International Journal of Advanced Computer Science and Applications
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.
The proposed study aims to conceptualize a theoretical model for optimal cache heap object replacement. ...
Hence, various conventional studies introduced cache replacement policies which are one of the prominent key factors to determine the effectiveness of a cache memory. ...
The concept of tall Cache heap line is theoretically derived by (2) below: B 2 < η ×N where the constant η is ≤ 1 (2) Equation (2) represents the fact that the cache heap integrated with the system ...
doi:10.14569/ijacsa.2017.080118
fatcat:3n6s63c255ak5krpn4ctr7iutm
The measurements, parameters and construction of Web proxy cache
[article]
2003
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The aim of this paper is an experimental study of cache systems in order to optimize proxy cache systems and to modernize construction principles. ...
We want to outline that the results obtained and the plan of the experiment follow from the theoretical model. ...
Introduction This paper considers approaches to the problem of optimization of proxy cache construction based on theoretical and experimental study. ...
arXiv:cs/0303012v1
fatcat:tbdwzjd5ifh63ewn5gho2lm2ky
A distributed algorithm for sharing Web cache disk capacity
2006
12th International Conference on Parallel and Distributed Systems - (ICPADS'06)
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.
A decentralized game theoretic framework applied to Web caching is discussed. ...
Moreover, it is observed that the majority of hits in cache systems are due to shared objects, i.e., clients tend to refer to a "pool" of common resources. ...
each client to the overall performance of the caching system. ...
doi:10.1109/icpads.2006.12
dblp:conf/icpads/AlyfantisHMK06
fatcat:honn2msibzaejgpjuq47qztqxy
Information Theory for Data Communications and Processing
2020
Entropy
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.
communications systems. [...] ...
The book chapters [1–11] address timely theoretical and practical aspects that carry bothinteresting and relevant theoretical contributions, as well as direct implications for modern currentand future ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/e22111250
pmid:33287018
pmcid:PMC7711726
fatcat:zao24yjpjnh7rk7ujusbojfxtm
The three primary colors of mobile systems
2016
IEEE Communications Magazine
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:
2016 pre-print arXiv:1603.03551v1 fatcat:5goi6tollbgkdcqztuopy5vudy
the sustainable growth of mobile systems. ...
In this paper, we present the notion of "mobile 3C systems in which the "Communications", "Computing", and "Caching" (i.e., 3C) make up the three primary resources/funcationalties, akin to the three primary ...
The native mobile 3C cube
analyzing the communication capacity) handicaps the integration of computing and caching into
mobile systems, as their theoretical benefits are far from fully understood. ...
doi:10.1109/mcom.2016.7565182
fatcat:5zw2bzo53nctfphedrzo2ygpbi
Communication-avoiding micro-architecture to compute Xcorr scores for peptide identification
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Database algorithms play a crucial part in systems biology studies by identifying proteins from mass spectrometry data. ...
Many of these database search algorithms incur huge computational costs by computing similarity scores for each pair of sparse experimental spectrum and candidate theoretical spectrum vectors. ...
The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Institutes of Health or the National Science Foundation. ...
arXiv:2108.00147v2
fatcat:ra5gfqkig5gd3ciqk7fa3vwee4
A Case Study on Covert Channel Establishment via Software Caches in High-Assurance Computing Systems
[article]
2015
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.
In this case study, we investigate the possibility of covert channel establishment via software caches in the context of a framework for component-based operating systems. ...
This limitation is practically demonstrated with our concept of a specific covert timing channel based on file system caching. ...
case study
Fig. 5 . 5 Comparison of theoretical and actually measured transmission times with different block cache sizesTable 1. ...
arXiv:1508.05228v1
fatcat:mtali7t4gnbjfd4jnog54julpy
Secure partial repair in wireless caching networks with broadcast channels
2015
2015 IEEE Conference on Communications and Network Security (CNS)
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2015 pre-print arXiv:1507.05533v1 fatcat:xmlw2milv5evfcui223lbx4wwe
We thus study secure partial repair in the senses of information-theoretically strong and weak security. ...
We study security in partial repair in wireless caching networks where parts of the stored packets in the caching nodes are susceptible to be erased. ...
More related works to our study are in [24] - [27] where security in the repair problem of distributed storage systems has been studied. ...
doi:10.1109/cns.2015.7346846
dblp:conf/cns/GeramiXSS15
fatcat:22wfz7v5jvf33hzcwgheie7lyq
A queueing theoretic approach for performance evaluation of low-power multi-core embedded systems
2011
2011 IEEE 29th International Conference on Computer Design (ICCD)
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.
models have been studied in the context of traditional computer systems [31] ). ...
Since many embedded systems contain an L2 cache as the LLC, we focus on the L2 cache, however, our study can easily be extended for L3 caches and beyond as LLCs. ...
doi:10.1109/iccd.2011.6081397
dblp:conf/iccd/MunirGR11
fatcat:56sv3l23evbpzcpsgqdj53wfrq
A queueing theoretic approach for performance evaluation of low-power multi-core embedded systems
2014
Journal of Parallel and Distributed Computing
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.
models have been studied in the context of traditional computer systems [31] ). ...
Since many embedded systems contain an L2 cache as the LLC, we focus on the L2 cache, however, our study can easily be extended for L3 caches and beyond as LLCs. ...
doi:10.1016/j.jpdc.2013.07.003
fatcat:uefup6n3rzhl3f2o6xkphg735m
« Previous
Showing results 1 — 15 out of 53,629 results