Dynamic Programming and Greedy Heuristic in the Load Balancing Problem for the iFDAQ of the COMPASS Experiment at CERN
Authors: 
Ondrej Subrt, Martin Bodlak, Vladimir Jary, Antonin Kveton, Josef Novy, Miroslav Virius, Martin ZemkoAuthors Info & Claims
Ondrej Subrt, Martin Bodlak, Vladimir Jary, Antonin Kveton, Josef Novy, Miroslav Virius, Martin ZemkoAuthors Info & ClaimsPages 283 - 294
Abstract
Recently, a successful data taking in high energy physics experiments heavily relies on a stability of Data Acquisition System (DAQ). The paper deals with the Load Balancing (LB) problem of the intelligent, FPGA-based Data Acquisition System (iFDAQ) of the COMPASS experiment at CERN and presents two approaches –Dynamic Programming (DP) and Greedy Heuristic (GH) – applied in finding LB optimal solution. DP represents a pure mathematical approach in terms of a mathematical optimization and GH is a representative belonging to a class of heuristics. Therefore, the mutual comparison is worth investigating. In order to demonstrate the performance of the proposed DP and GH approaches, three LB test cases are examined and the numerical results are compared with other LB solution methods.
References
[1]
F. Vadim Yu. Alexakhin 2010. COMPASS-II Proposal. The COMPASS Collabo- ration. CERN-SPSC-2010-014, SPSC-P-340.
[2]
F. Y. Bai 2016. Overview and Future Developments of the FPGA-based DAQ of COMPASS. Journal of Instrumentation 11, 02 (2016), C02025. http://stacks.iop. org/1748-0221/11/i=02/a=C02025
[3]
F. M. Bodlak 2013. New data acquisition system for the COMPASS experiment. Journal of Instrumentation 8, 02 (2013), C02009. http://stacks.iop.org/1748-0221/ 8/i=02/a=C02009
[4]
F. Martin Bodlak 2014. FPGA based data acquisition system for COMPASS experiment. Journal of Physics: Conference Series 513, 1 (2014), 012029. http://stacks.iop.org/1742-6596/513/i=1/a=012029
[5]
F. Martin Bodlak 2016. Development of new data acquisition system for COMPASS experiment. Nuclear and Particle Physics Proceedings 273, Supplement C (2016), 976–981. https://doi.org/10.1016/j.nuclphysbps.2015.09.153 37th International Conference on High Energy Physics (ICHEP).
[6]
F. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (third ed.). The MIT Press, Cambridge, Massachusetts, USA. 1292 pages. ISBN 978-0-262-03384-8.
[7]
F. The COIN-OR Foundation. 2020. Documentation of the COIN-OR project. The COIN-OR Foundation. https://www.coin-or.org/Doxygen/CoinAll/
[8]
F. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness (first ed.). W. H. Freeman, San Francisco. 338 pages. ISBN 0-7167-1045-5.
[9]
F. Hisao Kameda, Jie Li, Chonggun Kim, and Yongbing Zhang. 1997. Optimal Load Balancing in Distributed Computer Systems (first ed.). Springer-Verlag London, London, UK. 251 pages. https://doi.org/10.1007/978-1-4471-0969-3
[10]
F. H. Kellerer, U. Pferschy, and D. Pisinger. 2004. Knapsack Problems (first ed.). Springer-Verlag GmbH, Heidelberg, Germany. 548 pages. ISBN 978-3-540-24777- 7.
[11]
F. Richard E. Korf. 2009. Multi-Way Number Partitioning. In Proceedings of the 21st International Jont Conference on Artifical Intelligence (Pasadena, California, USA) (IJCAI’09). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 538–543.
[12]
F. MathWorks. 2020. Documentation of MATLAB function intlinprog. MathWorks. https://ch.mathworks.com/help/optim/ug/intlinprog.htm
[13]
F. James A. Momoh. 2017. Electric Power System Applications of Optimization (second ed.). CRC Press, Boca Raton, Florida. 602 pages. ISBN 9781351834841.
[14]
F. Moshe Sniedovich. 2010. Dynamic Programming: Foundations and Principles (second ed.). CRC Press, Boca Raton, Florida. 624 pages. ISBN 978-0-8247-4099-3.
[15]
F. D. Steffen 2018. Intelligence Elements and Performance of the FPGA-based DAQ of the COMPASS Experiment. Proceedings of Science TWEPP-17 (March 2018), 127.
[16]
F. Ondrej Subrt 2020. Reinforcement Learning in the Load Balancing Problem for the iFDAQ of the COMPASS Experiment at CERN. In Proceedings of the 12th International Conference on Agents and Artificial Intelligence (Valletta, Malta) (ICAART 2020). SciTePress, Setúbal, Portugal, 734–741.
Index Terms
- Dynamic Programming and Greedy Heuristic in the Load Balancing Problem for the iFDAQ of the COMPASS Experiment at CERN
Index terms have been assigned to the content through auto-classification.
Recommendations
A greedy hyper-heuristic in dynamic environments
GECCO '09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking PapersIf an optimisation algorithm performs a search in an environment that changes over time, it should be able to follow these changes and adapt itself for handling them in order to achieve good results. Different types of dynamics in a changing environment ...
A tabu search heuristic for the dynamic space allocation problem
The dynamic space allocation problem (DSAP) presented here is a relatively new problem in the literature. It looks at the optimization of space/resource assignments during the implementation of project activities. More specifically, the DSAP assigns ...
A heuristic technique to improve energy efficiency with dynamic load balancing
Heterogeneous computers require a well-distributed workload to operate efficiently. When possible, this load balancing procedure should redistribute the workload with minimal knowledge of the system architecture, to reduce overhead. We propose a generic ...
Comments
Information & Contributors
Information
Published In
February 2021
644 pages
ISBN:9781450389839
DOI:10.1145/3459104
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 July 2021
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ISEEIE 2021
ISEEIE 2021: 2021 International Symposium on Electrical, Electronics and Information Engineering
February 19 - 21, 2021
Seoul, Republic of Korea
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 27Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format