Research Article Open Access

Balanced Scheduling of Independent File-Sharing Tasks in Heterogenous Environment

R. K. Ponsy, Sathia Bhama and S. Thamarai Selvi

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.

Journal of Computer Science
Volume 7 No. 12, 2011, 1793-1797

DOI: https://doi.org/10.3844/jcssp.2011.1793.1797

Submitted On: 4 April 2011 Published On: 17 October 2011

How to Cite: Ponsy, R. K., Bhama, S. & Selvi, S. T. (2011). Balanced Scheduling of Independent File-Sharing Tasks in Heterogenous Environment. Journal of Computer Science, 7(12), 1793-1797. https://doi.org/10.3844/jcssp.2011.1793.1797

  • 3,018 Views
  • 2,244 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