Survey on distributed computing technologies

A. V. Shamakina

Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, Tome 3 (2014) no. 3, pp. 51-85

Résumé

This paper presents an overview of distributed computing technologies from the perspective of the scheduling organization in grid and cloud environments. The architecture of the UNICORE platform, focused on ensuring a transparent secure access to resources of distributed computing environment, is considered. A general classification of scheduling algorithms in distributed computing environments and a classification of scheduling algorithms for independent tasks and jobs with dependencies between tasks are shown.

Détail

Keywords: distributed computing, problem-oriented distributed computing environments, Grid, UNICORE, scheduling algorithms, clustering algorithms, a directed acyclic graph, workflow.

Bibliographie

[1] R Buyya, D. Abramson et al., “Economic Models for Resource Management and Scheduling in Grid Computing”, Journal of Concurrency and Computation: Practice and Experience, 14:15 (2002), 1507–1542

[2] I. Foster, A. Roy, V. Sander, “A Quality of Service Architecture That Combines Resource Reservation and Application Adaptation”, Proceedings 8th Int. Workshop on Quality of Service (Pittsburgh, PA, USA, June 5–7, 2000), Carnegie Mellon University, 2000, 181–188

[3] I. Foster, C. Kesselman, S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations”, International Journal of Supercomputer Applications and High Performance Computing, 15:3 (2001), 200–222

[4] I. Foster, C. Kesselman, The Grid. Blueprint for a new computing infrastructure, Morgan Kaufman, San Francisco, 1999, 677 pp.

[5] R. Jennings, Cloud Computing with the Windows Azure Platform, Wiley Publishing, Inc., Indianapolis, Indiana, 2009, 360 pp.

[6] P. Marshall, K. Keahey, T. Freeman, “Improving Utilization of Infrastructure Clouds”, Cluster, Cloud and Grid Computing (CCGrid 2011): Proceedings of the IEEE ACM International Symposium (Newport Beach, CA, USA. May 23–26, 2011), IEEE Computer Society, 2011, 205–214

