{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:19:07Z","timestamp":1747887547250,"version":"3.41.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-StG-2019 Beauty2Charm","ERC-StG-2019 Beauty2Charm","ERC-StG-2019 Beauty2Charm"],"award-info":[{"award-number":["ERC-StG-2019 Beauty2Charm","ERC-StG-2019 Beauty2Charm","ERC-StG-2019 Beauty2Charm"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Softw Big Sci"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The upgraded Large Hadron Collider beauty (LHCb) experiment is the first detector based at a hadron collider using a fully software-based trigger. The first \u2018High Level Trigger\u2019 stage (HLT1) reduces the event rate from 30 MHz to approximately 1 MHz based on reconstruction criteria from the tracking system, and consists of <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathcal {O}(100)$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mn>100<\/mml:mn>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> trigger selections implemented on Graphics Processing Units (GPUs). These selections are further refined following the full offline-quality reconstruction at the second stage (HLT2) prior to saving for analysis. An automated bandwidth division has been performed to equitably divide this 1 MHz HLT1 Output Rate (OR) between the signals of interest to the LHCb physics program. This was achieved by optimizing a set of trigger selections that maximize efficiency for signals of interest to LHCb while keeping the total HLT1 readout capped to a maximum. The bandwidth division tool has been used to determine the optimal selection for 35 selection algorithms over 80 characteristic physics channels.<\/jats:p>","DOI":"10.1007\/s41781-025-00139-2","type":"journal-article","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T04:50:26Z","timestamp":1747803026000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An automated bandwidth division for the LHCb upgrade trigger"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3674-0812","authenticated-orcid":false,"given":"T.","family":"Evans","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3016-1879","authenticated-orcid":false,"given":"C.","family":"Fitzpatrick","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9199-8616","authenticated-orcid":false,"given":"J.","family":"Horswill","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,21]]},"reference":[{"key":"139_CR1","unstructured":"The LHC Experiments Committee, \u201cLHCb Trigger and Online Upgrade Technical Design Report,\u201d tech. rep., CERN, May (2014). https:\/\/cds.cern.ch\/record\/1701361"},{"issue":"05","key":"139_CR2","doi-asserted-by":"publisher","first-page":"P05065","DOI":"10.1088\/1748-0221\/19\/05\/P05065","volume":"19","author":"R Aaij","year":"2024","unstructured":"Aaij R, Akar S, JA, et al (2024) The LHCb Upgrade I. JINST 19(05):P05065","journal-title":"JINST"},{"key":"139_CR3","unstructured":"Bediaga I, Chanal H, Hopchev P, Cadeddu S, Stoica S, Calvo\u00a0Gomez M, T\u2019Jampens S, Machikhiliyan I, Guzik Z, Alves\u00a0Jr A et\u00a0al (2012) \u201cFramework TDR for the LHCb Upgrade: Technical Design Report,\u201d tech. rep., LHCb-TDR-012. https:\/\/cds.cern.ch\/record\/1443882\/files\/LHCB-TDR-012.pdf"},{"key":"139_CR4","unstructured":"Gligorov VV, Rodrigues E (2020) \u201cRTA and DPA Dataflow Diagrams for Run 1, Run 2, and the Upgraded LHCb Detector,\u201d http:\/\/cds.cern.ch\/record\/2730181\/"},{"key":"139_CR5","unstructured":"The LHC Experiments Committee, \u201cComputing Model of the Upgrade LHCb experiment,\u201d tech. rep., CERN, Geneva, (2018) https:\/\/cds.cern.ch\/record\/2319756"},{"key":"139_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s41781-020-00039-7","volume":"4","author":"R Aaij","year":"2020","unstructured":"Aaij R, Albrecht J, Belous eaM, (2020) Allen: a high-level trigger on GPUs for LHCb. Compuy Software Big Sci 4:7. https:\/\/doi.org\/10.1007\/s41781-020-00039-7","journal-title":"Compuy Software Big Sci"},{"issue":"04","key":"139_CR7","doi-asserted-by":"publisher","first-page":"P04006","DOI":"10.1088\/1748-0221\/14\/04\/P04006","volume":"14","author":"R Aaij","year":"2019","unstructured":"Aaij R, Benson S, De Cian M, Dziurda A, Fitzpatrick C, Govorkova E, Lupton O, Matev R, Neubert S, Pearce A, Schreiner H, Stahl S, Vesterinen M (2019) A comprehensive real-time analysis model at the LHCb experiment. JINST 14(04):P04006","journal-title":"JINST"},{"key":"139_CR8","unstructured":"Aaij R, Vom\u00a0Bruch D (2021) \u201cAllen Documentation.\u201d https:\/\/allen-doc.docs.cern.ch\/"},{"key":"139_CR9","doi-asserted-by":"publisher","first-page":"114198","DOI":"10.1109\/ACCESS.2024.3442573","volume":"12","author":"A Bailly-Reyre","year":"2024","unstructured":"Bailly-Reyre A, Bian L, Billoir P, P\u00e9rez DHC, Gligorov VV, Pisani F, Quagliani R, Scarabotto A, Bruch DV (2024) Looking forward: a high-throughput track following algorithm for parallel architectures. IEEE Access 12:114198\u2013114211. https:\/\/doi.org\/10.1109\/ACCESS.2024.3442573","journal-title":"IEEE Access"},{"key":"139_CR10","unstructured":"Aaij R, Akar S, JA et\u00a0al (2019) \u201cDesign and Performance of the LHCb Trigger and Full Real-time Reconstruction in Run 2 of the LHC,\u201d Journal of Instrumentationl. 14: P04013\u2013P04013. DOI: https:\/\/doi.org\/10.1088%2F1748-0221%2F14%2F04%2Fp04013"},{"key":"139_CR11","doi-asserted-by":"publisher","first-page":"P04006","DOI":"10.1088\/1748-0221\/14\/04\/P04006","volume":"14","author":"R Aaij","year":"2019","unstructured":"Aaij R, Benson S, Cian MD, Dziurda A, Fitzpatrick C, Govorkova E, Lupton O, Matev R, Neubert S, Pearce A, Schreiner H, Stahl S, Vesterinen M (2019) A comprehensive real-time analysis model at the LHCb experiment. J Instru 14:P04006\u2013P04006","journal-title":"J Instru"},{"key":"139_CR12","doi-asserted-by":"crossref","unstructured":"Brun R, Rademakers F (1997) \u201cROOT - An Object Oriented Data Analysis Framework.\u201d https:\/\/github.com\/root-project\/root\/","DOI":"10.1016\/S0168-9002(97)00048-X"},{"issue":"1","key":"139_CR13","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum L, Menon R (1998) OpenMP: an industry standard API for shared-memory programming. Comput Sci Eng IEEE 5(1):46\u201355. https:\/\/doi.org\/10.1109\/99.660313","journal-title":"Comput Sci Eng IEEE"},{"key":"139_CR14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3927.001.0001","author":"M Mitchell","year":"1996","unstructured":"Mitchell M (1996) An introduction to genetic algorithms. MIT Press. https:\/\/doi.org\/10.7551\/mitpress\/3927.001.0001","journal-title":"MIT Press"},{"key":"139_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-2766-4_8","volume-title":"Stochastic Gradient Descent","author":"N Ketkar","year":"2017","unstructured":"Ketkar N (2017) Stochastic Gradient Descent. Apress, Berkeley CA"},{"key":"139_CR16","unstructured":"JGraph (2021) \u201cDraw.io Online Diagram Editor,\u201d . https:\/\/www.diagrams.net\/"},{"key":"139_CR17","unstructured":"James F, Winkler M (2004) \u201cMINUIT User\u2019s Guide,\u201d . https:\/\/inspirehep.net\/literature\/1258345"},{"key":"139_CR18","volume-title":"Adam: a method for stochastic optimization","author":"DP Kingma","year":"2015","unstructured":"Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. CA USA, San Diego"},{"key":"139_CR19","unstructured":"Loshchilov I, Hutter F (2017) \u201cDecoupled Weight Decay Regularization,\u201d in International Conference on Learning Representations. https:\/\/api.semanticscholar.org\/CorpusID:53592270"}],"container-title":["Computing and Software for Big Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41781-025-00139-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41781-025-00139-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41781-025-00139-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T17:03:23Z","timestamp":1747847003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41781-025-00139-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,21]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["139"],"URL":"https:\/\/doi.org\/10.1007\/s41781-025-00139-2","relation":{},"ISSN":["2510-2036","2510-2044"],"issn-type":[{"value":"2510-2036","type":"print"},{"value":"2510-2044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,21]]},"assertion":[{"value":"20 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"7"}}