接近算法的并行版本

2017 6th National Conference on Technology and Management (NCTM) Pub Date : 2017-03-09 DOI:10.1109/NCTM.2017.7872818

N. Kodagoda, S. Andrews, K. Pulasinghe

{"title":"接近算法的并行版本","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":"{\"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}","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

摘要

本文提出了一种新的计算形式上下文中形式概念的并行算法。本文提出的共享内存并行算法parallel - task -In-Close3实现了Andrews的In-Close3串行算法的并行化。本文介绍了采用的关键并行化策略，并给出了在OpenMP框架下并行化的实验结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A parallel version of the in-close algorithm

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 6th National Conference on Technology and Management (NCTM)

自引率

0.00%

发文量