PASCAL: A Learning-aided Cooperative Bandwidth Control Policy for Hierarchical Storage Systems
Guardado en:
| Publicado en: | arXiv.org (Dec 4, 2024), p. n/a |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Publicado: |
Cornell University Library, arXiv.org
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full text outside of ProQuest |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2787019211 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2787019211 | ||
| 045 | 0 | |b d20241204 | |
| 100 | 1 | |a Li, Xijun | |
| 245 | 1 | |a PASCAL: A Learning-aided Cooperative Bandwidth Control Policy for Hierarchical Storage Systems | |
| 260 | |b Cornell University Library, arXiv.org |c Dec 4, 2024 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a Nowadays, the Hierarchical Storage System (HSS) is considered as an ideal model to meet the cost-performance demand. The data migration between storing tiers of HSS is the way to achieve the cost-performance goal. The bandwidth control is to limit the maximum amount of data migration. Most of previous research about HSS focus on studying the data migration policy instead of bandwidth control. However, the recent research about cache and networking optimization suggest that the bandwidth control has significant impact on the system performance. Few previous work achieves a satisfactory bandwidth control in HSS since it is hard to control bandwidth for so many data migration tasks simultaneously. In this paper, we first give a stochastic programming model to formalize the bandwidth control problem in HSS. Then we propose a learning-aided bandwidth control policy for HSS, named \Pascal{}, which learns to control the bandwidth of different data migration task in an cooperative way. We implement \Pascal{} on a commercial HSS and compare it with three strong baselines over a group of workloads. Our evaluation on the physical system shows that \Pascal{} can effectively decrease 1.95X the tail latency and greatly improve throughput stability (2X \(\downarrow\) throughput jitter), and meanwhile keep the throughput at a relatively high level. | |
| 653 | |a Migration | ||
| 653 | |a Stochastic models | ||
| 653 | |a Learning | ||
| 653 | |a Storage systems | ||
| 653 | |a Bandwidths | ||
| 653 | |a Pascal (programming language) | ||
| 653 | |a Optimization | ||
| 653 | |a Stochastic programming | ||
| 653 | |a Cooperative control | ||
| 700 | 1 | |a Zhou, Yunfan | |
| 700 | 1 | |a Zhang, Ji | |
| 773 | 0 | |t arXiv.org |g (Dec 4, 2024), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2787019211/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/2303.08066 |