By Topic

Parallel Bipartite Graph Algorithm for Protein Structure Matching Using OpenMP

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Fazilah Othman ; Sch. of Comput. Sci., Univ. Sains Malaysia, Minden, Malaysia ; Ibrahim Umar ; Rosni Abdullah ; Abhishek Rathi

Current work on bipartite graph-based algorithm for protein tertiary structure matching shows that the algorithm demands heavy computation and extensive processing time during graph preparation and matching. In this work, we deployed multithreading approach using OpenMP to enhance the performance of the algorithm. The experiment on dual quad core machines shows that the speedup is 4.9 on 8 threads with the minimum execution time of 121.39 seconds, before it gradually increases as more threads are added. The parallel code has successfully utilized the available multi-cores resources and it extends the capability of the algorithm to match more structures in a given time.

Published in:

Computer Research and Development, 2010 Second International Conference on

Date of Conference:

7-10 May 2010