Please use this identifier to cite or link to this item:
https://rda.sliit.lk/handle/123456789/787
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Pulasinghe, K | - |
dc.contributor.author | Kodagoda, N | - |
dc.contributor.author | Andrews, S | - |
dc.date.accessioned | 2022-01-26T07:14:27Z | - |
dc.date.available | 2022-01-26T07:14:27Z | - |
dc.date.issued | 2017-01-27 | - |
dc.identifier.citation | N. 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.isbn | 978-1-5090-4729-1 | - |
dc.identifier.uri | http://localhost:80/handle/123456789/787 | - |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.relation.ispartofseries | 2017 6th National Conference on Technology and Management (NCTM);Pages 1-5 | - |
dc.subject | parallel version | en_US |
dc.subject | in-close algorithm | en_US |
dc.title | A parallel version of the in-close algorithm | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/NCTM.2017.7872818 | en_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 | Size | Format | |
---|---|---|---|---|
A_parallel_version_of_the_in-close_algorithm.pdf Until 2050-12-31 | 274.21 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.