[7] NIST Special Publication 800–145. A NIST Definition of Cloud Computing } {\tt http://csrc.nist.gov/publications/nistpubs/

[8] D. Sanderson, Programming Google App Engine: Build and Run Scalable Web Apps on Google’s Infrastructure, O'Reilly Media, 2009, 400 pp.

[9] F. Dong, S. G. Akl, Scheduling algorithms for grid computing: State of the art and open problems, Technical Report No. 2006-504, Queen’s University, Canada, 2006, 55 pp.

[10] F. Berman, R. Wolski et al., “Application-Level Scheduling on Distributed Heterogeneous Networks”, Supercomputing: Proceedings of the ACM/IEEE conference (Pittsburgh, Pennsylvania USA, May 25–28, 1996), IEEE Computer Society, 1996, 39–39

[11] M. Iverson, F. Ozguner, “Dynamic, Competitive Scheduling of Multiple DAGs in a Distributed Heterogeneous Environment”, Proceedings of Seventh Heterogeneous Computing Workshop (Orlando, Florida USA, March 30, 1998), IEEE Computer Society, 1998, 70–78

[12] M. Maheswaran, S. Ali et al., “Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems”, Journal of Parallel and Distributed Computing, 59:2 (1999), 107–131

[13] Y. Zhu, L. M. Ni, Survey on Grid Scheduling Systems–Technical Report, Department of Computer Science and Engineering, Shanghai, Jiao, 2013 } {\tt http://www.cs.sjtu.edu.cn/~yzhu/reports

[14] K. Belhajjame, G. Vargas-Solar, C. Collet, “A flexible workflow model for process-oriented applications”, Proceedings of the Second International Conference, Web Information Systems Engineering (WISE 01) (Kyoto, Japan, December 3–6, 2001), IEEE Computer Society, 72–80

[15] Condor } {\tt http://www.cs.wisc.edu/condor

[16] G. Laszewski, I. Foster et al., “CoG Kits: A Bridge between Commodity Distributed Computing and High-Performance Grids”, Proceedings of the ACM Java Grande 2000 Conference (San Francisco, CA, USA, June 3–5, 2000), ACM Press pages 97–106, 2000

[17] E. Deelman, J. Blythe et al., “Pegasus: Mapping Scientific Workflows onto the Grid”, AcrossGrids Conference (AxGrids 2004): Proceedings of the Second European Conference (Nicosia, Cyprus, January 28–30, 2004), Springer, 2004, 11–26

[18] J. Cao, S. A. Jarvis et al., “GridFlow: Workflow Management for Grid Computing”, Cluster Computing and the Grid (CCGrid 03): Proceedings of the 3rd International Symposium (Tokyo, Japan, May 12–15, 2003), IEEE Computer Society, 2003, 198–205

[19] M. Wieczorek, R. Prodan, T. Fahringer, “Scheduling of Scientific Workflows in the ASKALON Grid Environment”, ACM SIGMOD Record, 34:3 (2005), 56–62

[20] S. J. Kim, A general approach to multiprocessor scheduling. Report TR-88-04. Department of Computer Science, University of Texas at Austin, 1988 } {\tt ftp://ftp.cs.utexas.edu/pub/techreports/

[21] T. Yang, A. Gerasoulis, “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors”, IEEE Transactions on Parallel and Distributed Systems, 5:9 (1994), 951–967

[22] M. Baker, R. Buyya, D. Laforenza, “Grids and Grid Technologies for Wide-area Distributed Computing”, Journal of Software-Practice Experience, 32:15 (2002), 1437–1466

[23] J. Schopf, Ten Actions When SuperScheduling, document of Scheduling Working Group, Global Grid Forum } {\tt http://www.ggf.org/documents/GFD.4.pdf

[24] F. Berman, R. Wolski et al., “Adaptive Computing on the Grid Using AppLeS”, IEEE Transactions on Parallel and Distributed Systems, 14:4 (2003), 369–382

[25] V. Hamscher, U. Schwiegelshohn et al., “Evaluation of Job-Scheduling Strategies for Grid Computing”, GRID 2000: Proceedings of the First IEEE ACM International Workshop (Bangalore, India, December 17, 2000), IEEE Computer Society, 2000, 191–202

[26] G. Mateescu, “Quality of Service on the Grid via Metascheduling with Resource Co-Scheduling and Co-Reservation”, International Journal of High Performance Computing Applications, 17:3 (2003), 209–218

[27] The Globus Toolkit } {\tt http://www.globus.org

[28] K. Czajkowski, S. Fitzgerald et al., “Grid Information Services for Distributed Resource Sharing”, High-Performance Distributed Computing (HPDC-10): Proceedings the 10th IEEE International Symposium (San Francisco, California, USA, August 7–9, 2001), IEEE Computer Society, 2001, 181–194

[29] A. A. Khokhar, V. K. Prasanna et al., “Heterogeneous Computing: Challenges and Opportunities”, IEEE Computer, 26:6 (1993), 18–27

[30] H. J. Siegel, H. G. Dietz, J. K. Antonio, “Software Support for Heterogeneous Computing”, ACM Computing Surveys, 28:1 (1996), 237–239

[31] K. Cooper, A. Dasgupta et al., “New Grid Scheduling and Rescheduling Methods in the GrADS Project”, International Parallel and Distributed Processing Symposium (IPDPS 04): Proceedings of the 18th International Symposium (Santa Fe, New Mexico USA, April 26–30, 2004), IEEE Computer Society, 2004, 199–206

[32] K. Czajkowski, I. Foster et al., “A Resource Management Architecture for Metacomputing Systems”, Proceedings of the 4th Workshop, Job Scheduling Strategies for Parallel Processing (JSSPP 1998) (Orlando, Florida USA, March 30, 1998), Springer, Lecture Notes in Computer Science, 1998, 62–82

[33] OpenPBS } {\tt http://www.openpbs.org

[34] Condor } {\tt http://www.cs.wisc.edu/condor

[35] R. Wolski, N. T. Spring, J. Hayes, “The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing”, Future Generation Computing Systems, 15:6 (1999), 757–768

[36] F. D. Sacerdoti, M. J. Katz et al., “Wide area cluster monitoring with Ganglia”, Cluster Computing (CLUSTER 2003): Proceedings of IEEE International Conference (Hong Kong, December 1–4, 2003), IEEE Computer Society, 2003 pages 289–298

[37] NIST Special Publication 800-145, A NIST Definition of Cloud Computing } {\tt http://csrc.nist.gov/publications/nistpubs

[38] A. Streit, “UNICORE: Getting to the heart of Grid technologies”, eStrategies, 3 (2009), 8–9

[39] A. Streit, “UNICORE - What lies beneath Grid functionality?”, eStrategies, 7 (2008), 38–39

[40] T. Casavant, J. Kuhl, “A Taxonomy of Scheduling in General-purpose Distributed Computing Systems”, IEEE Transactions on Software Engineering, 14:2 (1988), 141–154

[41] R. Braun, H. Siegel et al., “Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems”, Parallel and Distributed Computing, 61:6 (2001), 810–837

[42] H. Casanova, A. Legrand et al., “Heuristics for Scheduling Parameter Sweep Applications in Grid Environments”, Heterogeneous Computing Workshop (HCW 00): Proceedings of the 9th Workshop (Cancun, Mexico, May 1, 2000), IEEE Computer Society, 2000, 349–363

[43] S. Y. You, H. Y. Kim et al., “Task Scheduling Algorithm in GRID Considering Heterogeneous Environment”, Proceedings of the International Conference, Parallel and Distributed Processing Techniques and Applications (PDPTA 04) (Nevada, USA, June 21–24, 2004), CSREA Press, 2004, 240–245

[44] K. Kurowski, B. Ludwiczak et al., “Improving Grid Level Throughput Using Job Migration And Rescheduling”, Scientific Programming, 12:4 (2004), 263–273

[45] A. Takefusa, S. Matsuoka et al., “A Study of Deadline Scheduling for Client-Server Systems on the Computational Grid”, High Performance Distributed Computing (HPDC-10): Proceedings of the 10th IEEE International Symposium (San Francisco, California, USA, August 7–9, 2001), IEEE Computer Society, 2001, 406–415

[46] H. Chen, M. Maheswaran, “Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems”, International Parallel and Distributed Processing Symposium (IPDPS 2002): Proceedings of the 16th International Symposium (Fort Lauderdale, FL, USA, April 15–19, 2002), IEEE Computer Society, 2002, 88–97

[47] N. Muthuvelu, J. Liu et al., “A Dynamic Job Grouping-Based Scheduling for Deploying Applications with Fine-Grained Tasks on Global Grids”, Grid Computing and e-Research (AusGrid 2005): Proceedings of the 3rd Australasian Workshop (Newcastle, NSW, Australia, January 30–February 4, 2005), Australian Computer Society, 2005, 41–48

[48] D. Wright, Cheap Cycles from the Desktop to the Dedicated Cluster: Combining Opportunistic and Dedicated Scheduling with Condor } {\tt http://www.linuxclustersinstitute.org/conferences/

[49] S. J. Chapin, D. Katramatos et al., “The Legion Resource Management System”, Proceedings of the 5th Workshop, Job Scheduling Strategies for Parallel Processing (JSSPP 99) (San Juan, Puerto Rico, April 16, 1999), Springer, Lecture Notes in Computer Science, 1999, 162–178

[50] H. G. Rotithor, “Taxonomy of Dynamic Task Scheduling Schemes in Distributed Computing Systems”, Computer and Digital Techniques, 141:1 (1994), 1–10

[51] H. A. James, Scheduling in Metacomputing Systems. – Ph.D. Thesis. –The Department Of Computer Science, University of Adelaide, Australia }, 1999 {\tt http://digital.library.adelaide.edu.au/dspace/bitstream

[52] A. K. Aggarwal, R. D. Kent, “An Adaptive Generalized Scheduler for Grid Applications”, Proceedings of the 19th Annual International Symposium, High Performance Computing Systems and Applications (HPCS 05) (Guelph, Ontario Canada, May 15–18, 2005), IEEE Computer Society, 2005, 15–18

[53] G. Sabin, R. Kettimuthu et al., “Scheduling of Parallel Jobs in a Heterogeneous Multi-Site Environment”, Proceedings of the 9th International Workshop, Job Scheduling Strategies for Parallel Processing (JSSPP 03) (Seattle, WA, USA, June 24, 2003), Springer, Lecture Notes in Computer Science, 2003, 87–104

[54] M. Arora, S. K. Das, R. Biswas, “A Decentralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments”, International Conference on Parallel Processing Workshops (ICPPW 02): Proceedings of International Conference (Vancouver, British Columbia Canada, August 20–23, 2002), IEEE Computer Society, 2002, 499–505

[55] H. El-Rewini, T. Lewis, H. Ali, Task Scheduling in Parallel and Distributed Systems, Prentice Hall, 1994, 290 pp.

[56] R. Buyya, D. Abramson, S. Venugopal, “The Grid Economy”, Proceedings of the IEEE, 93:3 (2005), 698–714

[57] R. Buyya, J. Giddy, D. Abramson, “An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications”, Proceedings of the 2nd International Workshop, Active Middleware Services (AMS 2000) (Pittsburgh, USA, August 1, 2000), Kluwer Academic Press, 2000, 221–230

[58] J. Yu, R. Buyya, C. K. Tham, “QoS-based Scheduling of Workflow Applications on Service Grids”, e-Science and Grid Computing (e-Science 05): Proceedings of the 1st IEEE International Conference (Melbourne, Australia, December 5–8, 2005), IEEE Computer Society, 2005, 1–9

[59] S. Venugopal, R. Buyya, “A Deadline and Budget Constrained Scheduling Algorithm for eScience Applications on Data Grids”, International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP-2005): Proceedings of 6th International Conference (Melbourne, Australia, October 2–3, 2005), Springer, Lecture Notes in Computer Science, 2005, 60–72

