The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - Aug. (2012 vol.23)
pp: 1400-1414
Saeid Abrishami , Ferdowsi University of Mashhad, Mashhad
Mahmoud Naghibzadeh , Ferdowsi University of Mashhad, Mashhad
Dick H.J. Epema , Delft University of Technology, Delft
ABSTRACT
Recently, utility Grids have emerged as a new model of service provisioning in heterogeneous distributed systems. In this model, users negotiate with service providers on their required Quality of Service and on the corresponding price to reach a Service Level Agreement. One of the most challenging problems in utility Grids is workflow scheduling, i.e., the problem of satisfying the QoS of the users as well as minimizing the cost of workflow execution. In this paper, we propose a new QoS-based workflow scheduling algorithm based on a novel concept called Partial Critical Paths (PCP), that tries to minimize the cost of workflow execution while meeting a user-defined deadline. The PCP algorithm has two phases: in the deadline distribution phase it recursively assigns subdeadlines to the tasks on the partial critical paths ending at previously assigned tasks, and in the planning phase it assigns the cheapest service to each task while meeting its subdeadline. The simulation results show that the performance of the PCP algorithm is very promising.
INDEX TERMS
Grid computing, workflow scheduling, utility Grids, economic Grids, QoS-based scheduling.
CITATION
Saeid Abrishami, Mahmoud Naghibzadeh, Dick H.J. Epema, "Cost-Driven Scheduling of Grid Workflows Using Partial Critical Paths", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 8, pp. 1400-1414, Aug. 2012, doi:10.1109/TPDS.2011.303
REFERENCES
[1] D. Laforenza, "European Strategies Towards Next Generation Grids," Proc. Fifth Int'l Symp. Parallel and Distributed Computing (ISPDC '06), p. 11, 2006.
[2] J. Broberg, S. Venugopal, and R. Buyya, "Market-oriented Grids and Utility Computing: The State-of-the-Art and Future Directions," J. Grid Computing, vol. 6, no. 3, pp. 255-276, 2008.
[3] J. Yu and R. Buyya, "Scheduling Scientific Workflow Applications with Deadline and Budget Constraints Using Genetic Algorithms," Scientific Programming, vol. 14, nos. 3/4, pp. 217-230, 2006.
[4] E. Deelman et al., "Pegasus: A Framework for Mapping Complex Scientific Workflows Onto Distributed Systems," Science Programming, vol. 13, pp. 219-237, 2005.
[5] M. Wieczorek, R. Prodan, and T. Fahringer, "Scheduling of Scientific Workflows in the Askalon Grid Environment," SIGMOD Record, vol. 34, pp. 56-62, 2005.
[6] F. Berman et al., "New Grid Scheduling and Rescheduling Methods in the Grads Project," Int'l J. Parallel Programming, vol. 33, pp. 209-229, 2005.
[7] J. Yu and R. Buyya, "A Taxonomy of Workflow Management Systems for Grid Computing," J. Grid Computing, vol. 3, pp. 171-200, 2005.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, Jan. 1979.
[9] Y.K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors," ACM Computing Surveys, vol. 31, no. 4, pp. 406-471, 1999.
[10] H. Topcuoglu, S. Hariri, and M. Wu, "Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 260-274, Mar. 2002.
[11] R. Bajaj and D.P. Agrawal, "Improving Scheduling of Tasks in a Heterogeneous Environment," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 2, pp. 107-118, Feb. 2004.
[12] M.I. Daoud and N. Kharma, "A High Performance Algorithm for Static Task Scheduling in Heterogeneous Distributed Computing Systems," J. Parallel and Distributed Computing, vol. 68, no. 4, pp. 399-409, 2008.
[13] M. Wieczorek, A. Hoheisel, and R. Prodan, "Towards a General Model of the Multi-Criteria Workflow Scheduling on the Grid," Future Generation Computer Systems, vol. 25, pp. 237-256, 2009.
[14] J. Yu, M. Kirley, and R. Buyya, "Multi-Objective Planning for Workflow Execution on Grids," Proc. IEEE/ACM Eighth Int'l Conf. Grid Computing, pp. 10-17, 2007.
[15] I. Brandic, S. Benkner, G. Engelbrecht, and R. Schmidt, "QoS Support for Time-Critical Grid Workflow Applications," Proc. Int'l Conf. e-Science and Grid Computing, pp. 108-115, 2005.
[16] J. Yu, R. Buyya, and C.K. Tham, "Cost-Based Scheduling of Scientific Workflow Applications on Utility Grids," Proc. First Int'l Conf. e-Science and Grid Computing, pp. 140-147, July 2005.
[17] R. Sakellariou, H. Zhao, E. Tsiakkouri, and M.D. Dikaiakos, "Scheduling Workflows with Budget Constraints," Integrated Research in GRID Computing, CoreGRID Series, S. Gorlatch, and M. Danelutto, eds., pp. 189-202, Springer, 2007.
[18] R. Prodan and M. Wieczorek, "Bi-Criteria Scheduling of Scientific Grid Workflows," IEEE Trans. Automation Science and Eng., vol. 7, no. 2, pp. 364-376, Apr. 2010.
[19] A.K.M.K.A. Talukder, M. Kirley, and R. Buyya, "Multiobjective Differential Evolution for Scheduling Workflow Applications on Global Grids," Concurrency and Computation: Practice & Experience, vol. 21, pp. 1742-1756, 2009.
[20] W.N. Chen and J. Zhang, "An Ant Colony Optimization Approach to Grid Workflow Scheduling Problem with Various QoS Requirements," IEEE Trans. Systems, Man, and Cybernetics, vol. 39, no. 1, pp. 29-43, Jan. 2009.
[21] Y. Yuan, X. Li, Q. Wang, and X. Zhu, "Deadline Division-Based Heuristic for Cost Optimization in Workflow Scheduling," Information Sciences, vol. 179, no. 15, pp. 2562-2575, 2009.
[22] C.S. Yeo and R. Buyya, "A Taxonomy of Market-Based Resource Management Systems for Utility-Driven Cluster Computing," Software Practice and Experience, vol. 36, pp. 1381-1419, Nov. 2006.
[23] S. Verboven, P. Hellinckx, F. Arickx, and J. Broeckhove, "Runtime Prediction Based Grid Scheduling of Parameter Sweep Jobs," Proc. Asia-Pacific Conf. Services Computing, pp. 33-38, 2008.
[24] J. Yu, S. Venugopal, and R. Buyya, "A Market-Oriented Grid Directory Service for Publication and Discovery Of Grid Service Providers and Their Services," The J. Supercomputing, vol. 36, no. 1, pp. 17-31, 2006.
[25] R. Sakellariou and H. Zhao, "A Low-Cost Rescheduling Policy for Efficient Mapping of Workflows on Grid Systems," Science Programming, vol. 12, pp. 253-262, Dec. 2004.
[26] S. Bharathi, A. Chervenak, E. Deelman, G. Mehta, M.-H. Su, and K. Vahi, "Characterization of Scientific Workflows," Proc. Third Workshop Workflows in Support of Large Scale Science, 2008.
[27] R. Buyya and M. Murshed, "Gridsim: A Toolkit for the Modeling and Simulation Of Distributed Resource Management and Scheduling for Grid Computing," Concurrency and Computation: Practice and Experience, vol. 14, no. 13, pp. 1175-1220, 2002.
[28] R. Duan, R. Prodan, and T. Fahringer, "Performance and Cost Optimization for Multiple Large-Scale Grid Workflow Applications," Proc. ACM/IEEE Conf. Supercomputing, pp. 1-12, 2007.
[29] A. Afzal, J. Darlington, and A. McGough, "QoS-Constrained Stochastic Workflow Scheduling in Enterprise and Scientific Grids," Proc. IEEE/ACM Seventh Int'l Conf. Grid Computing (GRID '06), pp. 1-8, 2006.
[30] D.M. Quan and D.F. Hsu, "Mapping Heavy Communication Grid-Based Workflows Onto Grid Resources Within an SLA Context Using Metaheuristics," Int'l J. High Performance Computing Applications, vol. 22, no. 3, pp. 330-346, 2008.
[31] Q. Tao, H. Chang, Y. Yi, C. Gu, and Y. Yu, "Qos Constrained Grid Workflow Scheduling Optimization Based on a Novel Pso Algorithm," Proc. Eighth Int'l Conf. Grid and Cooperative Computing, pp. 153-159, 2009.
[32] I. Brandic, S. Pllana, and S. Benkner, "Specification, Planning, and Execution of Qos-Aware Grid Workflows within the Amadeus Environment," Concurrency and Computation: Practice and Experience, vol. 20, pp. 331-345, 2008.
[33] S. McGough, L. Young, A. Afzal, S. Newhouse, and J. Darlington, "Workflow Enactment in ICENI," Proc. UK e-Science All-Hands Meeting (AHM '04), pp. 894-900, 2004.
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool