Please use this identifier to cite or link to this item: https://rda.sliit.lk/handle/123456789/787
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPulasinghe, K-
dc.contributor.authorKodagoda, N-
dc.contributor.authorAndrews, S-
dc.date.accessioned2022-01-26T07:14:27Z-
dc.date.available2022-01-26T07:14:27Z-
dc.date.issued2017-01-27-
dc.identifier.citationN. Kodagoda, S. Andrews and K. Pulasinghe, "A parallel version of the in-close algorithm," 2017 6th National Conference on Technology and Management (NCTM), 2017, pp. 1-5, doi: 10.1109/NCTM.2017.7872818.en_US
dc.identifier.isbn978-1-5090-4729-1-
dc.identifier.urihttp://localhost:80/handle/123456789/787-
dc.description.abstractThis 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.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.ispartofseries2017 6th National Conference on Technology and Management (NCTM);Pages 1-5-
dc.subjectparallel versionen_US
dc.subjectin-close algorithmen_US
dc.titleA parallel version of the in-close algorithmen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/NCTM.2017.7872818en_US
Appears in Collections:Research Papers - IEEE
Research Papers - IEEE
Research Papers - SLIIT Staff Publications
Research Publications -Dept of Information Technology

Files in This Item:
File Description SizeFormat 
A_parallel_version_of_the_in-close_algorithm.pdf
  Until 2050-12-31
274.21 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.