Scheduling Algorithm with Potential Behaviors

@article{Jiang2008SchedulingAW,
  title={Scheduling Algorithm with Potential Behaviors},
  author={Jianhua Jiang and Huifang Ji and Gaochao Xu and Xiaohui Wei},
  journal={JCP},
  year={2008},
  volume={3},
  pages={51-59}
}
Scheduling algorithm for batch-mode dataintensive jobs is a key issue in data-intensive Grid applications. It focuses on how to minimize the overhead of transferring the required data set to the executing grid site. Existing approaches pay attention to the access cost of a data-intensive job at each executing grid site for replicating the required data set. However, they neglect the influence from potential behaviors of jobs in the waiting queue at each grid site when the access cost is… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Adaptive Computing on the Grid Using AppLeS

IEEE Trans. Parallel Distrib. Syst. • 2003
View 4 Excerpts
Highly Influenced

An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids

S. Venugopal, R. Buyya
Journal of Parallel and Distributed Computing, vol.68 (4), pp.471-487, April 2008. • 2008
View 1 Excerpt

An Enhanced Data-aware Scheduling Algorithm for Batch-mode Dataintensive Jobs on Data Grid

2006 International Conference on Hybrid Information Technology • 2006
View 1 Excerpt

Similar Papers

Loading similar papers…