Abstract
The motif discovery algorithms in network are always serial algorithms that run on single machine, which leads to lower efficiency and cannot meet the demands for discovering motifs in large-scale networks. In response to this situation, a parallel motif discovery algorithm is presented based on a parallel programming model called MapReduce in this paper. The algorithm is realized on Hadoop to discover the motifs in software networks with different scale. From the application test, the efficiency, speedup and expandability of the parallel algorithm are analysed and verified.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
