We design and implement a framework for parallel computation of homology of cellular spaces over field coefficients, by decomposing the space. Theoretically, we show that optimal decomposition into local pieces is NP-Hard. In practice, we achieve roughly an speedup of homology computation on a 3-dimensional complex with about 10 million simplices using 11 cores.


One response
Do you want to comment?
Comments RSS and TrackBack Identifier URI ?
Trackbacks