Sharing the Same Operation with a Large Number of Users Using P2P

Takashi Yamanoue
{"title":"Sharing the Same Operation with a Large Number of Users Using P2P","authors":"Takashi Yamanoue","doi":"10.1109/ICITA.2005.252","DOIUrl":null,"url":null,"abstract":"A computer assisted teaching system which enables sharing the same operation with a large number of users using P2P is shown. The users of this system can share the same operation of applications such like a text editor, a draw program and others, on their computer terminals in real-time. This system can show an operation on a terminal to all terminals in the latency of O(log N) time complexity, where N is the number of terminals. In order to share the same operation on computer terminals, at most one operation must be performed on them at a time. In order to realize this, a mutual exclusion algorithm is embedded in this system. The time complexity of entering the critical section is O(log N). We have compared the performance of this system with the performance of a client-server system. A game could be played by remote users using this system","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Information Technology and Applications (ICITA'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITA.2005.252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

A computer assisted teaching system which enables sharing the same operation with a large number of users using P2P is shown. The users of this system can share the same operation of applications such like a text editor, a draw program and others, on their computer terminals in real-time. This system can show an operation on a terminal to all terminals in the latency of O(log N) time complexity, where N is the number of terminals. In order to share the same operation on computer terminals, at most one operation must be performed on them at a time. In order to realize this, a mutual exclusion algorithm is embedded in this system. The time complexity of entering the critical section is O(log N). We have compared the performance of this system with the performance of a client-server system. A game could be played by remote users using this system
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过P2P方式实现大量用户共享同一操作
介绍了一种利用P2P技术实现多人共享同一操作的计算机辅助教学系统。该系统的用户可以在各自的计算机终端上实时共享文本编辑器、绘图程序等应用程序的操作。该系统能够以O(log N)的时延时间复杂度将一台终端上的操作显示给所有终端,其中N为终端的个数。为了在计算机终端上共享相同的操作,每次只能对它们执行最多一项操作。为了实现这一点,在系统中嵌入了互斥算法。进入临界区的时间复杂度为O(log N)。我们将该系统的性能与客户端-服务器系统的性能进行了比较。使用该系统的远程用户可以玩游戏
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Protecting Customer’s Privacy in Querying Valuable Information Combined with E-Payment Scheme Image deblurring via smoothness-switching on Holder spaces PURPLE: a reflective middleware for pervasive computing A grid semantic approach for a digital archive integrated architecture Adaptive Modulation with Space-Time Block Coding for MIMO-OFDM Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1