Počet záznamů: 1
Fair-share scheduling algorithm for a tertiary storage system
- 1.
SYSNO ASEP 0439633 Druh ASEP C - Konferenční příspěvek (mezinárodní konf.) Zařazení RIV D - Článek ve sborníku Název Fair-share scheduling algorithm for a tertiary storage system Tvůrce(i) Jakl, Pavel (UJF-V)
Lauret, J. (US)
Šumbera, Michal (UJF-V) RID, ORCID, SAICelkový počet autorů 3 Zdroj.dok. Journal of Physics Conference Series, 219. - Bristol : IOP Publishing Ltd, 2010 / Gruntorad J. ; Lokajíček M. - ISSN 1742-6588 Rozsah stran 052005 Poč.str. 10 s. Forma vydání Tištěná - P Akce 17th International Conference on Computing in High Energy and Nuclear Physics (CHEP) Datum konání 21.05.2009-27.05.2009 Místo konání Prague Země CZ - Česká republika Typ akce WRD Jazyk dok. eng - angličtina Země vyd. GB - Velká Británie Klíč. slova STAR ; RHIC ; mass storage system Vědní obor RIV BG - Jaderná, atomová a mol. fyzika, urychlovače CEP LC07048 GA MŠMT - Ministerstvo školství, mládeže a tělovýchovy LA09013 GA MŠMT - Ministerstvo školství, mládeže a tělovýchovy Institucionální podpora UJF-V - RVO:61389005 UT WOS 000295102000179 DOI 10.1088/1742-6596/219/5/052005 Anotace Any experiment facing Peta bytes scale problems is in need for a highly scalable mass storage system (MSS) to keep a permanent copy of their valuable data. But beyond the permanent storage aspects, the sheer amount of datamakes complete data-set availability onto live storage (centralized or aggregated space such as the one provided by Scalla/Xrootd) cost prohibitive implying that a dynamic population from MSS to faster storage is needed. One of the most challenging aspects of dealing with MSS is the robotic tape component. If a robotic system is used as the primary storage solution, the intrinsically long access times (latencies) can dramatically affect the overall performance. To speed the retrieval of such data, one could organize the requests according to criterion with an aim to deliver maximal data throughput. However, such approaches are often orthogonal to fair resource allocation and a trade-off between quality of service, responsiveness and throughput is necessary for achieving an optimal and practical implementation of a truly faire-share oriented file restore policy. Starting from an explanation of the key criterion of such a policy, we will present evaluations and comparisons of three different MSS file restoration algorithms which meet fair-share requirements, and discuss their respective merits. We will quantify their impact on a typical file restoration cycle for the RHIC/STAR experimental setup and this, within a development, analysis and production environment relying on a shared MSS service. Pracoviště Ústav jaderné fyziky Kontakt Markéta Sommerová, sommerova@ujf.cas.cz, Tel.: 266 173 228 Rok sběru 2015
Počet záznamů: 1