Resource Planning for Massive Number of Process Instances

Resource allocation has been recognised as an important topic for business process execution. In this paper, we focus on planning resources for a massive number of process instances to meet the process requirements and cater for rational utilisation of resources before execution. After a motivating example, we present a model for planning resources for process instances. Then we design a set of heuristic rules that take both optimised planning at build time and instance dependencies at run time into account. Based on these rules we propose two strategies, one is called holistic and the other is called batched, for resource planning. Both strategies target a lower cost, however, the holistic strategy can achieve an earlier deadline while the batched strategy aims at rational use of resources. We discuss how to find balance between them in the paper with a comprehensive experimental study on these two approaches.

[1]  Radu Prodan,et al.  Scheduling of scientific workflows in the ASKALON grid environment , 2005, SGMD.

[2]  Johann-Christoph Freytag,et al.  Adaptive workflow scheduling under resource allocation constraints and network dynamics , 2008, Proc. VLDB Endow..

[3]  Wil M. P. van der Aalst,et al.  Work Distribution and Resource Management in BPEL4People: Capabilities and Opportunities , 2008, CAiSE.

[4]  Roger Atsa Etoundi,et al.  Feature-oriented workflow modelling based on enterprise human resource planning , 2006, Bus. Process. Manag. J..

[5]  Jiajie Xu,et al.  Resource Allocation vs. Business Process Improvement: How They Impact on Each Other , 2008, BPM.

[6]  Rajkumar Buyya,et al.  Cost-based scheduling of scientific workflow applications on utility grids , 2005, First International Conference on e-Science and Grid Computing (e-Science'05).

[7]  Amit P. Sheth,et al.  Modeling Quality of Service for Workflows and Web Service Processes , 2002 .

[8]  Ming-Chien Shan,et al.  Policies in a resource manager of workflow systems: modeling, enforcement and management , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[9]  Wil M. P. van der Aalst,et al.  Workflow Resource Patterns: Identification, Representation and Tool Support , 2005, CAiSE.

[10]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[11]  Johann Eder,et al.  Time Constraints in Workflow Systems , 1999, CAiSE.

[12]  Albert Y. Zomaya,et al.  Observations on Using Genetic Algorithms for Dynamic Load-Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[13]  Kuo-Chi Lin,et al.  An incremental genetic algorithm approach to multiprocessor scheduling , 2004, IEEE Transactions on Parallel and Distributed Systems.

[14]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[15]  Ismail Hakki Toroslu,et al.  An architecture for workflow scheduling under resource allocation constraints , 2005, Inf. Syst..