Results 51 to 60 of about 24,781 (241)
A versatile and accurate approximation for LRU cache performance [PDF]
In a 2002 paper, Che and co-authors proposed a simple approach for estimating the hit rates of a cache operating the least recently used (LRU) replacement policy.
Fricker, Christine +2 more
core +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 more
wiley +1 more source
This article proposes a novel chunk-based caching scheme known as the Progressive Popularity-Aware Caching Scheme (PPCS) to improve content availability and eliminate the cache redundancy issue of Information-Centric Networking (ICN).
Quang Ngoc Nguyen +7 more
doaj +1 more source
Analyzing Effects of Social Media User’s Influence on Contents Caching in ICN
In recent years, with the rapid growth of Social Networking Service (SNS), Information-Centric Networking (ICN) has been emerged as a promising network architecture for mitigating the traffic generated by SNS users. To fully utilize potential of ICN as a
Kodai Honda +2 more
doaj +1 more source
ABSTRACT Low Earth Orbit (LEO) satellite communication systems have evolved into a critical component of global broadband networks, enabling wide‐area connectivity, IoT services, and intelligent multilayer satellite–terrestrial integration. Despite rapid advancements in constellation deployment, routing mechanisms, resource management, and LEO–5G/6G ...
Wei‐Hao Su +2 more
wiley +1 more source
On Learning Suitable Caching Policies for In-Network Caching
In-network cache architectures, such as Information-centric networks (ICNs), have proven to be an efficient alternative to deal with the growing content consumption on networks. In caching networks, any device can potentially act as a caching node.
Stefani Pires +2 more
doaj +1 more source
Practical Run-time Checking via Unobtrusive Property Caching
The use of annotations, referred to as assertions or contracts, to describe program properties for which run-time tests are to be generated, has become frequent in dynamic programing languages.
Hermenegildo, Manuel V. +2 more
core +1 more source
Micro‐transitions and work identity: The case of academic entrepreneurs
Abstract Research Summary This paper examines how academic entrepreneurs—scientists who found research‐based startups while remaining in academia—construct and sustain their professional identities amid frequent transitions between academic and entrepreneurial roles.
Marouane Bousfiha, Henrik Berglund
wiley +1 more source
Reinforcement Learning-Based Cache Replacement Policies for Multicore Processors
High-performance computing (HPC) systems need to handle ever-increasing data sizes for fast processing and quick response times. However, modern processors’ caches are unable to handle massive amounts of data, leading to significant cache miss ...
Matheus A. Souza, Henrique C. Freitas
doaj +1 more source
Exploiting inter-reference time characteristic of Web cache workload for web cache replacement design [PDF]
Caching objects in Internet environment is aimed to reduce bandwidth consumption and increase the response time of system in term of user perception.Researcher believes that the performance of web cache is dependent on user access behavior.Therefore ...
Sediyono, Agung
core

