A Comparative Study of Large Automata Distributed Processing

Cheikh B A
{"title":"A Comparative Study of Large Automata Distributed Processing","authors":"Cheikh B A","doi":"10.1109/AICT55583.2022.10013506","DOIUrl":null,"url":null,"abstract":"We enter bigdata domain when we face data that are so much large that they cannot fit in one machine, or the processing cannot fit in one machine RAM, or would last. We focus our study on large NFAs. We describe, implement and compare two solutions of NFA determinization. These novel solutions are based on two different distributed and parallel programing paradigms, namely MapReduce and BSP/Pregel. Running examples are provided with details on execution. This contribution belongs to the first stages of our main target consisting of a language of a high level for big and distributed graph programming.","PeriodicalId":441475,"journal":{"name":"2022 IEEE 16th International Conference on Application of Information and Communication Technologies (AICT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 16th International Conference on Application of Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICT55583.2022.10013506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We enter bigdata domain when we face data that are so much large that they cannot fit in one machine, or the processing cannot fit in one machine RAM, or would last. We focus our study on large NFAs. We describe, implement and compare two solutions of NFA determinization. These novel solutions are based on two different distributed and parallel programing paradigms, namely MapReduce and BSP/Pregel. Running examples are provided with details on execution. This contribution belongs to the first stages of our main target consisting of a language of a high level for big and distributed graph programming.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大型自动机分布式处理的比较研究
当我们面对的数据非常大,以至于一台机器无法容纳它们,或者处理过程无法在一台机器的RAM中进行,或者无法持续时,我们就进入了大数据领域。我们的研究重点是大型NFAs。我们描述、实现并比较了NFA确定的两种解决方案。这些新颖的解决方案基于两种不同的分布式并行编程范式,即MapReduce和BSP/Pregel。提供了运行示例,并提供了执行的详细信息。这个贡献属于我们主要目标的第一阶段,主要目标是为大型和分布式图形编程提供一种高级语言。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Developing Voice Chatbot for Learning Maritime English Automated detection of myocardial infarction using ECG-based artificial intelligence models: a systematic review An Ontological Approach to the Development of Analytical Platform Language Toolkits Anomaly Detection in Cyber-Physical Systems based on BiGRU-VAE Interference Resistant Position Awareness for Collision Avoidance in Dense Drones Swarming
×
引用
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