Mapping workflows onto Grid resources within an SLA context

Lecture Notes in Computer Science

Volumn 3470, Issue , 2005, Pages 1107-1116

  Quan, Dang Minh ^a   Kao, Odej ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; CONFORMAL MAPPING; CONSTRAINT THEORY; JOB ANALYSIS; STRATEGIC PLANNING;

GRID RESOURCES; SERVICE LEVEL AGREEMENTS (SLA); TIME CONSTRAINTS; WORKFLOWS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 24944571149     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11508380_113     Document Type: Conference Paper

References (13)

1. E. Deelman, J. Blythe, Y.Gil, C. Kesselman, G. Mehta, K. Vahi, K. Blackburn, A. Lazzarini, A. Arbree, R. Cavanaugh, S. Koranda: Mapping Abstract Complex Workflows onto Grid Environments, Journal of Grid Computing, Vol 1, no. 1, pp. 25-39, 2003.
2. J. Cao, S. A. Jarvis, S. Saini, G. R. Nudd: GridFlow: Workflow Management for Grid Computing, Proc. 3rd IEEE/ACM Int. Symp. on Cluster Computing and the Grid, Tokyo, Japan, pp. 198-205, 2003.
3. R. Lovas, G. Dzsa, P. Kacsuk, N. Podhorszki, D. Drtos: Workflow Support for Complex Grid Applications: Integrated and Portal Solutions, Proc. 2nd European Across Grids Conference, Nicosia, Cyprus, 2004.
4. J. W. Barnes, J. B. Chambers: Flexible Job Shop Scheduling by Tabu Search, Technical Report Series, Graduate Program in Operations Research and Industrial Engineering. The University of Texas at Austin, ORP96-09, 1996.
5. M. Hovestadt, O. Kao, A. Keller, A. Streit: Scheduling in HPC Resource Management Systems: Queuing vs. Planning, Proc. 9th Workshop on JSSPP at GGF8, LNCS 2862, pp. 1-20, 2003.
6. I. Kacem, S. Hammadi, P. Borne: Approach by Localization and Multi-objective Evolutionary Optimization for Flexible Job-Shop Scheduling Problems, IEEE Transactions on Systems, Man, and Cybernetics. Part C, Vol 32. N1, pp. 1-13, 2002.
7. S. Dauzere-Peres, J. Roux, J.B. Lasserre: Multi-resource shop scheduling with resource flexibility, European Journal of Operational Research, Vol 107, pp. 289-305, 1998.
8. N. Sadeh, Y. Nakakuki: Focused Simulated Annealing Search: An Application to Job Shop Scheduling, Annals of Operations Research, Vol 60, pp. 77-103, 1996.
9. J. Hoffmann: Extending FF to Numerical State Variables, Proc. 15th European Conference on Artificial Intelligence, Lyon, France, 2002.
10. V. Kumar: Algorithms for constraint-satisfaction problems: a survey, AI Magazine, Vol 13 n.1, pp.32-44, 1992.
11. F. Glover: Tabu search Part I, ORSA Journal on Computing, pp. 190-206, 1989.
12. F. Glover: Tabu search Part II, ORSA Journal on Computing, pp. 4-32, 1990.
13. M. Fox, D. Long: PDDL2.1: An extension of PDDL for expressing temporal planning domains, Journal of AI Research, Vol 20, pp. 61-124, 2003.