Balanced Scheduling of Independent File-Sharing Tasks in Heterogenous Environment
Abstract
Problem statement: To examine the strategies for scheduling of independent file-sharing tasks in a heterogeneous environment and the concept of load balancing. Approach: We propose hypergraph partitioning based strategy for the scheduling of non-critical jobs. This is done by scheduling the tasks that share tasks among them to the same processor. The tasks thus scheduled are employed to a load balancing scheme for balancing the load on the processors by considering the average load on all processors. Results: This strategy reduces the input output overheads among the tasks thus reducing the end-point contention. Conclusion: Thus the batch execution time on the processors is reduced.
DOI: https://doi.org/10.3844/jcssp.2011.1793.1797
Copyright: © 2011 R. K. Ponsy, Sathia Bhama and S. Thamarai Selvi. This is an open access article distributed under the terms of the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 3,097 Views
- 2,288 Downloads
- 0 Citations
Download
Keywords
- Hypergraph partitioning
- partitioning strategy
- significant performance
- output overheads among
- approaches inherently
- homogeneous platforms
- scientific computing
- satisfied assign
- virtual organization
- second stage