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.
Filters
Cacheability analysis of HTTP traffic in an operational LTE network
2013
2013 Wireless Telecommunications Symposium (WTS)
Preserved Fulltext
High cache hit ratio can be achieved if the proxy server caches only those contents that are guaranteed of significant revisits. ...
Our analysis shows that amongst all the contents, 'image' type have the highest revisit rate, which means caching them is beneficial. ...
Section IV lists the constraints that were used in our analysis for classifying a HTTP response as cacheable or non-cacheable. ...
doi:10.1109/wts.2013.6566245
dblp:conf/wts/RamananDHNKS13
fatcat:xzid2mfuibe53huqz6h4dztdr4
Stochastic node caching for memory‐bounded search
1999
Systems and Computers in Japan
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 propose a simple and effective algorithm called Stochastic Node Caching (SNC) for reducing the number of revisits. ...
Linear-space search algorithms such as IDA* (Iterative Deepening A*) cache only those nodes on the current search path, but may revisit the same node again and again. ...
Thus, SNC may reduce revisits by the effect of caching such nodes. ...
doi:10.1002/(sici)1520-684x(199902)30:2<57::aid-scj7>3.3.co;2-e
fatcat:mree4yjaszbk5ht2sfdhoezeuy
Stochastic node caching for memory-bounded search
1999
Systems and Computers in Japan
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 propose a simple and effective algorithm called Stochastic Node Caching (SNC) for reducing the number of revisits. ...
Linear-space search algorithms such as IDA* (Iterative Deepening A*) cache only those nodes on the current search path, but may revisit the same node again and again. ...
Thus, SNC may reduce revisits by the effect of caching such nodes. ...
doi:10.1002/(sici)1520-684x(199902)30:2<57::aid-scj7>3.0.co;2-n
fatcat:tmggeadeqzckhnvmnswelpoxjm
Formal Modeling and Analysis of the REST Architecture Using CSP
[chapter]
2013
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 2017; you can also visit the original URL.
The file type is application/pdf.
Formalization using CSP Modeling Mapping six REST constraints to the framework. Describing using First-Order Logic. Verifying using Process Analysis Toolkit (PAT). ...
Revisited
Case Study: Environment Monitoring
Conclusion and Future Work
Xi Wu, Yue Zhang, Huibiao Zhu, Yongxin Zhao, Zailiang Sun, Peng Liu
Formal Modeling and Analysis of the REST Architecture ...
Mapped six REST constraints to the achieved model and use PAT to implement the REST architecture and verify the constraints automatically. ...
doi:10.1007/978-3-642-38230-7_6
fatcat:3il2o3e665fhnbcfkr5rj5vquy
MUVIS: Multi-source video streaming service over WLANs
2005
Journal of Communications and Networks
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.
In addition, we implement two different caching strategies, simple caching simple fetching (SCSF) and distortion minimized smart caching (DMSC), in the proxy to investigate the effect of caching on the ...
Index Terms: Caching strategies, multi-source video streaming, rate-distortion optimized packet scheduling. ...
a certain cache size constraint. ...
doi:10.1109/jcn.2005.6387862
fatcat:i57dusrnrfft5cbgc6244qwc3q
How effective is mobile browser cache?
2011
Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students - S3 '11
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.
Firstly, increasing the cache size of the browser on smartphones will not improve the effectiveness of the browser cache very much. ...
The findings reveal the limitations of the cache design for mobile browsers and motivate a new level of cache design and speculative revalidation and loading. ...
We can see that the financial related websites (chase, uwcu and wf) have much stricter cache constraints. ...
doi:10.1145/2030686.2030693
dblp:conf/mobicom/WangLZC11
fatcat:h2wtt3eukjaabfiiyv7mjust6q
Kismet
2011
SIGPLAN notices
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.
Revisiting CPA Problem #1:
Data-flow Style Execution Model Is Unrealistic
void top( )
{
…. ...
effect to incorporate increased cache size from multiple cores Adapting Kismet to Multicore Solution (A) = {A:32} or {C:8, D:32} Parallelize Descendants Parallelize the Parent Constraints to filter ...
doi:10.1145/2076021.2048108
fatcat:nyzuo4jw4ngnxpearfj7xkgtja
State Caching Reconsidered
[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 2008; you can also visit the original URL.
The file type is application/pdf.
It is often claimed that state caching is effective when the cache is larger than between 33% and 50% of the total state space, and that random replacement of cached states is the best strategy. ...
In addition, the paper introduces a new technique, stratified caching, that reduces time consumption by placing an upper bound on the extra work caused by state caching. ...
Other Work Related to State Caching The performance of state caching using open addressing -also known as closed hashing -has also been investigated [5, 19] , but, due to space constraints, this approach ...
doi:10.1007/978-3-540-24732-6_3
fatcat:3gdwoa4bubcq3az7sstnvwgacu
Kismet
2011
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications - OOPSLA '11
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.
Revisiting CPA Problem #1:
Data-flow Style Execution Model Is Unrealistic
void top( )
{
…. ...
effect to incorporate increased cache size from multiple cores Adapting Kismet to Multicore Solution (A) = {A:32} or {C:8, D:32} Parallelize Descendants Parallelize the Parent Constraints to filter ...
doi:10.1145/2048066.2048108
dblp:conf/oopsla/JeonGLT11
fatcat:jz5ewq6tobgmfn7i43suodikka
Performance and overhead of semantic cache management
2006
ACM Transactions on Internet Technology
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.
The primary contribution of this article is to revisit the performance and overhead of semantic caching using a modern database server and modern hardware. ...
This article studies semantic caching, a caching architecture for such applications, that caches the results of selection queries. ...
Also, we would like to thank the many students at Reykjavík University who have played with the semantic caching code and yielded insight into the capabilities of SQL Server. ...
doi:10.1145/1151087.1151091
fatcat:u6w3a2txbrhl7evvjik65usvbi
CoCo
2003
Proceedings of the 40th conference on Design automation - DAC '03
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.
Here are the constraints: it follows that 8 separating values (we will refer to them as separators) are needed to deduce the cache block number To store these separators we use memories of 1Kx18. ...
CR
Cache
Cache
Hit
Total
Cycles
Appl. ...
doi:10.1145/775832.775912
dblp:conf/dac/LekatsasHCJS03
fatcat:7euxkcnbb5dddnsbgqcdfa2fui
CoCo
2003
Proceedings of the 40th conference on Design automation - DAC '03
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.
Here are the constraints: it follows that 8 separating values (we will refer to them as separators) are needed to deduce the cache block number To store these separators we use memories of 1Kx18. ...
CR
Cache
Cache
Hit
Total
Cycles
Appl. ...
doi:10.1145/775910.775912
fatcat:l7jbarj6znfppkikgo46ahfhya
Solving the Station Repacking Problem
2016
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE 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 2022; you can also visit the original URL.
The file type is application/pdf.
SATFC is based on a SAT encoding paired with a wide range of techniques: constraint graph decomposition; novel caching mechanisms that allow for reuse of partial solutions from related, solved problems ...
Hence, we revisit the impact of Hydra at the end of Section 4.2. ...
These constraints ensure that each station is assigned to exactly one channel, and that interference constraints are not violated. ...
doi:10.1609/aaai.v30i1.10077
fatcat:7yxrc5grbrci3pado5ksvoocwu
MFLUSH: Handling Long-Latency Loads in SMT On-Chip Multiprocessors
2008
2008 37th International Conference on Parallel Processing
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 revisit the FLUSH mechanism and analyze its application in the emerging CMP+SMT scenario. ...
It handles L2 cache misses in order to avoid hardware resource monopolization by any given execution thread; involving an additional energy cost via instruction refetching. ...
SMT IFetch Policies must be revisited when moving to the new CMP+SMT scenario. ...
doi:10.1109/icpp.2008.48
dblp:conf/icpp/AcostaCRV08
fatcat:ambyz4fn2zg73dobdlg6afti7u
Optimization of caching devices with geometric constraints
2017
Performance evaluation (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 2018; you can also visit the original URL.
The file type is application/pdf.
We consider both per cache capacity constraints as well as an average capacity constraint over all caches. ...
We demonstrate that the average constraint leads to significantly smaller cache miss probability. ...
We will make use of this property in Section 5, where we will revisit the case N = 1 under an average capacity constraint. ...
doi:10.1016/j.peva.2017.05.001
fatcat:feojqxbpg5cona5h4fgj7vfc2q
« Previous
Showing results 1 — 15 out of 8,517 results