Skip to Main Content
Porous media simulation is an important contribution in the study of many physical phenomena. The No MISS greedy algorithm outstands from the existing sequential algorithms for constructing a pore sub network, in a relatively fast way. However, despite the No MISS time reduction, there are still problems related to the required processing time when very large networks need to be studied. In this work, a non scalable parallel version of the No MISS algorithm is presented, and a new approach is proposed to alleviate this issue, in both versions cluster cores work simultaneously on different porous sub network spaces. The first approach, named as Unbounded-No MISS, allows the cores to go forward with the initialization of the porous sub network space, applying a balancing policy when a core needs more data. At the end, the cores require a sequential synchronization to finish the porous network construction. The second approach, named as Bounded-No MISS, controls the porous sub network initialization by considering a site-size boundary, avoiding the final strong synchronization and improving considerably the scalability. The obtained results using a 125-core cluster are presented.