Parallel Recursive Algorithm for FCA

6th International Conference on Concept Lattices and Their Applications

Petr Krajca ; Jan Outrata ; Vilem Vychodil

Others  :  http://CEUR-WS.org/Vol-433/paper6.pdf
PID  :  24677

来源: CEUR

【 摘 要 】

This paper presents a parallel algorithm for computing formal concepts. Presented is a sequential version upon which we build the parallel one. We describe the algorithm, its implementation, scalability, and provide an initial experimental evaluation of its efficiency. The algorithm is fast, memory efficient, and can be optimized so that all critical operations are reduced to low-level bit-array operations. One of the key features of the algorithm is that it avoids synchronization which has positive impacts on its speed and plementation.