Cargando…

Increasing Parallelism in the ROOT I/O Subsystem

When processing large amounts of data, the rate at which reading and writing can take place is a critical factor. High energy physics data processing relying on ROOT is no exception. The recent parallelisation of LHC experiments’ software frameworks and the analysis of the ever increasing amount of...

Descripción completa

Detalles Bibliográficos
Autores principales: Amadio, Guilherme, Bockelman, Brian, Canal, Philippe, Piparo, Danilo, Tejedor, Enric, Zhang, Zhe
Lenguaje:eng
Publicado: 2018
Materias:
Acceso en línea:https://dx.doi.org/10.1088/1742-6596/1085/3/032014
http://cds.cern.ch/record/2315478
_version_ 1780958143941967872
author Amadio, Guilherme
Bockelman, Brian
Canal, Philippe
Piparo, Danilo
Tejedor, Enric
Zhang, Zhe
author_facet Amadio, Guilherme
Bockelman, Brian
Canal, Philippe
Piparo, Danilo
Tejedor, Enric
Zhang, Zhe
author_sort Amadio, Guilherme
collection CERN
description When processing large amounts of data, the rate at which reading and writing can take place is a critical factor. High energy physics data processing relying on ROOT is no exception. The recent parallelisation of LHC experiments’ software frameworks and the analysis of the ever increasing amount of collision data collected by experiments further emphasised this issue underlying the need of increasing the implicit parallelism expressed within the ROOT I/O. In this contribution we highlight the improvements of the ROOT I/O subsystem which targeted a satisfactory scaling behaviour in a multithreaded context. The effect of parallelism on the individual steps which are chained by ROOT to read and write data, namely (de)compression, (de)serialisation, access to storage backend, are discussed. Performance measurements are discussed through real life examples coming from CMS production workflows on traditional server platforms and highly parallel architectures such as Intel Xeon Phi.
id cern-2315478
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2018
record_format invenio
spelling cern-23154782023-03-14T17:26:05Zdoi:10.1088/1742-6596/1085/3/032014http://cds.cern.ch/record/2315478engAmadio, GuilhermeBockelman, BrianCanal, PhilippePiparo, DaniloTejedor, EnricZhang, ZheIncreasing Parallelism in the ROOT I/O Subsystemcs.DCComputing and ComputersWhen processing large amounts of data, the rate at which reading and writing can take place is a critical factor. High energy physics data processing relying on ROOT is no exception. The recent parallelisation of LHC experiments’ software frameworks and the analysis of the ever increasing amount of collision data collected by experiments further emphasised this issue underlying the need of increasing the implicit parallelism expressed within the ROOT I/O. In this contribution we highlight the improvements of the ROOT I/O subsystem which targeted a satisfactory scaling behaviour in a multithreaded context. The effect of parallelism on the individual steps which are chained by ROOT to read and write data, namely (de)compression, (de)serialisation, access to storage backend, are discussed. Performance measurements are discussed through real life examples coming from CMS production workflows on traditional server platforms and highly parallel architectures such as Intel Xeon Phi.When processing large amounts of data, the rate at which reading and writing can take place is a critical factor. High energy physics data processing relying on ROOT is no exception. The recent parallelisation of LHC experiments' software frameworks and the analysis of the ever increasing amount of collision data collected by experiments further emphasized this issue underlying the need of increasing the implicit parallelism expressed within the ROOT I/O. In this contribution we highlight the improvements of the ROOT I/O subsystem which targeted a satisfactory scaling behaviour in a multithreaded context. The effect of parallelism on the individual steps which are chained by ROOT to read and write data, namely (de)compression, (de)serialisation, access to storage backend, are discussed. Performance measurements are discussed through real life examples coming from CMS production workflows on traditional server platforms and highly parallel architectures such as Intel Xeon Phi.arXiv:1804.03326oai:cds.cern.ch:23154782018-04-09
spellingShingle cs.DC
Computing and Computers
Amadio, Guilherme
Bockelman, Brian
Canal, Philippe
Piparo, Danilo
Tejedor, Enric
Zhang, Zhe
Increasing Parallelism in the ROOT I/O Subsystem
title Increasing Parallelism in the ROOT I/O Subsystem
title_full Increasing Parallelism in the ROOT I/O Subsystem
title_fullStr Increasing Parallelism in the ROOT I/O Subsystem
title_full_unstemmed Increasing Parallelism in the ROOT I/O Subsystem
title_short Increasing Parallelism in the ROOT I/O Subsystem
title_sort increasing parallelism in the root i/o subsystem
topic cs.DC
Computing and Computers
url https://dx.doi.org/10.1088/1742-6596/1085/3/032014
http://cds.cern.ch/record/2315478
work_keys_str_mv AT amadioguilherme increasingparallelismintherootiosubsystem
AT bockelmanbrian increasingparallelismintherootiosubsystem
AT canalphilippe increasingparallelismintherootiosubsystem
AT piparodanilo increasingparallelismintherootiosubsystem
AT tejedorenric increasingparallelismintherootiosubsystem
AT zhangzhe increasingparallelismintherootiosubsystem