[60] C. Ernemann, V. Hamscher, R. Yahyapour, “Economic Scheduling in Grid Computing”, Job Scheduling Strategies for Parallel Processing (JSSPP 02): Proceedings of 8th Workshop (Edinburgh, Scotland, UK, July 24, 2002), Springer, Lecture Notes in Computer Science, 2002, 128–152

[61] Y. Zhu, L. Xiao et al., “Incentive-based P2P Scheduling in Grid Computing”, Grid and Cooperative Computing (GCC 04): Proceedings of the 3rd International Conference (Wuhan, China, October 21–24, 2004), Springer, Lecture Notes in Computer Science, 2004, 209–216

[62] L. Young, S. McGough et al., “Scheduling Architecture and Algorithms within the ICENI Grid Middleware”, Proceedings of UK e-Science All Hands Meeting (Nottingham, UK, September 2003), IOP Publishing Ltd., 2003, 5–12

[63] S. Kim, J. B. Weissman, “A Genetic Algorithm Based Approach for Scheduling Decomposable Data Grid Applications”, International Conference on Parallel Processing (ICPP 04): Proceedings of the International Conference (Montreal, Quebec Canada, August 15–18, 2004), IEEE Computer Society, 2004, 406–413

[64] S. Song, Y. Kwok, K. Hwang, “Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling”, International Parallel and Distributed Processing Symposium (IPDPS 05): Proceedings of 19th IEEE International Symposium (Denver, Colorado USA, April 25–29, 2005), IEEE Computer Society, 2005, 65–74

