워크플로우 작업의 효율적인 배치를 위한 다단계 워크플로우 그래프 분할 기법

A Multilevel Workflow Graph Partitioning Scheme for Efficient Placement of Workflow Tasks

  • 발행 : 2003.06.01

초록

워크플로우는 자동화 및 전산화된 업무 프로세스로 정의되며, 서로 관련성을 가지는 여러 개의 워크플로우 작업들로 구성된다. 오늘날 대부분의 업무 프로세스들은 지리적으로 떨어져 있는 서로 다른 부서 및 회사에서 수행되는 작업들을 포함하기 때문에 워크플로우는 본질적으로 분산성을 가진다. 분산 워크플로우 시스템에서 각 워크플로우 작업은 원격 호스트에 있는 공유 자원들을 활용하여 주어진 역할을 수행하고, 워크플로우 정의에 따라 다음 작업들을 수행하기 위해 제어를 전달한다. 따라서 고성능을 요구하는 워크플로우 환경을 지원하기 위해서는 워크플로우 작업들을 적절한 호스트에 배치해야 한다. 본 논문에서는 효율적인 워크플로우 작업 배치를 위한 다단계 워크플로우 그래프 분할 기법을 제안한다. 이 방법은 워크플로우의 수행 과정에서 발생하는 원격 통신 비용을 최소화하여 워크플로우의 처리 성능을 향상시킬 수 있다.

Workflow is defined as the automation of a business process, and consists of interrelated workflow tasks. Because many modem business processes nay involve activities that are geographically distributed between different departments or organizations, workflow inherently has the characteristics of distribution. In distributed workflow systems, each workflow task performs its assigned role by utilizing information resources placed at some hosts, and then transmits workflow execution control to the next tasks in a workflow definition. Hence, it is very important to appropriately allocate workflow tasks to hosts for high performance workflow processing. In this paper, we propose a multilevel workflow graph partitioning scheme for efficient placement of workflow tasks. This method can improve the performance of workflow processing by minimizing the remote communication costs occurred during workflow execution.

키워드

참고문헌

  1. P. Lawrence, Workflow Handbook 1997, John Wiley & Sons Ltd, 1997
  2. F. Leyrnann and D. Roller, Production Workflow: Concepts and Techniques, Prentice Hall, N.J., 1999
  3. J. A. Miller, A. P. Sheth, K. J. Kochut, and X. Wang, 'CORBA-Based Run-Time Architectures for Workflow Management Systems,' Journal of Database Management, 7(1):16-27, 1996 https://doi.org/10.4018/jdm.1996010102
  4. S. K. Oh, J. H. Son, Y. J. Lee, and M. H. Kim, 'An Efficient Method for Allocating Workflow Tasks to Improve the Performance of Distributed Workflows,' In Proceedings of the International Conference on Computer Science and Informatics, 2000
  5. T. Bauer and P. Dadam, 'A Distributed Execution Environment for Large-Scale Workflow Management Systems with Subnets and Server Migration,' In Proceedings of the 2nd IFCIS Conference on CoopIS, pages 99-108, 1997 https://doi.org/10.1109/COOPIS.1997.613807
  6. T. Bauer and P. Dadam, 'Efficient Distributed Workflow Management Based on Variable Server Assignments.' In Proceedings of the Conference on Advanced Information Systems Engineering, pages 94-109, 2000
  7. G. Karypis and V. Kumar, 'Multilevel k-way Partitioning Scheme for Irregular Graphs,' Journal of Parallel and Distributed Computing, 48(1):96-129, 1998 https://doi.org/10.1006/jpdc.1997.1404
  8. B. Hendrickson and R. Leland, 'A Multilevel Algorithm for Partitioning Graphs,' Technical Report SAND93-1301, Sandia National Laboratories, 1993
  9. T. Bui and C. Jones, 'A Heuristic for Reducing Fill- In in Sparse Matrix Factorization,' In Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing, pages 445-452, 1993
  10. J. Miller, D. Palaniswami, A. Sheth, K. Kochut, and H. Singh, 'WebWork: METEOR2's Web-based Workflow Management System,' Journal of Intelligence Information Management Systems, 10(2): 185 -215, 1997 https://doi.org/10.1023/A:1008660827609
  11. S. Y. Hwang and C. T. Yang, 'Component and Data Distribution in a Distributed Workflow Management System,' In Proceedings of the IEEE Software Engineering Conference, pages 244-251, 1998 https://doi.org/10.1109/APSEC.1998.733726
  12. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, McGraw-Hill Book Company, 1998
  13. D. B. West, Introduction to Graph Theory, Prentice- Hall, 2001