Publication:
A parallel version of the in-close algorithm

dc.contributor.authorKodagoda, N
dc.contributor.authorAndrews, S
dc.contributor.authorPulasinghe, K
dc.date.accessioned2022-03-15T06:28:16Z
dc.date.available2022-03-15T06:28:16Z
dc.date.issued2017-01-27
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.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.doi10.1109/NCTM.2017.7872818en_US
dc.identifier.isbn978-1-5090-4729-1
dc.identifier.urihttps://rda.sliit.lk/handle/123456789/1660
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
dspace.entity.typePublication

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A_parallel_version_of_the_in-close_algorithm.pdf
Size:
274.21 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: