cache allocation
Recently Published Documents


TOTAL DOCUMENTS

74
(FIVE YEARS 21)

H-INDEX

10
(FIVE YEARS 3)

2022 ◽  
Vol 21 (1) ◽  
pp. 1-29
Author(s):  
Lanshun Nie ◽  
Chenghao Fan ◽  
Shuang Lin ◽  
Li Zhang ◽  
Yajuan Li ◽  
...  

With the technology trend of hardware and workload consolidation for embedded systems and the rapid development of edge computing, there has been increasing interest in supporting parallel real-time tasks to better utilize the multi-core platforms while meeting the stringent real-time constraints. For parallel real-time tasks, the federated scheduling paradigm, which assigns each parallel task a set of dedicated cores, achieves good theoretical bounds by ensuring exclusive use of processing resources to reduce interferences. However, because cores share the last-level cache and memory bandwidth resources, in practice tasks may still interfere with each other despite executing on dedicated cores. Such resource interferences due to concurrent accesses can be even more severe for embedded platforms or edge servers, where the computing power and cache/memory space are limited. To tackle this issue, in this work, we present a holistic resource allocation framework for parallel real-time tasks under federated scheduling. Under our proposed framework, in addition to dedicated cores, each parallel task is also assigned with dedicated cache and memory bandwidth resources. Further, we propose a holistic resource allocation algorithm that well balances the allocation between different resources to achieve good schedulability. Additionally, we provide a full implementation of our framework by extending the federated scheduling system with Intel’s Cache Allocation Technology and MemGuard. Finally, we demonstrate the practicality of our proposed framework via extensive numerical evaluations and empirical experiments using real benchmark programs.


2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Jiajie Ren ◽  
Demin Li ◽  
Lei Zhang ◽  
Guanglin Zhang

Content-centric networks (CCNs) have become a promising technology for relieving the increasing wireless traffic demands. In this paper, we explore the scaling performance of mobile content-centric networks based on the nonuniform spatial distribution of nodes, where each node moves around its own home point and requests the desired content according to a Zipf distribution. We assume each mobile node is equipped with a finite local cache, which is applied to cache contents following a static cache allocation scheme. According to the nonuniform spatial distribution of cache-enabled nodes, we introduce two kinds of clustered models, i.e., the clustered grid model and the clustered random model. In each clustered model, we analyze throughput and delay performance when the number of nodes goes infinity by means of the proposed cell-partition scheduling scheme and the distributed multihop routing scheme. We show that the node mobility degree and the clustering behavior play the fundamental roles in the aforementioned asymptotic performance. Finally, we study the optimal cache allocation problem in the two kinds of clustered models. Our findings provide a guidance for developing the optimal caching scheme. We further perform the numerical simulations to validate the theoretical scaling laws.


2021 ◽  
Vol 336 ◽  
pp. 05030
Author(s):  
Liping Ge ◽  
Jinhe Zhou

To reduce the delay of content acquisition, this paper proposes a game-based cache allocation strategy in the Information-Centric Network (ICN) slice. The cache resource allocation of different mobile virtual network operators (MVNOs) is modeled as a non-cooperative game model. The Newton iterative method is used to solve this problem, and the cache space allocated by the base station for each MVNO is obtained. Finally, the Nash equilibrium solution is obtained. Simulation results show that the proposed algorithm can reduce the delay.


IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 55485-55496
Author(s):  
Ping Zhou ◽  
Jianhui Lv ◽  
Lianbo Ma ◽  
Yidan Chen ◽  
Shujun Yang

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 13891-13903
Author(s):  
Jianhui Lv ◽  
Qing Li ◽  
Yong Jiang

Author(s):  
Cong Wang ◽  
Chen Chen ◽  
Yangyang Liu ◽  
Kefeng Fan ◽  
Qingqi Pei ◽  
...  

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1705
Author(s):  
Yuanhang Li ◽  
Jinlin Wang ◽  
Rui Han

The Information-Centric Network (ICN) is one of the most influential future network architectures and in-network caching in ICN brings some helpful features, such as low latency and mobility support. How to allocate cache capacity and place content properly will greatly influence the performance of ICN. This paper focuses on the cache allocation problem and content placement problem under the given cache space budget. Firstly, a lightweight allocation method utilizing information of both topology and content popularity is proposed, to allocate cache space and get the expected number of copies of popular content. The expected number of copies represents the number of content copies placed in the topology. Then, an on-path caching scheme based on the expected number of copies is proposed to handle the content placement problem. In the cache allocation scenario, the lightweight allocation method performs better than other baseline methods. In the content placement scenario, Leave Copy Down (LCD) based on the expected number of copies performs the second-best and is very close to Optimal Content Placement (OCP).


Sign in / Sign up

Export Citation Format

Share Document