Grid workflows schedule based on priority rules

Tien Tzu Hsueh Pao/Acta Electronica Sinica

Volumn 37, Issue 7, 2009, Pages 1457-1464

  Yuan, Ying Chun ^a,b   Li, Xiao Ping ^b,c   Wang, Qian ^b,c   Zhang, Xiao Dong ^b,c  

^a AGRICULTURAL UNIVERSITY OF HEBEI   (China)

^b SOUTHEAST UNIVERSITY   (China)

^c Southeast University   (China)

Author keywords

Directed acyclic graph (DAG); Grid computing; Priority rules; Time dependent coupling strength; Workflow

Indexed keywords

BEST FIT; COMPUTATION TIME; COMPUTATIONAL EXPERIMENT; COST IMPROVEMENTS; COUPLING STRENGTHS; DIFFERENTIATED SERVICES; DIRECTED ACYCLIC GRAPH (DAG); DIRECTED ACYCLIC GRAPHS; GRID WORKFLOWS; INITIAL SOLUTION; NEW CONCEPT; NP-HARD; OPTIMIZATION PROBLEMS; PRICING MECHANISM; PRIORITY RULES; PROBLEM PARAMETERS; TIME-COST TRADEOFF; TIME-DEPENDENT; TIME-DEPENDENT COUPLING STRENGTH; WORKFLOW;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; HEURISTIC METHODS; MANAGEMENT;

GRID COMPUTING;

EID: 69249105002     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. I Foster, C Kesselman, J M Nick, S Tuecke. Grid service for distributed system integration[J]. IEEE Computer, 2002, 35(6): 37-46.
2. J Yu, R Buyya. Taxonomy of scientific workflow systems for Grid computing[J], Sigmod Record, 2005, 34(3): 44-49.
3. L Cao, M L Li, J Cao, et al. Introduction to an Agent-based Grid Workflow Management System[M]. LNCS 3759, 2005. 559-568.
4. E Deelman, J Blythe et al. Mapping abstract complex workflows onto grid environments[J]. Journal of Grid Computing, 2003, 1(1): 25-39.
5. R Buyya, D Abramson, J Giddy, H Stockinger. Economic models for resource management and scheduling in grid computing. concurrency and computation[J]. Practice and Experience Journal, 2002, 14(13-15): 1507-1542.
6. Chen Hongwei, Wang Ruchuan. A grid scheduling algorithm for cost-time optimization[J]. Acta Electronica Sinica, 2005, 33(8): 1375-1380. (in Chinese)
7. M Lin, Z Lin. A cost-effective critical path approach for service priority selections in grid computing economy[J]. Decision Support Systems, 2006, 42(3): 1628-1640.
8. P De, E J Dunne, J B Ghosh, C E Wells. The discrete time-cost tradeoff problem revisited[J]. European Journal of Operational Research, 1995, 81(2): 225-238.
9. P De, E J Dunne, J B Ghosh, C E Wells. Complexity of the discrete time-cost tradeoff problem for project networks[J]. Operations Research, 1997, 45(2): 302-306.
10. C Akkan, A Drexl, A Kimms. Network decomposition-based benchmark results for the discrete time-cost tradeoff problem[J]. European Journal of Operational Research, 2005, 165(3): 339-358.
11. J Yu, R Buyya, C K Tham. Cost-based scheduling of workflow applications on utility grids[A]. Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing[C], Los Alamitos, CA, USA: IEEE Computer Society Press, 2005. 130-137.
12. Y Yuan, X Li, Q Wang, Y Zhang. Bottom level based heuristic for scheduling workflows in grids[J]. Chinese Journal of Computers, 2008, 31(2): 280-290. (in Chinese)
13. R Klein. Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects[J]. European Journal of Operational Research, 2000, 127(4): 619-638.
14. Project Scheduling problem library-PSPLIB[OL]. http://129.187.106.231/psplib/, 2005.
15. L Z Zeng, B Benatallah, A H H Ngu, et al, QoS-aware middleware for web services composition[J]. IEEE Transactions on Software Engineering, 2004, 30(5): 311-327.
16. Jin Hai, Chen Hanhua, Lu Zhipeng, et al. QoS optimizing model and solving for composite service in CGSP job manager[J]. Chinese Journal of Computer, 2005, 28(4): 578-588. (in Chinese)
17. C W Zhang, S Su, J J Chen. DiGA: Population diversity handling genetic algorithm for QoS-aware web services selection[J]. Computer Communications, 2007, 30(3): 1082-1090.