分布式程序配置、执行与分析教学框架的设计

K. Bairagi, Ratnadeep Dey, P. K. Das
{"title":"分布式程序配置、执行与分析教学框架的设计","authors":"K. Bairagi, Ratnadeep Dey, P. K. Das","doi":"10.1109/ICIT.2018.00028","DOIUrl":null,"url":null,"abstract":"In distributed system it may pose some problems to visualize the exact nature of functioning and the sequence of events in various nodes of the said system and such insights are essential to comprehend and analyze the behavior of different algorithms executing in different nodes of the system mentioned. This paper describes a framework that has been implemented to help visualize and analyze the working behavior of various algorithms on distributed system. Using this platform it is possible for students and researchers to gain insight into the working of various nodes of a distributed system, check their interactions at run time and thus to test different algorithms in a simulated as well as actual environment. The framework lets the student to check the behavior of certain standard built-in distributed algorithms, viz., Leader Election using Bully and Ring Algorithms, Ricart-Agrawala's Mutual Exclusion Algorithm and Chandy-Mishra-Hash deadlock detection algorithm. The users can also write their own algorithms and use a program generator module to generate programs for different nodes using this framework. Subsequent to the execution, a graphical analyzer module aids the user by showing the execution behavior of the algorithm using a space-time graphical diagram that makes use of Lamport's Time Stamping algorithm. The framework provides built-in system-level supports to facilitate exclusive access to shared resources and detects distributed deadlock also.","PeriodicalId":221269,"journal":{"name":"2018 International Conference on Information Technology (ICIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Design of A Pedagogical Framework for Configuration, Execution and Analysis of Distributed Programs\",\"authors\":\"K. Bairagi, Ratnadeep Dey, P. K. Das\",\"doi\":\"10.1109/ICIT.2018.00028\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In distributed system it may pose some problems to visualize the exact nature of functioning and the sequence of events in various nodes of the said system and such insights are essential to comprehend and analyze the behavior of different algorithms executing in different nodes of the system mentioned. This paper describes a framework that has been implemented to help visualize and analyze the working behavior of various algorithms on distributed system. Using this platform it is possible for students and researchers to gain insight into the working of various nodes of a distributed system, check their interactions at run time and thus to test different algorithms in a simulated as well as actual environment. The framework lets the student to check the behavior of certain standard built-in distributed algorithms, viz., Leader Election using Bully and Ring Algorithms, Ricart-Agrawala's Mutual Exclusion Algorithm and Chandy-Mishra-Hash deadlock detection algorithm. The users can also write their own algorithms and use a program generator module to generate programs for different nodes using this framework. Subsequent to the execution, a graphical analyzer module aids the user by showing the execution behavior of the algorithm using a space-time graphical diagram that makes use of Lamport's Time Stamping algorithm. The framework provides built-in system-level supports to facilitate exclusive access to shared resources and detects distributed deadlock also.\",\"PeriodicalId\":221269,\"journal\":{\"name\":\"2018 International Conference on Information Technology (ICIT)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Information Technology (ICIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2018.00028\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information Technology (ICIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2018.00028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在分布式系统中,在系统的各个节点中可视化功能的确切性质和事件顺序可能会带来一些问题,这种见解对于理解和分析在所述系统的不同节点中执行的不同算法的行为是必不可少的。本文描述了一个已经实现的框架,以帮助可视化和分析分布式系统上各种算法的工作行为。利用这个平台,学生和研究人员可以深入了解分布式系统中各个节点的工作情况,检查它们在运行时的相互作用,从而在模拟和实际环境中测试不同的算法。该框架允许学生检查某些标准内置分布式算法的行为,即使用Bully和Ring算法的Leader选举,Ricart-Agrawala的互斥算法和Chandy-Mishra-Hash死锁检测算法。用户还可以编写自己的算法,并使用程序生成器模块为使用该框架的不同节点生成程序。在执行之后,图形分析模块通过使用Lamport时间戳算法的时空图形图来显示算法的执行行为,从而帮助用户。该框架提供内置的系统级支持,以促进对共享资源的独占访问,并检测分布式死锁。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design of A Pedagogical Framework for Configuration, Execution and Analysis of Distributed Programs
In distributed system it may pose some problems to visualize the exact nature of functioning and the sequence of events in various nodes of the said system and such insights are essential to comprehend and analyze the behavior of different algorithms executing in different nodes of the system mentioned. This paper describes a framework that has been implemented to help visualize and analyze the working behavior of various algorithms on distributed system. Using this platform it is possible for students and researchers to gain insight into the working of various nodes of a distributed system, check their interactions at run time and thus to test different algorithms in a simulated as well as actual environment. The framework lets the student to check the behavior of certain standard built-in distributed algorithms, viz., Leader Election using Bully and Ring Algorithms, Ricart-Agrawala's Mutual Exclusion Algorithm and Chandy-Mishra-Hash deadlock detection algorithm. The users can also write their own algorithms and use a program generator module to generate programs for different nodes using this framework. Subsequent to the execution, a graphical analyzer module aids the user by showing the execution behavior of the algorithm using a space-time graphical diagram that makes use of Lamport's Time Stamping algorithm. The framework provides built-in system-level supports to facilitate exclusive access to shared resources and detects distributed deadlock also.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信