Journal of KIISE:Databases (한국정보과학회논문지:데이타베이스)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Analyses on the Workflow Critical Path

워크플로우 임계 경로에 관한 분석

  • 손진현 (한국과학기술원 전자전산학과 연구원) ;
  • 장덕호 ((주)디지탈아리아) ;
  • 김명호 (한국과학기술원 전자전산학과)
  • Published : 2001.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

The critical path has been widely applied to many areas of computer engineering especially a directed acyclic graph. Its concept can also be useful in the context of a workflow. The workflow critical path is defined as a path which has the longest average execution time from the start activity to the end activity of workflow. Because there can be several concurrently executed workflow instances for a specific workflow a new method to determine the critical path should be developed. In this paper we specify our workflow queuing network model from which we can easily analyze many workflow characteristics. Based on this workflow model. we propose a method to identify the critical path In addition, we show come workflow areas which can utilze the critical path.

임계 경로는 방향성 비순환 그래프 분야를 포함하여 많은 컴퓨터 공학 분야들에서 널리 활용되어 왔다. 워크플로우에서 임계 경로는 여러 개의 예상 수행 경로들 중에서 가장 긴 평균 수행 시간을 가지는 하나의 경로로 정의되며, 이 개념은 워크플로우 옹용 영역들에서 유용하게 사용될 수 있다. 일반적 으로 특정 워크플로우에 대해 동시에 수행되는 워크플로우 인스턴스들이 여러 개가 존재하므로 워크플로 우 환경에 적합한 새로운 임계 경로 결정 방법의 개발이 필요하다. 본 논문에서 우리는 먼저 워크플로우 특징들을 쉽게 분석할 수 있는 워크플로우 대기 행렬 네트워크 모델에 대해서 언급한다. 그리고, 이 모델을 기반으로 워크플로우 임계 경로를 결정하는 방법을 제안한다. 추가적으로. 워크플로우 임계 경로 개념을 효율적으로 활용할 수 있는 워크플로우 응응 영역들을 몇가지 소개한다.

Keywords

References

  1. Lawrence, P., Workflow Handbook 1997, John Wiley & Sons Ltd, 1997
  2. Leymann, F., and Roller, D., Production Workflow: Concepts and Techniques, Prentice Hall, N.J., 1999
  3. Kyung Tek Lee and Jacob A. Abraham, ritical Path Identification and Delay Tests of Dynamic Circuits,Proceedings of International Test Conference, (1999) 421-430 https://doi.org/10.1109/TEST.1999.805764
  4. Cui-Qing Yand and Barton P. Miller, Critical Path Analysis for the Execution of Parallel and Distributed Programs, Proceedings of Hth International Conference on Distributed Computing Systems, (1988) 366-373 https://doi.org/10.1109/DCS.1988.12538
  5. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, The MIT Press, 1994
  6. Harndy A. Taha, Operations Research, Macmillan Publishing Company, 1992
  7. Son, J. H. and Kim, M. H., Improving the Performance of Time-Constrained Workflow Processing, Journal of Systems and Software, Vol 58/3, pp 209-217, Sep 2001 https://doi.org/10.1016/S0164-1212(01)00039-5
  8. Oh, S. K., Son, J. H., Lee, Y. J., and Kim, M. H., An Efficient Method for Allocating Workflow Tasks to Improve the Performance of Distributed W orkflows, International Conference on Computer Science and Informatics, 2000
  9. Dongsoo Han, Jaeyong Shim, and Chansu Yu, ICU/COWS: A Distributed Transactional Workflow System Supporting Multiple Workflow Types, IEICE Transactions on Information and Systems, E83-D(7) (2000) 1514-1525
  10. Hagen, C, and Alonso, G., Flexible exception handling in the Opera process support system, In Proceedings of the 18th IEEE International Conference on Distributed Computing Systems, 1998 https://doi.org/10.1109/ICDCS.1998.679803
  11. Heinl, P., Exceptions during workflow execution, In Proceedings of the Sixth International Conference on Extending Database Technology, 1998
  12. Pozewaunig, H., Eder, J., and Liebhart, W., ePERT: Extending PERT for workflow management systems, The 1st European Symposium in ADBIS, (1997) 217-224
  13. Panagos, E. and Rabinovich, M., Predictive Workflow Management, The 3th International Workshop on NGITS, 1997
  14. Eder, J. Panagos, E., and Rabinovich, M., Time Constraints in Workflow Systems, Conference on Advanced Information Systems Engineering, (1999) 286-300
  15. Panagos, E. and Rabinovich, M., Reducing Escalation-Related Costs in WFMSs, In Proceedings of the NATO Advanced Study Institute on Workflow Management Systems and Interoperability, (1997) 106-128
  16. Kao, B. and Garcia-Molina, H., Deadline assignment in a distributed soft real-time system, In Proceedings of the 13th International Conference on Distributed Computing Systems, (1993) 428-437 https://doi.org/10.1109/ICDCS.1993.287682
  17. Son, J. H., Kim, J. H., and Kim, M. H., Hard/Soft Deadline Assignment for High Workflow Throughput, In Proceedings of the 1999 International Symposium on Database Applications in Non- Traditional Environments, (999) 272-278
  18. Reichert, M. and Dadam, P., $Adept_{flex}$-Supporting Dynamic Changes of W orkflows Without Loosing Control, Journal of Intelligent Information Systems, 10(2) (1998) 93-129 https://doi.org/10.1023/A:1008604709862
  19. Workflow Management Coalition: Terminology & Glossary, Document No. WFMC-TC-1011, Issue 3.0. 1999
  20. Kleinrock, L., Queueing Systems: Computer Applications, Prentice Hall, 1989
  21. Wolff, R W., Stochastic Modeling and the Theory of Queues, Prentice Hall, 1989
  22. Disney, R L., Queueing Networks, American Mathematical Society Proceedings of Symposium in Applied Mathematics, (1981) 53-83