Frog leap algorithm for homology modelling in grid environment
by D. Ramyachitra; P. Pradeep Kumar
International Journal of Grid and Utility Computing (IJGUC), Vol. 7, No. 1, 2016

Abstract: This research work shows how homology modelling works for protein sequences in grid environment based on the relevance match from the database. In First Come First Served (FCFS) strategy, the protein sequence is scheduled to the resource on FCFS order and processed until completion. On average it takes more time to search sequences and users may wait a long time for results. To overcome this, FCFS is implemented in grid. Here the time taken to process the sequences gets reduced, but the inputs are processed one by one. To overcome the maximum time execution and users' waiting time, Frog Leap Algorithm has been used for grid scheduling. The scheduling is done based on the size of the protein sequence. The system that takes the minimum time to process the particular protein sequence is found out initially in grid, through which the time complexity for scheduling has been improved.

Online publication date: Tue, 22-Dec-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com