w-TG: A Combined Algorithm to Optimize the Runtime of the Grid-Based Workflow Within an SLA Context

In the Grid Computing environment, many users need the results of their calculations within a specific period of time. Examples of those users are weather forecasters running weather forecasting workflows, and automobile producers running dynamic fluid simulation workflow Lovas et al. (2004). Those users are willing to pay for getting their work completed on time. However, this requirement must be agreed on by both, the users and the Grid provider, before the application is executed. This agreement is contained in the Service Level Agreement (SLA) Sahai et al. (2003). In general, SLAs are defined as an explicit statement of expectations and obligations in a business relationship between service providers and customers. SLAs specify the a-priori negotiated resource requirements, the quality of service (QoS), and costs. The application of such an SLA represents a legally binding contract. This is a mandatory prerequisite for the Next Generation Grids.

[1]  Amit P. Sheth,et al.  An overview of workflow management: From process modeling to workflow automation infrastructure , 1995, Distributed and Parallel Databases.

[2]  Rajkumar Buyya,et al.  Critical-path and priority based algorithms for scheduling workflows with parameter sweep tasks on global grids , 2005, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05).

[3]  K. Mani Chandy,et al.  A comparison of list schedules for parallel processing systems , 1974, Commun. ACM.

[4]  Yolanda Gil,et al.  Pegasus: Mapping Scientific Workflows onto the Grid , 2004, European Across Grids Conference.

[5]  W Chiu,et al.  EMAN: semiautomated software for high-resolution single-particle reconstructions. , 1999, Journal of structural biology.

[6]  Péter Kacsuk,et al.  Workflow Support for Complex Grid Applications: Integrated and Portal Solutions , 2004, European Across Grids Conference.

[7]  Philippe Chrétienne,et al.  C.P.M. Scheduling with Small Communication Delays and Task Duplication , 1991, Oper. Res..

[8]  Francine Berman,et al.  New Grid Scheduling and Rescheduling Methods in the GrADS Project , 2004, IPDPS Next Generation Software Program - NSFNGS - PI Workshop.

[9]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[10]  Kenneth Steiglitz,et al.  Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems , 1974, JACM.

[11]  Richard Wolski,et al.  Experiences with predicting resource performance on-line in computational grid settings , 2003, PERV.

[12]  C. Kesselman,et al.  Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory , 2004 .

[13]  Boontee Kruatrachue,et al.  Grain size determination for parallel processing , 1988, IEEE Software.

[14]  Tzong-Jer Yang,et al.  A comparison of clustering heuristics for scheduling dags on multiprocessors , 1990 .

[15]  Laurence T. Yang,et al.  RouteGA: A Grid Load Balancing Algorithm with Genetic Support , 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07).

[16]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[17]  Achim Streit,et al.  Scheduling in HPC Resource Management Systems: Queuing vs. Planning , 2003, JSSPP.

[18]  Ken Kennedy,et al.  TaskScheduling Strategies forWorkflow-based Applications inGrids , 2005 .

[19]  Max Crochemore,et al.  Algorithms and Theory of Computation Handbook , 2010 .

[20]  Radu Prodan,et al.  Run-time Optimisation of Grid Workflow Applications , 2006, 2006 7th IEEE/ACM International Conference on Grid Computing.

[21]  Rajkumar Buyya,et al.  A taxonomy of scientific workflow systems for grid computing , 2005, SGMD.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Akhil Sahai,et al.  Specifying and monitoring guarantees in commercial grids through SLA , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[24]  Edward A. Lee,et al.  Declustering: A New Multiprocessor Scheduling Technique , 1993, IEEE Trans. Parallel Distributed Syst..

[25]  Francine Berman,et al.  Heuristics for scheduling parameter sweep applications in grid environments , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[26]  Jörn Altmann,et al.  Mapping a group of jobs in the error recovery of the Grid-based workflow within SLA context , 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07).

[27]  Subhash Saini,et al.  Local grid scheduling techniques using performance prediction , 2003 .

[28]  Nirwan Ansari,et al.  A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[29]  Jörn Altmann,et al.  Business Model and the Policy of Mapping Light Communication Grid-Based Workflow Within the SLA Context , 2007, HPCC.

[30]  Sadiq M. Sait,et al.  GSA: scheduling and allocation using genetic algorithm , 1994, EURO-DAC '94.

[31]  Dang Minh Quan,et al.  On Architecture for SLA-Aware Workflows in Grid Environments , 2005, AINA.

[32]  Jörn Altmann,et al.  Mapping of SLA-based Workflows with light Communication onto Grid Resources , 2007, GSEM.

[33]  Tao Yang,et al.  A Comparison of Clustering Heuristics for Scheduling Directed Acycle Graphs on Multiprocessors , 1992, J. Parallel Distributed Comput..

[34]  Dang Minh Quan.  Error recovery mechanism for grid-based workflow within SLA context , 2007, Int. J. High Perform. Comput. Netw..

[35]  Hesham El-Rewini,et al.  Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..

[36]  Vivek Sarkar,et al.  Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .

[37]  D. Frank Hsu,et al.  Network-based resource allocation for Grid Computing within an SLA context , 2006, 2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06).

[38]  A. Elmagarmid.  Database transaction models for advanced applications , 1992 .

[39]  David Abramson,et al.  GridRod: a dynamic runtime scheduler for grid workflows , 2007, ICS '07.