WORKING PROGRAM FOR STUDENT COURSE «DISTRIBUTED COMPUTING SCHEDULING» AND METHODICAL SUPPORT DESCRIPTION

Abstract

The article describes working program for student course B1.V.04 «Distributed Computing Scheduling» which is taught during second semester of master course 01.04.02 «Applied Mathematics and Informatics» of «Math modeling» specialty. The narration includes description of student course and fragments of study guide to be edited.
The description of working program for student course consists of editorial calendar, list of expertise, knowledge and skills which student should obtain after the course «Distributed Computing Scheduling» and criteria for educational outcome results.
Methodical support includes laboratory works and demonstration programs. The considered materials were time tried during lectures and laboratory works within 2 years. The article briefly describes software implementation of several illustrative examples (scalar clock and Lamport's mutual exclusion algorithm [1], and Suzuki-Kasami [2] broadcasting algorithm). The implementation is made on platform .NET Framework in programming environment Microsoft Visual Studio 2017 by software language C#. The applications are developed as multithreaded ones for illustration purposes .
Within the context of student course «Distributed Computing Scheduling» quite a lot of time is dedicated to independent work. It is assumed that students learn basic concepts and algorithms during lectures, work with demo programs, do laboratory works and then deepen their knowledge following the lecture plan and theme.

Author Biography

Юлиана Александровна Крыжановская, Voronezh State University

Senior Lector, ERP-systems and business processes chair, Applied mathematics, informatics and mechanics faculty

References

[1] Chandy K.M., Lamport L. Distributed snapshots: determining global states of distributed systems. ACM Transactions on Computer Systems. 1985; 3(1):63-75. DOI: 10.1145/214451.214456
[2] Suzuki I., Kasami T. A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems. 1985; 3(4):344-349. DOI: 10.1145/6110.214406
[3] Tanenbaum A.S., van Steen M. Disrtibuted Systems. Principles and Paradigms. Prentice Hall, 2001. 803 p.
[4] Toporkov М. Distributed sysmems models. М.: Fizmatlit, 2004. 320 p. (In Russian)
[5] Oganov A., Posypkin M., Roisen V., Samtsevich A., Sukhomlin V., Hrapov N. Volunteer Computing for Computational Materials Design. Modern Information Technologies and IT-Education. 2016; 12(1):91-96. Available at: https://elibrary.ru/item.asp?id=27539222 (accessed 05.09.2018). (In Russian)
[6] Posypkin M. et al. Solving stream ciphers cryptanalysis in distributed computing environments. Proceeding of the Institute for Systems Analysis of the Russian Academy of Science. 2009; 46:119-137. Available at: https://elibrary.ru/item.asp?id=15323443 (accessed 05.09.2018). (In Russian)
[7] Shmakina A. Survey on distributed computing technologies. Bulletin of the South Ural State University. Series: Computational Mathematics and Software Engineering. 2014; 3(3):51-85. Available at: https://elibrary.ru/item.asp?id=21938877 (accessed 05.09.2018). (In Russian)
[8] Russel J., Kon R. Distributed computations. М.: VSD, 2013. 103 p. (In Russian)
[9] Radchenko G.I. Distributed computations systems. Chelyabinsk: Photoartist, 2012. 184 p. Available at: https://elibrary.ru/item.asp?id=19599387 (accessed 05.09.2018). (In Russian)
[10] Coulouris G., Dollimore J., Kindberg T., Blair G. Distributed Systems: Concepts and Design. Fifth edition. Addison – Wesley, 2011. 1047 p.
[11] Fokkink W. Distributed Algorithms. Intuitive approach. The MIT Press, 2013. 242 p.
[12] Horalek J., Soběslav V. Analysis and Solution Model of Distributed Computing in Scientific Calculations. N. Nguyen, S. Tojo, L. Nguyen, B. Trawiński (eds) Intelligent Information and Database Systems. ACIIDS 2017. Lecture Notes in Computer Science. Vol. 10191. Springer, Cham, 2017, pp. 367-376. DOI: 10.1007/978-3-319-54472-4_35
[13] Brodsky Yu.I. Model synthesis and model-oriented programming – the technology of design and implementation of simulation models of complex multicomponent systems. In the World of Scientific Discoveries, Series B. 2014; 2(1):12-31. Available at: https://elibrary.ru/item.asp?id=21942274 (accessed 05.09.2018).
[14] Bondarenko A.A., Yakobovskyi М.V. Fault Tolerance for HPC by Using Local Checkpoints. Bulletin of the South Ural State University, Series: Computational Mathematics and Software Engineering. 2014; 3(3):20-36. Available at: https://elibrary.ru/item.asp?id=21938875 (accessed 05.09.2018). (In Russian)
[15] Grusho A.A. Erroneous states classification in dictributed computing systems and sources of their occurrence. Systems and Means of Informatics. 2017; 27(2):29-40. (In Russian) DOI: 10.14357/08696527170203
[16] Bychkov I.V., Manzyuk M.O., Semenov A.A., Zaikin O.S., Afanasiev A.P., Posypkin M.A. Technology for integrating IDLE computing cluster resources into volunteer computing projects. Proccedings of the 5th International Workshop on Computer Science and Engineering: Information Processing and Control Engineering. WCSE 2015-IPCE. Moscow, 2015, pp. 109-114. Available at: https://elibrary.ru/item.asp?id=24528373 (accessed 05.09.2018).
[17] Magoules F. Fundamentals of Grid Computing: Theory, Algorithms and Technologies. CRC Press, 2010. 322 p.
[18] Ivashko E. Distributed computations. GRID-systems. IBM – United States. 2009. Available at: http://www.ibm.com/developerworks/ru/library/l-grid (accessed 05.09.2018). (In Russian)
[19] Tanenbaum A.S., Austin T. Structured Computer Organization (6th Edition). Pearson, 2012. 808 p.
[20] Goff М.К. Network Distributed Computing: Fitscapes and Fallacies. Prentice Hall, 2004. 302 p.
[21] Varela C.A. Programming Distributed Computing Systems: A Foundational Approach. The MIT Press, 2013. 296 p.
[22] Gritsenko A., Demurchev N., Kopytov V., Shulgin A. Decomposition Analysis and Machine Learning in a Workflow-Forecast Approach to the Task Scheduling Problem for High-Loaded Distributed Systems. Modern Applied Science. 2015; 9(5):38-49. DOI: 10.5539/mas.v9n5p38
[23] Toporkov V., Toporkova A., Tselishchev A., Yemelyanov D. Slot Selection Algorithms for Economic Scheduling in Distributed Computing with High QoS Rates. W. Zamojski, J. Mazurkiewicz, J. Sugier, T. Walkowiak, J. Kacprzyk (eds) New Results in Dependability and Computer Systems. Advances in Intelligent Systems and Computing. Vol. 224. Springer, Heidelberg, 2013, pp. 459-468. DOI: 10.1007/978-3-319-00945-2_42
[24] Richter J. CLR via C #. (Developer Reference). 4th Edition. Microsoft Press, 2012. 896 p.
[25] Sharp J. Microsoft Visual C# Step by Step. (Developer Reference). 8th Edition. Microsoft Press, 2015. 816 p.
Published
2018-12-10
How to Cite
КРЫЖАНОВСКАЯ, Юлиана Александровна. WORKING PROGRAM FOR STUDENT COURSE «DISTRIBUTED COMPUTING SCHEDULING» AND METHODICAL SUPPORT DESCRIPTION. Modern Information Technologies and IT-Education, [S.l.], v. 14, n. 4, p. 859-864, dec. 2018. ISSN 2411-1473. Available at: <http://sitito.cs.msu.ru/index.php/SITITO/article/view/451>. Date accessed: 29 nov. 2025. doi: https://doi.org/10.25559/SITITO.14.201804.859-864.
Section
Educational resources and best practices of IT Education

Most read articles by the same author(s)