Performance Comparison of Some Hybrid Deadline Based Scheduling Algorithms for Computational Grid
暂无分享,去创建一个
Anindya Jyoti Pal | Nordin Zakaria | Ken Naono | Haruna Ahmed Abba | A. J. Pal | N. Zakaria | H. A. Abba | K. Naono
[1] Yu Jinshou,et al. An Improved PSO Algorithm and its Application to Grid Scheduling Problem , 2008, 2008 International Symposium on Computer Science and Computational Technology.
[2] Fahime Moein-darbari,et al. Scheduling of scientific workflows using a chaos-genetic algorithm , 2010, ICCS.
[3] Ian Foster,et al. The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.
[4] Manoj Kumar Mishra,et al. An Agent Based Dynamic Resource Scheduling Model with FCFS-Job Grouping Strategy in Grid Computing , 2010 .
[5] Abhishek Chandra,et al. Exploring the throughput-fairness tradeoff of deadline scheduling in heterogeneous computing environments , 2008, SIGMETRICS '08.
[6] Unai Arronategui,et al. Distributed Scheduler of Workflows with Deadlines in a P2P Desktop Grid , 2010, 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing.
[7] S. N. Sivanandam,et al. GRID SCHEDULING USING ENHANCED PSO ALGORITHM , 2010 .
[8] Marco Danelutto,et al. Integrated Research in Grid Computing , 2008 .
[9] Emmanouel A. Varvarigos,et al. Fair Scheduling Algorithms in Grids , 2007, IEEE Transactions on Parallel and Distributed Systems.
[10] Dalibor Klusácek,et al. Comparison Of Multi-Criteria Scheduling Techniques , 2008, CoreGRID Integration Workshop.