Article

Article title PROGNOSIS OF A RESOURCE ENCLOSURE IN THE PROCESS OF SCHEDULING IN GRID-SYSTEMS WITH CENTRALIZED ARCHITECTURE
Authors A.E. Saak
Section SECTION VI. COMPUTER COMPLEXES OF NEW GENERATION AND NEUROCOMPUTERS
Month, Year 07, 2014 @en
Index UDC 004.272.43
DOI
Abstract Previous author’s works were dedicated to the problem of localization of continuous linear polyhedron of resource rectangles (a graphic illustration of user tasks) in a resource square (a graphic illustration of Grid-system) with minimization of the heuristic measure of the resource enclosure. The heuristic algorithms of scheduling were proposed and explored. They were adapted to the appropriate kind of requirements: the circular, hyperbolic or parabolic quadratic type. The parameters of the concrete resource enclosure were defined for the algorithms. Prognosis of resource enclosure behaviour in the situation of task queue power growth is the point of interest. In the paper for Grid-systems with centralized architecture which support multisite task performance, it is considered the problem of prognostic values definition of quadratic resource frame parameters in which the circular-type task queue could be localized. Prognosis of the values of square resource frame parameters in which the circular-type task queue could be localized stands the statistic test. That allows to apply practically heuristic scheduling in Grid-systems.

Download PDF

