Development of information technology of tasks distribution for grid-systems using the grass simulation environment
DOI:
https://doi.org/10.15587/1729-4061.2016.71892Keywords:
distributed systems, GRID-system scheduler (broker), information technology, GRASS environment, computing resources, allocation policyAbstract
An information distribution task technology for GRID-systems based on the use of simulation modeling GRASS environment was proposed. GRASS reproduces the process of functioning over time of elementary events that occur in the GRID-system with maintaining their interaction logic. This solution enables conducting of computational experiments that implement different methods of distribution, with a following selecting of the most effective solution on the basis of the collection, analysis and interpretation of simulation results.
The proposed task of distribution technology using simulation modeling GRASS environment, enables implementing multiple distribution methods and selecting the best distribution environment that increases the efficiency of GRID-systems by reducing the time of the task performance and reducing the downtime of resources in highly related tasks.
GRASS modeling environment has a modular structure, which consists of a core and dynamically loaded modules (plug-ins). Each module performs a highly specialized task, referring if necessary to the other modules of the system. The core provides means of inter-module interaction and provides boot and system configuration.
References
- Aida, K., Casanova, H. (2008). Scheduling mixed-parallel applications with advance reservations. Proceedings of the 17th International Symposium on High Performance Distributed Computing – HPDC ’08, 65–74. doi: 10.1007/s10586-009-0073-3
- Ando, S., Aida, K. (2007) Evaluation of Scheduling Algorithms for Advance Reservations. Information Processing Society of Japan SIG Notes. HPC-113, 37–42.
- Elmroth, E., Tordsson, J. (2009). A standards-based Grid resource brokering service supporting advance reservations, coallocation, and cross-Grid interoperability. Concurrency and Computation: Practice and Experience, 21 (18), 2298–2335. doi: 10.1002/cpe.1441
- Cafaro, M., Mirto, M., Aloisio, G. (2012). Preference–Based Matchmaking of Grid Resources with CP–Nets. Journal of Grid Computing, 11 (2), 211–237. doi: 10.1007/s10723-012-9235-2
- Kurowski, K., Nabrzyski, J., Oleksiak, A., Węglarz, J. (2004). Multicriteria Aspects of Grid Resource Management. International Series in Operations Research & Management Science, 271–293. doi: 10.1007/978-1-4615-0509-9_18
- Ernemann, C., Hamscher, V., Yahyapour, R.; Feitelson, D. G., Rudolph, L., Schwiegelshohn, U. (Eds.) (2002). Economic Scheduling in Grid Computing. Lecture Notes in Computer Science, 2537, 128–152. doi: 10.1007/3-540-36180-4_8
- Rodero, I., Villegas, D., Bobroff, N., Liu, Y., Fong, L., Sadjadi, S. M. (2013). Enabling Interoperability among Grid Meta-Schedulers. Journal of Grid Computing, 11 (2), 311–336. doi: 10.1007/s10723-013-9252-9
- Azzedin, F., Maheswaran, M., Arnason, N. (2004). A Synchronous Co-Allocation Mechanism for Grid Computing Systems. Cluster Computing, 7 (1), 39–49. doi: 10.1023/b:clus.0000003942.73875.29
- Castillo, C., Rouskas, G. N., Harfoush, K. (2009) Resource Co-allocation for Large-scale Distributed Environments. 18th ACM International Symposium on High Performance Distributed Compuing, ACM, 137–150.
- Takefusa, A., Nakada, H., Kudoh, T., Tanaka, Y.; Frachtenberg, E., Schwiegelshohn, U. (Eds.) (2010). An Advance Reservation-based Co-allocation Algorithm for Distributed Computers and Network Bandwidth on QoS-guaranteed Grids. Lecture Notes in Computer Science, 6253, 16–34. doi: 10.1007/978-3-642-16505-4_2
- Blanco, H., Guirado, F., Lérida, J. L., Albornoz, V. M. (2012). MIP Model Scheduling for Multiclusters. Lecture Notes in Computer Science, 7640, 196–206. doi: 10.1007/978-3-642-36949-0_22
- Garg, S. K., Konugurthi, P., Buyya, R. (2011). A linear programming-driven genetic algorithm for meta-scheduling on utility grids. International Journal of Parallel, Emergent and Distributed Systems, 26 (6), 493–517. doi: 10.1080/17445760.2010.530002
- Olteanu, A., Pop, F., Dobre, C., Cristea, V. (2012). A dynamic rescheduling algorithm for resource management in large scale dependable distributed systems. Computers & Mathematics with Applications, 63 (9), 1409–1423. doi: 10.1016/j.camwa.2012.02.066
- Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D. (2014). Slot selection algorithms in distributed computing. The Journal of Supercomputing, 69 (1), 53–60. doi: 10.1007/s11227-014-1210-1
- Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D. (2013). Slot Selection Algorithms in Distributed Computing with Non-dedicated and Heterogeneous Resources. Parallel Computing Technologies, 120–134. doi: 10.1007/978-3-642-39958-9_10
- Toporkov, V. V., Bobchenkov, А. V., Yemelyanov, D. M., Tselishchev А. S. (2014). Metodi i evristiki planirovaniya v raspredelenih vichisleniyah s neotchujdaemimi resursami. Vestnik UUrGU, seriya «Vichislitelnaya matematika i informatika», 3 (2), 43–62.
- Toporkov, V. V., Yemelyanov, D. M., Toporkova, A. S. (2016). Metaplanirovanie vichisleniy v raspredelennih sredah s neotchuzhdaemimi resursami. Informacionnie tehnologii v nauke, obrazovanii i upravlenii. IT + S&E`16, 22–31.
- Kostromin, R. O. (2015). Modeli, metodi i sredstva upravleniya vichisleniyami v integrirovannoy klasternoy sisteme. Fundamentalnii issledovaniya, 6, 35–38.
- Feoktistov, A. G. (2015). Metodoligia konceptualizacii i klassifikacii potokov zadaniy masshtabiruemih prilozheniy v raznorodnoi raspredelennoy vichislitelnoi srede. Sistemi upravleniya, svjazi i bezopasnosti, 4, 1–25.
- Venugopal, S., Buyya, R., Winton, L. (2006). A Grid service broker for scheduling e-Science applications on global data Grids. Concurrency and Computation: Practice and Experience, 18 (6), 685–699. doi: 10.1002/cpe.974
- Astrikov, D. U., Kuzmin, D. A., Panacuk, A. I. (2014). Modelirovanie sistemi planirovaniya raspredelennogo visokoproizvoditelnogo vichislitelnogo kompleksa. Dokladi Akademii nauk Vissheiy shkoli Rossiyskoi federazii, 2-3 (23-24), 34–41.
- Milukov, V. V., Sosnovskiy, U. V. (2013). Modelirovanie fragmentov GRID-sistemi v simulatore GridSim. Optimizaciya virobnichih procesiv, 14, 218–222.
- Volk, M. A., Gorenkov, A. S., Gridel, R. N. (2010). Arhitektura imitatsionnoy modeli GRID-sistemyi, osnovannaya na podklyuchaemyih modulyah. Sistemi obrobki informatsii, 1 (82), 17–20.
- Filimonchuk, T. V., Tkachev, V. N. (2015). Informatsionnaya tehnologiya raspredeleniya zadaniy na vyichislitelnyie resursyi v GRID-sistemah. Informatika, matematicheskoe modelirovanie, ekonomika, 1, 204–209.
- Volk, M. A. (2009). Struktura programmnogo kompleksa imitatsionnogo modelirovaniya elementov GRID-sistem dlya nauchnyih issledovaniy. Sistemi obrobki Informatsii, 3 (77), 125–128.
- Volk, M. A., Filimonchuk, M. A., Filimonchuk, T. V. (2012). Modul raspredeleniya zadaniy v GRID-sistemah. Sistemi obrobki informatsii, 2 (100), 177–182.
- Volk, M. A., Filimonchuk, T. V. (2013). Obobschennyiy kriteriy otsenki zadaniya dlya tehnologii planirovaniya zadaniy v GRID. In 3 volumes. Vol. 2. Informatika, matematicheskoe modelirovanie, ekonomika, 172–176.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2016 Tetiana Filimonchuk, Maksym Volk, Ihor Ruban, Vitalii Tkachov
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.