Millions of compounds are now available in chemical libraries and scientists have to test these compounds against biological targets in order to identify lead compounds. The identification of lead compounds is a key step in the drug discovery process. So, there are many hierarchical clustering algorithms are developed and modified for that purpose. Ward algorithm is one of the most popular hierarchical clustering algorithms that are used in many applications in the drug discovery process because of it is accuracy. But, it has limitation to handle large data sets within a reasonable time and memory resources. In this paper, we evaluate and compare two parallel approaches to run ward algorithm. The two approaches are parallel for loop and MapReduce framework. The results shows that parallel for loop failed to reduce computational time of ward algorithm due to overhead needed for data communications. But, MapReduce framework shows considerable reduction in computational time. The parallel ward algorithm saves 17% of time using three nodes and saves 58% of time using six nodes using MapReduce.
Malhat, M., & Mousa, H. (2015). Evaluating Parallel Ward Algorithm for Drug Discovery. IJCI. International Journal of Computers and Information, 4(1), 29-35. doi: 10.21608/ijci.2015.33959
MLA
M. G. Malhat; Hamdy Mousa. "Evaluating Parallel Ward Algorithm for Drug Discovery", IJCI. International Journal of Computers and Information, 4, 1, 2015, 29-35. doi: 10.21608/ijci.2015.33959
HARVARD
Malhat, M., Mousa, H. (2015). 'Evaluating Parallel Ward Algorithm for Drug Discovery', IJCI. International Journal of Computers and Information, 4(1), pp. 29-35. doi: 10.21608/ijci.2015.33959
VANCOUVER
Malhat, M., Mousa, H. Evaluating Parallel Ward Algorithm for Drug Discovery. IJCI. International Journal of Computers and Information, 2015; 4(1): 29-35. doi: 10.21608/ijci.2015.33959
)
View on SCiNiTO