[65] D. P. Spooner, J. Cao et al., “Localised Workload Management using Performance Prediction and QoS Contracts”, UK Performance Engineering Workshop (UKPEW 2002): Proceedings of the 18th Annual Workshop (Glasgow, UK, July 10–11, 2002), University of Glasgow, 2002, 69–80

[66] Y. Liu, Survey on Grid Scheduling, Department of Computer Science, University of Iowa, 2004

[67] A. Abraham, R. Buyya, B. Nath, “Nature's Heuristics for Scheduling Jobs on Computational Grids”, Advanced Computing and Communications (ADCOM 2000): Proceedings of 8th IEEE International Conference (Cochin, India, December 14–16, 2000), IEEE Computer Society, 2000, 45–52

[68] H. Shan, L. Oliker et al., “Scheduling in Heterogeneous Grid Environments: The Effects of Data Migration”, Advanced Computing and Communication (ADCOM 2004): Proceedings of the 12th IEEE International Conference (Ahmedabad Gujarat, India, December 15–18, 2004), IEEE Computer Society, 2004 pages 1–8

[69] X. He, X. Sun, G. Laszewski, “A QoS Guided Min-Min Heuristic for Grid Task Scheduling”, Computer Science and Technology: Special Issue on Grid Computing, 18:4 (2003), 442–451

