Parallel Recursive Algorithm for FCA
Petr Krajča, Jan Outrata, Vilém Vychodil · 2008
This paper presents a parallel algorithm for computing for- mal 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 eciency. The algo- rithm is fast, memory ecient, 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 implementation.