Advanced brokers for nordugrid arc using web-services
DOI:
https://doi.org/10.15587/1729-4061.2013.14852Keywords:
Grid, Nordugrid ARC, load balancing, broker, web serviceAbstract
The development of science encourages an increase of experimental data, which subject to analysis to generate new knowledge. The current volume of computations often exceeds the capacities of a cluster to calculate for a satisfactory time; hence, it is necessary to distribute the computation of such amounts of data using the GRID systems.
For the load balancing in such systems, the special mechanisms - brokers – are used. They implement a policy, under which such a system allocates tasks among computing resources according to the workload of computational resources in the system or according to properties of a task.
To implement the algorithm of balancing the broker must take into account enough factors to find the most appropriate resource that is able to perform the task with the lowest possible load, or in minimal time. At the same time, regular news sources of the software that serves GRID system and extras not included in the standard package of the software can be used.
The aim of this work is to develop strategies and architectures for distributed broker in Nordugrid ARC 2.0 using advanced possibilities of this platform - web services that run on the basis of the software platform and extend the functionality of the cluster software. The strategies developed should be of general purpose, therefore, they should not rely only on a certain type of tasks distributed among the available resources.
References
- Петренко, А. Алгоритм оцінки завантаженості ГРІД-сайту [Текст] / А. Петренко, С. Свістунов, П. Свірін // Матеріали конференції«Системний аналіз та інформаційні технології», 23-28 мая 2011. - г. Киев, Украина - 388c.
- Chao-Tung, Y. A Grid Resource Broker with Network Bandwidth-Aware Job Scheduling for Computational Grids. [Текст] / Y. Chao-Tung, C. Sung-Yi, C. Tsui-Ting // Advances in Grid and Pervasive Computing – 2007. - Vol. 4459 - pp. 1 - 12.
- Nordugrid ARC. [Електронний ресурс]. - Режим доступу: http://www.nordugrid.org.
- Загородний, А. Украинский академический грид [Текст] / А. Загородний, Г. Зиновьев, Е. Мартынов, С. Свистунов // Українсько-македонський науковий збірник, Вип. 4 - Київ: Вид-во Національна бібліотека України імені В.І.Вернадського, 2009. - С.140-150.
- Read, A. Complete Distributed Computing Environment for a HEP Experiment: Experience with ARC-Connected Infrastructure for ATLAS. [Електронний ресурс] / A. Read, A. Taga, F. Ould-Saada, K. Pajchel, B. H. Samset, D. Cameron. - Режим доступу: http://www.nordugrid.org/documents/chep07-atlas.pdf
- Kennedy, J. ATLAS Production System. [Електронний ресурс]. - Режим доступу: http://www.etp.physik.uni-muenchen.de/dokumente/talks/jkennedy_dpg07.pdf
- Werner, J. Grid computing in High Energy Physics using LCG: the BaBar experience. [Електронний ресурс]. - Режим доступу: http://www.gridpp.ac.uk/papers/ahm06_werner.pdf
- Boyanov, L. On the employment of LCG GRID middleware. [Електронний ресурс]. / L. Boyanov, P. Nenkova. - Режим доступу: http://ecet.ecs.ru.acad.bg/cst05/Docs/cp/SII/II.11.pdf
- Петренко, А. Гібридний алгоритм брокера для Nordugrid ARC 2.0. [Текст] / А. Петренко, С. Свістунов, П. Свірін // Матеріали конференції HPC UA, 8-12 жовтня, 2012, Київ, Україна - с. 275.
- Raicu, I. Towards Data IntensiveMany-Task Computing. Data Intensive Distributed Computing: Challenges and Solutions for Large-Scale Information Management. [Текст] / I. Raicu, I. Foster et al. -IGI Global Publishers, 2009 - 352 pages.
- Klusacek, D. Alea - Grid Scheduling Simulation Environment. [Текст] / D. Klusacek, L. Matyska, H. Rudova. // Lecture Notes in Computer Science – 2008. - pp. 1029 – 1038.
- ARC peer-to-peer information system. [Електронний ресурс]. - Режим доступу: http://www.nordugrid.org/documents/infosys_technical.pdf
- Buyya, R. GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing. [Текст] / R. Buyya, M. Murshed. // CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE – 2002. - Vol. 14, No.13 - pp.1175—1220.
- Petrenko, A., Svistunov, S., Svirin, P. (2011). The Algorithm for Grid Site Load Evaluation. Proceedings of 13th conference «System Analysis And Information Technologies», 388.
- Chao-Tung, Y., Sung-Yi, C.,Tsui-Ting, C. (2007) A Grid Resource Broker with Network Bandwidth-Aware Job Scheduling for Computational Grids. Advances in Grid and Pervasive Computing, 4459, 1.
- NordugridARC. http://www.nordugrid.org.
- Zagorodniy, A., Zinovyev, G., Martynov, E., Svistunov, S. UkrainskiyakademicheskiyGrid. Ukrayins'ko makedons'kiy naukovi yzbirnyk, 2009, 4, 140.
- Read, A., Taga, A.,Ould-Saada, F., Pajchel, K., Samset, B., Cameron, D. Complete Distributed Computing Environment for a HEP Experiment: Experience with ARC-Connected Infrastructure for ATLAS. http://www.nordugrid.org/documents/chep07-atlas.pdf.
- Kennedy, J. ATLAS Production System. http://www.etp.physik.uni-muenchen.de/dokumente/talks/jkennedy_dpg07.pdf.
- Werner, J. Grid computing in High Energy Physics using LCG: the BaBar experience. http://www.gridpp.ac.uk/papers/ahm06_werner.pdf.
- Boyanov, L.,Nenkova,P. On the employment of LCG GRID middleware. http://ecet.ecs.ru.acad.bg/cst05/Docs/cp/SII/II.11.pdf.
- Petrenko, A., Svistunov, S., Svirin, P. (2012). Hybrid Broker Algorithm forNordugrid ARC 2.0. Proceedings of HPCUAConference, 275.
- Raicu, I., Foster, I. (2009)Towards Data Intensive Many-Task Computing. Data Intensive Distributed Computing: Challenges and Solutions for Large-Scale Information Management, IGI Global Publishers, 352.
- Klusacek, D., Matyska, L., Rudova, H. (2008) Alea-Grid
- Scheduling Simulation Environment. Lecture Notes in Computer Science, 1029.
- ARC peer-to-peer information system. http://www.nordugrid.org/documents/infosys_technical.pdf
- Buyya, R., Murshed, M. GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing / R. Buyya. CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE, 2002, Vol. 14, No.13, pp.1175—1220.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 Anatoly Ivanovich Petrenko, Sergiy Yakovich Svistunov, Pavlo Volodymyrovych Svirin
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.