Keywords Grid-system; scheduling; circular-type quadratic task queue; initial ring algorithm; resource enclosure prognosis.
References 1. Kahanwal B., Singh T. The distributed computing paradigms: p2p, grid, cluster, cloud, and jungle, International Journal of Latest Research in Science and Technology. 2012, Vol. 1, Issue 2, pp. 183-187.
2. Foster I., Kesselman C. The grid: blueprint for a new computing infrastructure. Morgan Kaufmann Publishers Inc., USA. 1998.
3. Weiss A. Computing in the clouds, Networker, 2007, Vol. 11, No. 4, pp. 16-25.
4. Seinstra F., Maassen J., Nieuwpoort R., Drost N., Kessel T., Werkhoven B., Urbani J., Jacobs C., Kielmann T., Bal H. Jungle computing: Distributed supercomputing beyond clusters, grids, and clouds. In M. Cafaro, G. Aloisio (eds.), Grids, Clouds and Virtualization, Computer Communications and Networks. Springer London, 2011, pp. 167-197.
5. Magoulиs F., Nguyen T., Yu L. Grid resource management: toward virtual and services compliant grid computing, Numerical analysis and scientific computing. CRC Press, UK. 2009.
6. Magoulиs F. (ed.). Fundamentals of grid computing: theory, algorithms and technologies, Numerical analysis and scientific computing. CRC Press, UK. 2010.
7. Antonopoulos N., Exarchakos G., Li M., Liotta A. (eds.). Handbook of research on p2p and grid systems for service-oriented computing: models, methodologies and applications. IGI Global publisher, USA. 2010.
8. Cafaro M., Aloisio G. (eds.). Grids, clouds and virtualization, Computer Communications and Networks. Springer London. 2011.
9. Schwiegelshohn U., Badia R., Bubak M., Danelutto M., Dustdar S., Gagliardi F., Geiger A., Hluchy L., Kranzlmьller D., Laure E., Priol T., Reinefeld A., Resch M., Reuter A., Rienhoff O., Rьter T., Sloot P., Talia D., Ullmann K., Yahyapour R., Voigt G. Perspectives on grid computing, Future Generation Computer Systems, 2010, No. 26, pp. 1104-1115.
10. Kovalenko V.N., Koryagin D.A. Grid: istoki, printsipy i perspektivy razvitiya [Grid: origins, principles and prospects of development], Informatsionnye tekhnologii i vychislitelnye sistemy [Information technologies and computing systems], 2008, No. 4, pp. 38-50.
11. Kovalenko V.N., Koryagin D.A. Bazovye printsipy i sposoby primeneniya grida [The basic principles and applications of grid], Programmirovanie [Programming], 2009, No. 1, pp. 26-49.
12. Vasenin V.A., Shundeev A.S. Evolyutsiya tekhnologii Grid [The evolution of Grid technologies] Informatsionnihe tekhnologii [Information Technologies], 2012, No. 1, pp. 2-9.
13. Barskiy A.B. Grid-vychisleniya: organizatsiya, metody, planirovanie [Grid computing: the organization, methods, planning]. LAP Lambert Academic Publishing, Germany. 2012.
14. Pugliese A., Talia D., Yahyapour R. Modeling and Supporting Grid, Scheduling J. Grid Computting, 2008, No. 6, pp. 195-213.
15. Li M., Baker M. (2005). The grid: core technologies. John Wiley & Sons Ltd, England.
16. Hamscher V., Schwiegelshohn U., Streit A., Yahyapour R. Evaluation of job-scheduling strategies for grid computing. In Proceedings of the 7th International Conference on High Performance Computing, HiPC-2000, volume 1971 of Lecture Notes in Computer Science. Indiа, 2000. Springer, pp. 191-202.
17. Rahman M., Ranjan R., Buyya R., Benatallah B. A taxonomy and survey on autonomic management of applications in grid computing environments, Concurrency Computat: Pract. Exper, 2011, No. 23, pp. 1990-2019.
18. Krauter K., Buyya R., Maheswaran M. A taxonomy and survey of Grid resource management systems for distributed computing, Softw. Pract. Exper, 2002, Vol. 32, No. 2, pp. 135-164.
19. Iosup A., Epema D. H. J., Tannenbaum T., Farrellee M., Livny M. (2007). Inter-operating Grids through delegated matchmaking. In 2007 ACM, IEEE Conference on Supercomputing (SC 2007) New York: ACM Press, pp. 1-12.
20. Patel S. Survey Report of Job Scheduler on Grids, International Journal of Emerging Research in Management &Technology, 2013, Vol. 2, No. 4, pp. 115-125.
21. Saak A.Eh. Polinomialnye algoritmy raspredeleniya resursov v Grid-sistemakh na osnove kvadratichnoy tipizatsii massivov zayavok [Polynomial algorithms for resource allocation in Grid-based systems for quadratic typing, arrays applications], Informacionnye tekhnologii [Information Technologies], 2013, No. 7. Prilozhenie, 32 p.
22. Saak A.Eh. Lokalno-optimalnyy sintez raspisaniy dlya Grid-tekhnologiy [Locally optimal synthesis schedules for Grid-technologies], Informatsionnye tekhnologii [Information Technologies], 2010, No. 12, pp. 28-34.
23. Saak A.Eh. Lokalno-optimalnye resursnye raspredeleniya [Locally optimal resource allocation], Informatsionnihe tekhnologii [Information Technologies], 2011, No. 2, pp. 28-34.
24. Saak A.Eh. Algoritmy dispetcherizatsii v Grid-sistemakh na osnove kvadratichnoy tipizatsii massivov zayavok [Algorithms scheduling in Grid-based systems for quadratic typing, arrays applications], Informatsionnye tekhnologii [Information Technologies], 2011, No. 11, pp. 9-13.
25. Saak A.Eh. Tsentralno-koltsevoy algoritm dispetcherizatsii massivami zayavok giperbolicheskogo tipa [Central ring algorithm dispatching arrays applications of hyperbolic type], Izvestiya YuFU. Tekhnicheskie nauki [Izvestiya SFedU. Engineering Sciences], 2012, No. 8 (133), pp. 214-222.
26. Saak A.Eh. Dispetcherizatsiya v GRID-sistemakh na osnove odnorodnoy kvadratichnoy tipizatsii massivov zayavok polzovateley [Scheduling in GRID-systems on the basis of homogeneous quadratic typing, arrays of user requests], Informatsionnye tekhnologii [Information Technologies], 2012, No. 4, pp. 32-36.
27. Saak A.Eh. Polinomialnaya dispetcherizatsiya krugovym tipom massiva zayavok polzovateley [Polynomial dispatching a circular array of user requests], Superkompyuternye tekhnologii (SKT-2012): Materialy 2-y Vseross. nauch.-tekhn. konf. [Supercomputer technologies (SKT-2012): proceedings of the 2nd all-Russian scientific tehnicheskoy conference]. Rostov-na-Donu: Izd-vo YuFU, 2012, pp. 169-173.
28. Saak A.Eh. Sravnitelnihy analiz polinomialnykh algoritmov dispetcherizatsii v GRID-sistemakh [Comparative analysis of polynomial algorithms for scheduling in GRID-systems], Informatsionnye tekhnologii [Information Technologies], 2012, No. 9, pp. 28-32.
29. Saak A.Eh. Polinomialnye algoritmy dispetcherizatsii na osnove kvadratichnoy tipizatsii massivov zayavok polzovateley [Polynomial algorithms based dispatching quadratic typing, arrays of user requests], Trudy VI Mezhdunarodnoy konferentsii «Parallelnye vychisleniya i zadachi upravleniya» RASO’2012. Moskva, 24 oktyabrya - 26 ok-tyabrya 2012 g [Proceedings
of VI International conference "Parallel computations and control problems" RASO'2012. Moscow, 24 October - 26 October 2012]. Moscow: Institut problem upravleniya im. V.A. Trapeznikova RAN, 2012, pp. 341-347.
30. Saak A.Eh. Stupenchatyy algoritm dispetcherizatsii massivami zayavok parabolicheskogo tipa [The stepped algorithm dispatching arrays applications of parabolic type], Izvestiya YuFU. Tekhnicheskie nauki [Izvestiya SFedU. Engineering Sciences], 2013, No. 6 (143), pp. 139-145.
31. Saak A.Eh. Polinomialnye algoritmy dispetcherizatsii massivov zayavok giperbolicheskogo tipa [Polynomial algorithms dispatching array of applications hyperbolic type], Informatsionnye tekhnologii [Information Technologies], 2013, No. 3, pp. 33-36.
32. Saak A.Eh. Polinomialnye algoritmy dispetcherizatsii massivov zayavok parabolicheskogo tipa [Polynomial algorithms dispatching array of applications of parabolic type], Informatsionnye tekhnologii [Information Technologies], 2013, No. 5, pp. 25-29.
33. Saak A.Eh. Uglovoy algoritm dispetcherizatsii massivami zayavok krugovogo tipa [Angular algorithm dispatching arrays applications circular], Izvestiya YuFU. Tekhnicheskie nauki [Izvestiya SFedU. Engineering Sciences], 2013, No. 7 (144), pp. 147-152.
34. Saak A.Eh. Algoritm posledovatelnykh priblizheniy dispetcherizatsii massivami zayavok krugovogo tipa [The algorithm of successive approximations dispatching arrays applications circular], Materialy 6-y Vserossiyskoy multikonferentsii po problemam upravleniya MKPU-2013. Gelendzhik, 30 sentyabrya - 5 oktyabrya 2013 g [Materials of the 6th all-Russian
multiconference on the management of mcpu-2013. Gelendzhik, 30 September - 5 October 2013]. Rostov-on-Don: Izd-vo YuFU, 2013. Vol. 4, pp. 71-75.

Comments are closed.