Filters








5 Hits in 3.1 sec

Can NDN Perform Better than OLSR in Wireless Ad Hoc Networks? [article]

Thiago Teixeira, Cong Wang, Michael Zink
2016 arXiv   pre-print
As an effort to increase the cache diversity and have a better utilization of the Content Store we study probabilistic LRU.  ...  The emerging paradigm of Information-Centric Networking is an exciting field of research, opening opportunities in many areas, such as forwarding strategies, caching placement policies, applications (e.g  ...  ACKNOWLEDGMENTS The authors would like to thank Marica Amadeo from the Mediterranean University of Reggio Calabria for providing technical support for this work.  ... 
arXiv:1609.06270v1 fatcat:7byzr4m4qff4rg3fc2kem6kw2e

Novel applications and contexts for the cognitive packet network

Olumide Akinwande, Erol Gelenbe
2019
ICN adopts a data-centric approach such that contents are directly addressable at the network level and in-network caching is easily supported.  ...  An optimal caching strategy for an information-centric network is first analysed, and approximate solutions are developed and evaluated.  ...  betweenness centrality values along the delivery path cache the content.  ... 
doi:10.25560/68059 fatcat:65eyunntjjbc7jq6qhwrmrpymm

OASIcs, Volume 4, WCET'06, Complete Volume [article]

Frank Mueller
2012
Acknowledgments The authors would like to thank AbsInt Angewandte Informatik GmbH for their support concerning WCET analysis using the aiT framework.  ...  multi-processors, multi-cores or SMTs • WCET analysis for networks (e.g., CAN) WCET'06 featured one invited talk, one report of an upcoming WCET tool contest and, most of all, presentations of technical  ...  The access sequence a-e-a-f-a-g contains only 4 distinct elements, yet 4-PLRU misses for every second access when started with a-b-c-d in the cache. 3 Figure 4 shows that a PLRU cache can take several  ... 
doi:10.4230/oasics.wcet.2006 fatcat:vbguo36fonhjzlha734ji2i2dq

WCET analysis and optimization for multi-core real-time systems

Timon Kelter, Technische Universität Dortmund, Technische Universität Dortmund
2015
] which denotes that a CRPD and WCET estimate for FIFO and PLRU can be obtained by analyzing an appropriately shrinked LRU cache.  ...  It turns out that the shrinking needs to be more aggressive for FIFO to make this work, than for PLRU.  ...  B avg min ) and upper (B avg max ) loop bound and the number of context blocks V C τ for a context graph with unlimited call string length but without virtual unrolling.  ... 
doi:10.17877/de290r-7209 fatcat:yhl2jvlcvzh3rhc26azn4dnbre

On static execution-time analysis [article]

Sebastian Hahn, Universität Des Saarlandes, Universität Des Saarlandes
2019
We present the compositional base bound analysis that accounts for any such amplifying effects within its timing contribution. This enables a sound compositional analysis even for complex processors.  ...  At least since multi-core processors have emerged, timing analysis separates concerns by analysing different aspects of the system's timing behaviour individually.  ...  While there are usually separate first-level caches for code and data to allow contention-free parallel access, the other cache levels are commonly unified to allow a better overall utilisation.  ... 
doi:10.22028/d291-27991 fatcat:lmnjjutuzvaavhmpu2smbldhuu