[70] M. Wu, W. Shu, H. Zhang, “Segmented Min-Min: A Static Mapping Algorithm for Meta-Tasks on Heterogeneous Computing Systems”, Heterogeneous Computing Workshop (HCW 00): Proceedings of the 9th Workshop (Cancun, Mexico, May 1, 2000), IEEE Computer Society, 2000, 375–385

[71] V. Subramani, R. Kettimuthu et al., “Distributed Job Scheduling on Computational Grids using Multiple Simultaneous Requests”, High Performance Distributed Computing (HPDC 2002): Proceedings of 11th IEEE Symposium (Edinburgh, Scotland, July 23–26, 2002), IEEE Computer Society, 2002, 359–366

[72] D. P. Silva, W. Cirne, F. V. Brasileiro, “Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids”, Euro-Par 2003: Proceedings of the 9th International Conference (Klagenfurt, Austria, August 26–29, 2003), Springer, Lecture Notes in Computer Science, 2003, 169–180

[73] A. Radulescu, A. J. C. Gemund, “On the Complexity of List Scheduling Algorithms for Distributed Memory Systems”, Supercomputing (SC 99): Proceedings of 13th International Conference (Portland, Oregon, USA, November 13–19, 1999), IEEE Computer Society, 1999, 68–75

[74] R. Sakellariou, H. Zhao, “A Low-cost Rescheduling Policy for Efficient Mapping of Workflows on Grid Systems”, Scientific Programming, 12:4 (2004), 253–262

[75] H. Topcuoglu, S. Hariri, M. Y. Wu, “Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing”, IEEE Transactions on Parallel and Distributed Systems, 13:3 (2002), 260–274

[76] H. Zhao, R. Sakellariou, “An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm”, Euro-Par 2003: Proceedings of the 9th International Conference (Klagenfurt, Austria, August 26–29, 2003), Springer, Lecture Notes in Computer Science, 2003, 189–194

[77] R. Sakellariou, H. Zhao, “A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems”, Proceedings of the 18th International Symposium, International Parallel and Distributed Processing Symposium (IPDP 04) (Santa Fe, New Mexico USA, April 26–30, 2004), IEEE Computer Society, 2004, 111–123

[78] T. Ma, R. Buyya, “Critical-Path and Priority based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids”, Proceedings of the 17th International Symposium, Computer Architecture and High Performance Computing (SBAC-PAD 2005) (Rio de Janeiro, Brazil, October 24–27, 2005), IEEE Computer Society, 2005, 251–258

[79] S. Darbha, D. P. Agrawal, “Optimal Scheduling Algorithm for Distributed Memory Machines”, IEEE Transactions on Parallel and Distributed Systems, 9:1 (1998), 87–95

[80] S. Ranaweera, D. P. Agrawal, “A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems”, Proceedings of 14th International Symposium, International Parallel and Distributed Processing Symposium (IPDPS 00) (Cancun, Mexico, May 1–5, 2000), IEEE Computer Society, 2005, 445–450

[81] R. Bajaj, D. P. Agrawal, “Improving Scheduling of Tasks in A Heterogeneous Environment”, IEEE Transactions on Parallel and Distributed Systems, 15:2 (2004), 107–118

[82] A. Gerasoulis, T. Yang, “A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors”, Parallel and Distributed Computing, 16:4 (1992), 276–291

[83] J. Liou, M. A. Palis, “An Efficient Task Clustering Heuristic for Scheduling DAGs on Multiprocessors”, Proceedings of the Eighth IEEE Symposium, Parallel and Distributed Processing (SPDP 1996) (New Orleans, Louisiana, USA, October 23–26, 1996), IEEE Computer Society, 1996, 152–156

[84] J. Liou, M. A. Palis, “A Comparison of General Approaches to Multiprocessor Scheduling”, Proceedings the 11th International Symposium, International Parallel Processing Symposium (IPPS 97) (Geneva, Switzerland, April 1–5, 1997), IEEE Computer Society, 1996, 152–156

