What Size Should your Buffers to Disks be?
| hal.structure.identifier | Topology-Aware System-Scale Data Management for High-Performance Computing [TADAAM] | |
| dc.contributor.author | AUPY, Guillaume | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | BEAUMONT, Olivier | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | EYRAUD-DUBOIS, Lionel | |
| dc.date.accessioned | 2024-04-04T03:05:29Z | |
| dc.date.available | 2024-04-04T03:05:29Z | |
| dc.date.created | 2018-01-01 | |
| dc.date.issued | 2018-05-21 | |
| dc.date.conference | 2018-05-20 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/193251 | |
| dc.description.abstractEn | Burst-Buffers are high throughput, small size intermediate storage systems typically based on SSDs or NVRAM that are designed to be used as a potential buffer between the computing nodes of a supercomputer and its main storage system consisting of hard drives. Their purpose is to absorb the bursts of I/O that many HPC applications experience (for example for saving checkpoints or data from intermediate results). In this paper, we propose a probabilistic model for evaluating the performance of Burst-Buffers. From a model of application and a data management strategy, we build a Markov chain based model of the system, that allows to quickly answer issues about dimensioning of the system: for a given set of applications, and for a given Burst-Buffer size and bandwidth, how often does the buffer overflow? We also provide extensive simulation results to validate our modeling approach. | |
| dc.description.sponsorship | Ordonnancement de données pour le calcul haute-performance - ANR-17-CE25-0004 | |
| dc.language.iso | en | |
| dc.publisher | IEEE | |
| dc.subject.en | Models | |
| dc.subject.en | Burst Buffers | |
| dc.subject.en | I/O | |
| dc.subject.en | Scheduling | |
| dc.title.en | What Size Should your Buffers to Disks be? | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1109/IPDPS.2018.00075 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | International Parallel and Distributed Processing Symposium (IPDPS) | |
| bordeaux.country | CA | |
| bordeaux.conference.city | Vancouver | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01623846 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2018-05-24 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01623846v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2018-05-21&rft.au=AUPY,%20Guillaume&BEAUMONT,%20Olivier&EYRAUD-DUBOIS,%20Lionel&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||