A parallel version of the in-close algorithm

N. Kodagoda, S. Andrews, K. Pulasinghe
{"title":"A parallel version of the in-close algorithm","authors":"N. Kodagoda, S. Andrews, K. Pulasinghe","doi":"10.1109/NCTM.2017.7872818","DOIUrl":null,"url":null,"abstract":"This research paper presents a new parallel algorithm for computing the formal concepts in a formal context. The proposed shared memory parallel algorithm Parallel-Task-In-Close3 parallelizes Andrews's In-Close3 serial algorithm. The paper presents the key parallelization strategy used and presents experimental results of the parallelization using the OpenMP framework.","PeriodicalId":343372,"journal":{"name":"2017 6th National Conference on Technology and Management (NCTM)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th National Conference on Technology and Management (NCTM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCTM.2017.7872818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This research paper presents a new parallel algorithm for computing the formal concepts in a formal context. The proposed shared memory parallel algorithm Parallel-Task-In-Close3 parallelizes Andrews's In-Close3 serial algorithm. The paper presents the key parallelization strategy used and presents experimental results of the parallelization using the OpenMP framework.
接近算法的并行版本
本文提出了一种新的计算形式上下文中形式概念的并行算法。本文提出的共享内存并行算法parallel - task -In-Close3实现了Andrews的In-Close3串行算法的并行化。本文介绍了采用的关键并行化策略,并给出了在OpenMP框架下并行化的实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信