Real time pipelined system design through simulated annealing
Journal of Systems Architecture: the EUROMICRO Journal - Special double issue: real-time systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Journal of Parallel and Distributed Computing
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The ANL/IBM SP Scheduling System
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A computational economy for grid computing and its implementation in the Nimrod-G resource broker
Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Introduction to Bioinformatics
Introduction to Bioinformatics
Performance and Scalability of a Replica Location Service
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Fair Scheduling Algorithms in Grids
IEEE Transactions on Parallel and Distributed Systems
Efficient reuse of replicated parallel data segments in computational grids
Future Generation Computer Systems
Performance modeling of parallel applications for grid scheduling
Journal of Parallel and Distributed Computing
Model-based simulation and performance evaluation of grid scheduling strategies
Future Generation Computer Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Improving job scheduling algorithms in a grid environment
Future Generation Computer Systems
Globus toolkit version 4: software for service-oriented systems
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Scheduling jobs on computational grids using fuzzy particle swarm algorithm
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
| Hi-index | 0.00 |
Scientific applications such as protein sequence analysis require a coordination of resources. This is due to hundreds and hundreds of protein sequences being deposited into data banks by the research community which results in an extensive database search when one wants to find a similar protein sequence. This search becomes easier and the time taken is reduced when it is conducted in a grid environment implemented using the Globus tool kit. This paper proposes the use of Bacteria Foraging Optimization (BFO) for finding similar protein sequences in the existing databases. Usage of BFO further reduces the time taken by a resource to execute the user's requests. Also, the resources utilized in the proposed method are better balanced compared to the existing scheduling algorithms. Also, it is found that the number of tasks executed is more compared to the existing algorithms even though there is a fall in the execution of tasks as the number of resources increases which might be due to network failure etc. The proposed BFO has been compared with the existing First Come First Serve (FCFS) and Minimum Execution Time (MET) scheduling algorithms and it has been found that the proposed BFO performs well compared to the existing algorithms in terms of makespan, resource utilization and minimization in the case of non-execution of client requests.