[85] /by S. J. Kim, J. C. Browne “A general approach to mapping of parallel computation upon multiprocessor architectures”, Proceedings of the International Conference, International Conference on Parallel Processing (ICPP 88) (The Pennsylvania State University, University Park, PA, USA, August 1988), Pennsylvania State University Press., 1988, 1–8

[86] V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, The MIT Press, Cambridge, MA, 1989, 215 pp.

[87] A. V. Shamakina, L. B. Sokolinskii, “Formalnaya model zadaniya v raspredelennykh vychislitelnykh sredakh”, Trudy mezhdunarodnoi nauchnoi konferentsii, Parallelnye vychislitelnye tekhnologii (PaVT 2014) (Rostov-na-Donu, 1–3 aprelya 2014 g.), Izdatelskii tsentr YuUrGU, Chelyabinsk, 2014, 343–354

[88] G. I. Radchenko, L. B. Sokolinskii, A. V. Shamakina Modeli i metody profilirovaniya i otsenki vremeni vypolneniya potokov rabot v superkompyuternykh sistemakh, Vychislitelnye metody i programmirovanie: Novye vychislitelnye tekhnologii, 14:4 (2013), 96–103

[89] A. V. Shamakina, “Broker resursov dlya podderzhki problemno-orientirovannykh sred”, Vestnik YuUrGU. Seriya “Vychislitelnaya matematika i informatika”, 46(305):1 (2012), 88–98

[90] A. V. Shamakina, “Organizatsiya brokera resursov v sisteme CAEBeans”, Vestnik Yuzhno-Uralskogo gosudarstvennogo universiteta. Seriya “Matematicheskoe modelirovanie i programmirovanie”, 27(127):2 (2008), 110–116

[91] A. V. Shamakina, “CAEBeans Broker: broker resursov sistemy CAEBeans”, Vestnik YuUrGU. Seriya “Matematicheskoe modelirovanie i programmirovanie”, 16(192):5 (2010), 107–115

[92] D. I. Savchenko, G. I. Radchenko, “DiVTB Server: sreda vypolneniya virtualnykh eksperimentov”, Trudy mezhdunarodnoi nauchnoi konferentsii, Parallelnye vychislitelnye tekhnologii (PaVT 2013) (Chelyabinsk, 1–5 aprelya 2013 g.), Izdatelskii tsentr YuUrGU, Chelyabinsk, 2013, 532–539

[93] G. I. Radchenko, “Raspredelennye virtualnye ispytatelnye stendy: ispolzovanie sistem inzhenernogo proektirovaniya i analiza v raspredelennykh vychislitelnykh sredakh”, Vestnik Yuzhno-Uralskogo gosudarstvennogo universiteta. Seriya: Matematicheskoe modelirovanie i programmirovanie, 2011, no. 37, 108–121

[94] G. I. Radchenko, “Tekhnologiya postroeniya problemno-orientirovannykh ierarkhicheskikh obolochek nad inzhenernymi paketami v grid-sredakh”, Sistemy upravleniya i informatsionnye tekhnologii, 2008, no. 4(34), 57–61

[95] G. I. Radchenko, L./,B. Sokolinskii, “Tekhnologiya postroeniya virtualnykh ispytatelnykh stendov v raspredelennykh vychislitelnykh sredakh”, Nauchno-tekhnicheskii vestnik informatsionnykh tekhnologii, mekhaniki i optiki, 2008, no. 54, 134–139

[96] G. I. Radchenko, “Metody organizatsii grid-obolochek sistemnogo sloya v tekhnologii CAEBeans”, Vestnik Yuzhno-Uralskogo gosudarstvennogo universiteta. Seriya: Matematicheskoe modelirovanie i programmirovanie, 2008, no. 15, 69–80

[97] G. I. Radchenko, “Grid-sistema CAEBeans: integratsiya resursov inzhenernykh paketov v raspredelennye vychislitelnye sredy”, Vestnik Nizhegorodskogo universiteta im. N.I. Lobachevskogo, 2009, no. 6(1), 192–202

[98] D. Savchenko, G. Radchenko, “Mjolnirr: private PaaS as distributed computing evolution”, Proceedings of the 37th International Convention, MIPRO 2014 (Opatija, Croatia, May 26–30, 2014), IEEE Computer Society, 2014, 386–391