| Autor: |
Kaladevi, A. C., Srinath, M. V., Prabhakar, Anu |
| Zdroj: |
2013 International Conference on Computer Communication & Informatics; 1/ 1/2013, p1-6, 6p |
| Abstrakt: |
Efficient utilization of resources is a vital factor for any environment. The grid environment is dynamic and it allows the clusters to move around freely. Grid acts as a supercomputer to the users by handling voluminous data. So proper allocation of the available resources is important. Hence resource discovery and scheduling of jobs is a challenging area in grid. This paper presents a new approach for scheduling jobs in grid using Bee Colony algorithm and the discovered resources are advancely reserved for future. Bee Colony is a recently popular heuristic algorithm used for optimization. Grid consists of many clusters which contains the resources. Clusters are formed using K-means algorithm. K-means is a partitioning method for cluster formation. The results shows that performance of resource discovery is greatly improved using this algorithm and total throughput is increased with advance reservation of resources. [ABSTRACT FROM PUBLISHER] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
