A parallel version of the in-close algorithm

KODAGODA, Nuwan, ANDREWS, Simon and PULASINGHE, Koliya (2017). A parallel version of the in-close algorithm. In: NCTM 2017 Proceedings of the 6th National Conference on Technology and Management (NCTM). IEEE, 1-5.

[img]
Preview
PDF
Andrews - A Parallel version of the In-Close Algorithm (AM).pdf - Accepted Version
All rights reserved.

Download (587kB) | Preview
Official URL: http://ieeexplore.ieee.org/document/7872818/?part=...
Link to published version:: https://doi.org/10.1109/NCTM.2017.7872818
Related URLs:

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

Item Type: Book Section
Additional Information: Paper presented at the 6th National Conference on Technology and Management, 27th of January 2017, Sri Lanka Institute of Information Technology, Malabe, Sri Lanka
Research Institute, Centre or Group - Does NOT include content added after October 2018: Cultural Communication and Computing Research Institute > Communication and Computing Research Centre
Identification Number: https://doi.org/10.1109/NCTM.2017.7872818
Page Range: 1-5
Depositing User: Jill Hazard
Date Deposited: 20 Mar 2017 15:44
Last Modified: 18 Mar 2021 16:15
URI: https://shura.shu.ac.uk/id/eprint/15417

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics