Genetic algorithm for DAG scheduling in Grid environments

Proceedings - 2009 IEEE 5th International Conference on Intelligent Computer Communication and Processing, ICCP 2009

Volumn , Issue , 2009, Pages 299-305

  Pop, Florin ^a   Dobre, Ciprian ^a   Cristea, Valentin ^a  

^a UNIVERSITY POLITEHNICA OF BUCHAREST   (Romania)

Author keywords

Genetic algorithms; Grid scheduling; Monarc; Simulation

Indexed keywords

COMPARATIVE EVALUATIONS; COMPLEX APPLICATIONS; COMPUTATION RESOURCES; CRITICAL PATHS; DAG SCHEDULING; GRID ENVIRONMENTS; GRID SCHEDULING; GRID SYSTEMS; INTEGRATION PLATFORM; MULTIPLE CRITERIA; NEAR-OPTIMAL ALGORITHMS; OPTIMIZATION PROCESS; SIMULATION TOOL; WORK-FLOWS;

GENETIC ALGORITHMS; GRID COMPUTING; MANAGEMENT; OPTIMIZATION;

SCHEDULING ALGORITHMS;

EID: 74049121844     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCP.2009.5284747     Document Type: Conference Paper

References (17)

1. Daniel Walton. The simulation of dynamic resource brokering in a grid environment. Technical report, B.Comp.Sc., Department of Computer Science, The University of Adelaide, South Australia, 2002.
2. I. Foster and C. Kesselman. The grid: Blueprint for a new computing infrastructure. Morgan Kaufmann, 1999.
3. I. Foster, C. Kesselman, and S. Tuecke. The anatomy of the grid: Enabling scalable virtual organizations. International Journal of Supercomputer Applications, 2001.
4. Fangpeng Dong and Selim Akl. Scheduling algorithms for grid computing: State of the art and open problems. Technical report, School of Computing, Queen's University, Kingston, ON, K7L 3N6, Canada, 2006.
5. M. Maheswaran, S. Ali, H.J. Siegel, D. Hensgen, and R.F. Freud. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing, November 1999.
6. Y.K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4), 1999.
7. M. Kafil and I. Ahmad. Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurrency, 6(3):42-51, 1998.
8. J. Ullman. Np-complete scheduling problems. Computer System Science 10, 1975.
9. A. Gerasoulis and T. Yang. A comparison of clustering heuristics for scheduling dags on multiprocessors. Parallel Distributed Computer, 1992.
10. F. Pop and V. Cristea. Intelligent strategies for dag scheduling optimization in grid environments. In Proceedings of the 16th International Conference on Control Systems and Computer Science (CSCS16'07), May 22-25, Bucharest, Romania, Print-ech, ISBN 978-973-718-743-7, pages 98-103, 2007.
11. K.M. Chandy, T.L. Adam, and J. Dickson. A comparison of list scheduling for parallel processing systems. Communication of ACM, 17, 1974.
12. Y. Li and W. Wolf. Hierarchical scheduling and allocation of multirate systems on heterogeneous multiprocessors. European Design and Test Conference, 1997.
13. M.Y. Wu and D.D. Gajski. Hypercool: a programming aid for message-passing systems. IEEE Transactions Parallel Distributed Systems, 1990.
14. M.Y. Wu. Mcp revisited. Department of Electrical and Computer Engineering, The University of New Mexico, 2000.
15. Bogdan Simion, Catalin Leordeanu, Florin Pop, and Valentin Cristea. A hybrid algorithm for scheduling workflow applications in grid environments (icpdp). In Proceedings of On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, GADA, and ODBASE and IS, Volume 4804/2007, Vil-amoura, Portugal, November 25-30, ISBN: 978-3-540-76835-7, Springer Verlag, pages 1331-1348, 2007.
16. A.Y. Zomaya and Y.H. Teh. Observations on using genetic algorithms for dynamic load-balancing. IEEE Transactions on Parallel and Distributed Systems, 12(9):899-911, 2001.
17. S. Ghosh, R. Melhem, and D. Mosse. Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems, 8(3):272-284, 1997.