Skip to content

Efficient homology computation, update to activeDNS pipeline and hypergraph analytics

Latest
Compare
Choose a tag to compare
@jesunsahariar jesunsahariar released this 29 Oct 05:11

This release includes the following changes:

  1. Better algorithm for homology computation, specifically, for computing the Betti numbers.

  2. Better syntactic variation of the linear algebra operations for homology computation: In Chapel language, equivalent but different syntax can translate to varied performance, when considering the context in which an algorithm is executed: shared-memory vs distributed-memory execution. We have included better syntactic variants for some of the linear algebra operations: row/column exchange of matrices and adding row/columns of matrices. These changes result in better performance for our homology computation algorithm.

  3. Updates to the activeDNS pipeline: To avoid a race condition, we have replaced the distributed-memory algorithm for the duplicate removal step with a shared-memory algorithm in the activeDNS pipeline.

  4. s-distance: We have included an algorithm to compute the s-distance of a given hypergraph.