Skip to main content
SpringerLink
Log in

Secure and efficient high-performance PROOF-based cluster system for high-energy physics

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The particle detectors at the LHC produced about 25 PB data in a year, and the total size of data recorded on tape media at the CERN data center reached almost 100 PB in 2013. In order to preserve such a large-scale data safely and process them fast and efficiently, the collaboration of the data centers around the world (WLCG) was founded. The overall performance of the WLCG has strong site-dependency, and the time scale for the result is unpredictable. In this paper, we introduce PROOF developed for providing high performance and reliable environment for the user analysis task to complement the grid computing, and we provide a new Linux cluster (KIAF), by deploying PROOF. The KIAF cluster provides data access in low latency and secure connection with the clients. In order to find the correlation between the processing performance and the scalability of KIAF, we perform a simple analysis task counting the number of particles in the data on KIAF by varying the number of worker nodes from 1 to 96. We show that the linear scalability of performance of KIAF and its limitation as a function of the number of workers participating in processing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. Stands for “Conseil Européen pour la Recherche Nucléaire”s (French).

  2. Korea Institute of Science and Technology Information.

  3. Joint Institute for Nuclear Research.

  4. Stands for “Laboratoire de physique SUBatomique et des TECHnologies associées” (French).

References

  1. Evans L, Bryant P (2008) LHC machine. J Instrum 3:S08001

    Google Scholar 

  2. The ALICE Collaboration (2008) The ALICE experiment at the CERN LHC. J Instrum 3:S08002

  3. The ATLAS Collaboration (2008) The ATLAS experiment at the CERN large hadron collider. J Instrum 3:S08003

    Google Scholar 

  4. The CMS Collaboration (2008) The CMS experiment at the CERN LHC. J Instrum 3:S08004

  5. The LHCb Collaboration (2008) The LHCb detector at the LHC. J Instrum 3:S08005

    Google Scholar 

  6. CERN. Models of networked analysis at regional centres for LHC experiments. http://monarc.web.cern.ch/MONARC/

  7. Bird I (2011) Computing for the large hadron collider. Annu Rev Nucl Part Sci 61:99–118

    Article  Google Scholar 

  8. The ATLAS Collaboration (2012) Observation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC. Phys Lett B 716:1–29

    Google Scholar 

  9. The CMS Collaboration (2012) Observation of a new boson at a mass of 125 GeV with the CMS experiment at the LHC. Phys Lett B 716:30–61

    Google Scholar 

  10. Ballintijn M et al (2006) Parallel interactive data analysis with PROOF. In: Proceeding(s) of ACAT05 workshop, nuclear instruments and methods in physics research section A. vol 559, pp 13–16

  11. Brun R, Rademakers F (1997) ROOT—an object oriented data analysis framework. In: Proceedings AIHENP’96 workshop, nuclear instruments and methods in physics research section A, vol 389, pp 81–86 (1997). See also http://root.cern.ch/

  12. The ALICE Collaboration (2012) Letter of intent for the upgrade of the ALICE experiment. CERN-LHCC-2012-012, LHCC-I-022

  13. Antcheva I et al (2009) ROOT—A C++ framework for petabyte data storage, statistical analysis and visualization. Comput Phys Commun 180:2499–2512

    Article  Google Scholar 

  14. Ganis G, Iwaszkiewicz J, Rademakers F (2007) Scheduling and Load Balancing in the Parallel ROOT Facility (PROOF). In: Proceedings of science (ACAT) 022

  15. Buncic P et al (2010) CernVM a virtual software appliance for LHC applications. J Phys Conf Ser 219:042003

    Article  Google Scholar 

  16. Hanushevsky A, Wang DL, Scalla: Structured cluster architecture for low latency access. 2012 IEEE 26th, international parallel and distributed processing symposium workshops and Ph.D. Forum (IPDPSW), pp 1168–1175 (2012)

  17. California Institute of Technology. Monitoring agents using a large integrated services architecture. http://monalisa.caltech.edu/monalisa.htm

Download references

Acknowledgments

This work was supported by the National Research Foundation of Korea (NRF) through contract N-13-NM-IR04.

Author information

Authors and Affiliations

  1. Global Science Experiment Data Hub Center, Korea Institute of Science and Technology Information, Daejeon, Korea

    Sang Un Ahn, Il Yeon Yeo & Sang Oh Park

Authors
  1. Sang Un Ahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Il Yeon Yeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sang Oh Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sang Oh Park.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ahn, S.U., Yeo, I.Y. & Park, S.O. Secure and efficient high-performance PROOF-based cluster system for high-energy physics. J Supercomput 70, 166–176 (2014). https://doi.org/10.1007/s11227-014-1146-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-014-1146-5

Keywords

Search

Navigation