AN EFFECTIVE METHOD FOR QOS -CONSTRAINED WORK FLOW SCHEDULING OF CLOUD SERVICES
Keywords:Cloud computing; SaaS Clouds; Grid computing; Workflow scheduling; QoS-based scheduling.
Cloud computing is the most recent promising trending that provides hardware infrastructures and software applications as a service. Users can use these services through Service Level Agreement (SLA) which defines user's essential Quality of Service (QoS) parameters on pay-per-use basis. In cloud computing the workflow scheduling is a difficult problem to be solved. Normally the scheduling methods are tried to diminish the execution time of the workflows. There are several existing approaches to solve the difficulty of multi-objective scheduling in cloud but, there exists the problem of computational complexity and the budget constraints. To overcome this problem, in existing the SaaS Cloud Partial Critical Paths (SC-PCP) algorithm was enhanced, which is an extension of the preceding one for the SaaS Clouds. The idea of the SC-PCP algorithm is to form a schedule that decreases the total execution cost of a workflow, while satisfying a user defined deadline for the total execution time. In this work the main problem is that the time and cost are the only considered as parameters for the deadline. To overcome this problem, in proposed work, there are three proposals are followed. The first proposal is; QoS needed by the customers for selecting a Cloud service provider is based on: Accountability, Agility, Assurance of Service, Security and Privacy, and Usability where the drawback of existing method is solved. To solve this problem as a second proposal work, a (Price- and-Time-Slot-Negotiation) PTN mechanism devised that enables both providers and customers to do the following: 1) specify their preferences for price and time slot and 2) search for mutually acceptable prices and time slots. Finally, quantifying the performance of scheduling and allocation policy on a Cloud infrastructure (hardware, software, services) for different application and service models below unreliable load energy performance (power consumption, heat dissipation), and system dimension is an extremely challenging problem to tackle. To overcome this problem, the SC-PCP algorithm is expanded to support other IaaS Cloud computing model. This final proposal work can be implemented with the use of cloud sim.
 Juve, G., Deelman, E., Vahi, K., Mehta, G., Berriman, B., Berman, B.P. and Maechling, P. "Scientific workflow applications on Amazon EC2‘‘, 5th IEEE International Conference on e-Science, Oxford, UK (2009).
 Hoffa, C., Mehta, G., Freeman, T., Deelman, E., Keahey, K., Berriman, B. and Good, J. "On the use of cloud computing for scientific workflows‘‘, Fourth IEEE Int‘l Conference on e-Science (e-Science 2008), Indiana, USA, pp. 640–645 (2008).
 Deelman, E. "Grids and Clouds: making workflow applications work in heterogeneous distributed environments‘‘, Int. J. High Perform. Comput. Appl., 24(3), pp. 284–298 (2010).
 Weinhardt, C., Anandasivam, A., Blau, B. and Stoesser, J. "Business models in the service world‘‘, IEEE IT Prof., 11(2), pp. 28–33 (2009).  Deelman, E., et al. "Pegasus: a framework for mapping complex scientific workflows onto distributed systems‘‘, Sci. Program., 13, pp. 219–237 (2005).
 Wieczorek, M., Prodan, R. and Fahringer, T. "Scheduling of scientific workflows in the ASKALON grid environment‘‘, SIGMOD Rec., 34(3), pp. 56–62 (2005).
 Berman, F., et al. "New grid scheduling and rescheduling methods in the GrADS project‘‘, Int. J. Parallel Program., 33(2), pp. 209–229 (2005).
 Ramakrishnan, L., et al. "VGrADS: enabling e-science workflows on grids and clouds with fault tolerance‘‘, ACM/IEEE International Conference on High Performance Computing and Communication (SC09), Portland, Oregon, USA (2009).
 Ostermann, S., Prodan, R. and Fahringer, T. "Extending grids with cloud resource management for scientific computing‘‘, 10th IEEE/ACM International Conference on Grid Computing, Banff, Alberta, Canada, pp. 42–49 (2009).
 Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman (1979).
 Kwok, Y.K. and Ahmad, I. "Static scheduling algorithms for allocating directed task graphs to multiprocessors‘‘, ACM Comput. Surv., 31(4), pp. 406–471 (1999).
 Topcuoglu, H., Hariri, S. and Wu, M. "Performance-effective and low complexity task scheduling for heterogeneous computing‘‘, IEEE Trans. Parallel Distrib. Syst., 13(3), pp. 260–274 (2002).
 Bajaj, R. and Agrawal, D.P. "Improving scheduling of tasks in a heterogeneous environment‘‘, IEEE Trans. Parallel Distrib. Syst., 15(2), pp. 107–118 (2004).
 Wieczorek, M., Hoheisel, A. and Prodan, R. "Towards a general model of the multi-criteria workflow scheduling on the grid‘‘, Future Gener. Comput. Syst., 25(3), pp. 237–256 (2009).
 Abrishami, S., Naghibzadeh, M. and Epema, D. "Cost-driven scheduling of grid workflows using partial critical paths‘‘, Proceedings of the 11th IEEE/ACM Int‘l Conference on Grid Computing (Grid2010), Brussels, Belgium, pp. 81–88 (2010).
Authors need to sign following agreement with International Journal of MC Square Scientific Research before publishing their articles:
- Authors need to return copyright form to Journal Editor-in-chief to proceed their articles for publication. Meantime, the journal licensed under a Creative Commons Attribution License, which permits other user to distribute the work with an acknowledgement of the authors for International Journal of MC Square Scientific Research.
- Authors are also able to share their separate, additional contractual arrangements for the non-restricted contribution of the journal with an acknowledgement of publication in International Journal of MC Square Scientific Research.
- Authors are allowed and encouraged to share their work during the submission process for increasing citation and exploring to increase the paper availability in worldwide way. The Effect of Open Access.