Resource allocation algorithm for light communication grid-based workflows within an SLA context

International Journal of Parallel, Emergent and Distributed Systems

Volumn 24, Issue 1, 2009, Pages 31-48

  Dang, Minh Quan ^a   Altmann, Jorn ^a  

^a International University in Germany   (Germany)

Author keywords

Grid computing; Light communication workflow; Mapping; Service level agreement

Indexed keywords

CONFORMAL MAPPING; MANAGEMENT; NETWORK ARCHITECTURE; OCEAN CURRENTS; PLANNING; RESOURCE ALLOCATION;

COMMUNICATION GRIDS; GRID RESOURCES; GRID-BASED; MAPPING ALGORITHMS; MAPPING MECHANISMS; PERFORMANCE MEASUREMENTS; RESEARCH TOPICS; RESOURCE ALLOCATION ALGORITHMS; SERVICE LEVEL AGREEMENT; SERVICE LEVEL AGREEMENTS; SYSTEM COMPONENTS; WORKFLOWS;

GRID COMPUTING;

EID: 57349176047     PISSN: 17445760     EISSN: 17445779     Source Type: Journal    
DOI: 10.1080/17445760802225868     Document Type: Article

References (41)

1. T.L. Adam, K.M. Chandy, and J.R. Dickson, A comparison of list scheduling for parallel processing systems, Commun. ACM 17 (1974), pp. 685-690.
2. I. Brandic, S. Benkner, G. Engelbrecht, and R. Schmidt, QoS support for time-critical grid workflow applications, Paper presented at the e-Science 2005 conference, Melbourne, Australia, 5-8 December (2005).
3. P. Brucker, Scheduling Algorithm, 3rd ed. Springer-Verlag, Berlin, 2004.
4. L. Burchard, M. Hovestadt, O. Kao, A. Keller, and B. Linnert, The virtual resource manager: An architecture for SLA-aware resource management, Paper presented at the IEEE CCGrid 2004 conference, Chicago, USA, 19-22 April (2004).
5. R. Buyya, M. Murshed, D. Abramson, and S. Venugopal, Scheduling parameter sweep applications on global grids: A deadline and budget constrained cost-time optimisation algorithm, Softw. Pract. Exper. (SPE) 35 (2005), pp. 491-512.
6. J. Cao, S.A. Jarvis, S.A. Saini, and G.R. Nudd, Gridflow: Workflow management for grid computing, Paper presented at the 3rd IEEE/ACM Int. Symp. on Cluster Computing and the Grid, Tokyo, Japan, 12-15 May (2003).
7. E.G. Coffman, Computer and Job-Shop Scheduling Theory, John Wiley and Sons, Inc., New York, NY, 1976.
8. J.Y. Colin and P. Chretienne, Scheduling with small computation delays and task duplication, Oper. Res. 39 (1991), pp. 680-684.
9. E. Deelman, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, S. Patil, M. Su, K. Vahi, and M. Livny, Pegasus : Mapping scientific workflows onto the grid, Paper presented at the 2nd European Across Grids Conference, Nicosia, Cyprus, 28-30 January (2004).
10. M.R. Gary and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., New York, NY, 1979.
11. LP. Gent, E. Macintyre, P. Prosser, B.M. Smith, and T. Walsh, An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem, Paper presented at the Principles and Practices of Constraint Programming conference - CP96, Cambridge, USA, 19-22 August (1996).
12. A. Gerasoulis and T. Yang, A comparison of clustering heuristics for scheduling DAG's on multiprocessors, J. Parallel Distrib. Comput. 16 (1992), pp. 276-291.
13. G. Glover, Tabu search: Part I, ORSA J. Comput. 1 (1989), pp. 190-206.
14. F. Glover, Tabu search: Part II, ORSA J. Comput. 2 (1990), pp. 4-32.
15. E.S.H. Hou, N. Ansari, and H. Ren, A genetic algorithm for multiprocessor scheduling, IEEE Trans. Parallel Distrib. Syst. 5 (1994), pp. 113-120.
16. M. Hovestadt, O. Kao, A. Keller, and A. Streit, Scheduling in HPC resource management systems: Queuing vs. planning, Paper presented at the 9th Workshop on JSSPP at GGF8, Washington, USA, 24 June (2003).
17. K. Jansen, M. Mastrolilli, and R. Solis-Oba, Approximation algorithms for flexible job shop problems, Paper presented at the Latin American Theoretical Informatics conference (LATIN'2000), Punta del Este, Uruguay, 10-14 April (2000).
18. Y. Jia and R. Buyya, Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms, Sci. Prog. Journal 14 (2006), pp. 217-230.
19. I. Kacem, S. Hammadi, and P. Borne, Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems, IEEE Trans. Syst. Man Cyber. Part C 32 (2001), pp. 1-13.
20. S. Kirkpatrick, C. Gelatt, and M. Vecchi, Optimization bv simulated annealing, Science 220 (1983), pp. 671-680.
21. W.H. Kohler and K. Steiglitz, Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems, J. ACM 21 (1974), pp. 140-156.
22. B. Kruatrachue and T.G. Lewis, Duplication Scheduling Heuristics (DSH): A New Precedence Task Scheduler for Parallel Processor Systems, Oregon State University, Corvallis, OR, 1987.
23. B. Kruatrachue and T. Lewis, Grain size determination for parallel processing, IEEE Softw. 5 (1988), pp. 23-32.
24. V. Kumar, Algorithms for constraint-satisfaction problems: A survey, AI Magazine 13 (1992), pp. 32-44.
25. Y.K. Kwok and I. Ahmad, Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Comput. Surv. (CSUR) 31 (1999), pp. 406-471.
26. R. Lovas, G. Dózsa, P. Kacsuk, N. Podhorszki, and D. Drótos, Workflow support for complex grid applications: Integrated and portal solutions, Paper presented at the 2nd European Across Grids Conference, Nicosia, Cyprus, 28-30 January (2004).
27. M. Mastrolilli and L.M. Gambardella, Effective neighborhood functions for the flexible job shop problem, J. Sched. 3 (2000), pp. 3-20.
28. E. Nowicki and C. Smutnicki, An advanced taboo search algorithm for the job shop problem, J. Sched. 8(2005), pp. 145-159.
29. D.M. Quan, Mapping heavy communication workflows onto grid resources within an SLA context, Paper presented at the 2th High Performance Computing and Communication Conference, Munich, Germany, 13-15 September (2006).
30. , Error recovery mechanism for grid-based workflow within SLA context, Int. J. High Perform. Comput. Netw. 5 (2007), pp. 110-121.
31. D.M. Quan and J. Altmann, Bilateral bargaining game and fuzzy logic in the system handling SLA-based workflow, Paper presented at the Symposium on Web and Mobile Information Services (WAMIS08), Okinawa, Japan, 27 March (2008).
32. D.M. Quan and O. Kao, Mapping grid job flows to grid resources within SLA context, Paper presented at the European Grid Conference (EGC 2005), Amsterdam, The Netherlands, 14-16 February (2005).
33. , On architecture for an SLA-aware job flows in grid environments, J. Interconnect. Netw. 6 (2005), pp. 245-264.
34. , SLA negotiation protocol for grid-based workflows, Paper presented at the International Conference on High Performance Computing and Communications (HPPC-05), Sorrento, Italy, 21-23 September (2005).
35. H.E. Rewini and T.G. Lewis, Scheduling parallel program tasks onto arbitrary target machines, J. Parallel Distrib. Comput. 9 (1990), pp. 138-153.
36. N. Sadeh and M.S. Fox, Variable and value ordering heuristics for the job shop constraint satisfaction problem, Artif. Intell. 86 (1996), pp. 1-41.
37. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, MIT Press, Cambridge, MA, 1989.
38. A. Shahid, S.T. Muhammed, and M. Sadiq, GSA: Scheduling and allocation using genetic algorithm, Paper presented at the Conference on European Design Automation, Paris, France, 19-23 September (1994).
39. G.C. Sih and E.A. Lee, Declustering: A new multiprocessor scheduling technique, IEEE Trans. Parallel Distrib. Syst. 4 (1993), pp. 625-637.
40. D.P. Spooner, S.A. Jarvis, J. Cao, S. Saini, and G.R. Nudd, Local grid scheduling techniques using performance prediction, Paper presented at the Computers and Digital Techniques 2003 conference, Munich, Germany, 3-7 March (2003).
41. L. Zeng, B. Benatallah, A. Ngu, M. Dumas, J. Kalagnanam, and H. Chang, QoS-Aware middleware for web services composition, IEEE Trans. Software Eng. 30 (2004), pp. 311-327.