• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.138-147
• /
• 2002

The concept of the critical path in the workflow is important because it can be utilized In many issues in workflow systems, e.g., workflow resource management and workflow time management. However, the critical path in the contest of the workflow has not been much addressed in the past. This is because control flows in the workflow, generally including sequence, parallel, alternative, iteration and so on, are much more complex than those in the ordinary graph or network. In this paper we first describe our workflow model that has considerable work(low control constructs. They would provide the sufficient expressive power for modeling the growing complexities of today's most business processes. Then, we propose a method to systematically determine the critical path in a workflow schema built by the workflow control constructs described in our workflow model.

• The Journal of Information Systems
• /
• v.12 no.1
• /
• pp.145-158
• /
• 2003

Workflow is the automation of a business process, in whole or part, during which documents, information or tasks are passed from one participant to another for action, according to a set of procedural rules. The software selection problem is made difficult by the multiplicity of competing products and the lack of expertise and experience of users in the methods of software evaluation. Although the selection process for workflow is similar to that proposed for the acquisition of any software packages, differences arise in their evaluation criteria and choice methods. In this paper, we suggest the Analytic Hierarchy Process(AHP) method for selecting workflow software. The AHP is an intuitively easy method for formulating and analyzing decisions. It was developed to solve a specific class of problems that involves prioritization of potential alternate solutions. We showed how to evaluate 9 commercial workflow products by deciding the relative importance of the main criteria in the AHP model. We utilized the evaluation data for criteria ready suggested by specialist groups. Our methodology will be helpful to those who are going to adopt a best workflow product in their organizations. Although the criteria and their evaluation scores regarding workflow products are suggested, it is not easy to apply them to a real case and get solutions without a model.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.13-20
• /
• 2004

Grid system has the potential to resolve the current need of bioinformatics for super-computing environment inexpensively. There are already several Grid applications of bioinformatics tools. To solve the real-world bioinformatics problems, however, the various integration of each tool is necessary in addition to the implementation of more basic tools. Workflow based problem solving environment can be the efficient solution for this type of software development. There are still heavy overhead, however, to develop and implement workflow model on current Grid system. He re we propose a model of simple problem solving environment that enables component based workflow design of integrated bioinformatics applications on Grid environment by using Condor functionalities. We realized this model for practical bioinformatics solutions of a genome sequence analysis and a comparative genome analysis. We implemented necessary bioinformatics tools and interfacing tools as the components, and combine them in the workflow model of each solution by using the tools presented in Condor.

• Journal of Internet Computing and Services
• /
• v.13 no.2
• /
• pp.109-118
• /
• 2012

This paper theoretically derives an algorithm to discover a new type of workflow-based knowledge from workflow models, which is termed workflow-based affiliation network knowledge. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict a series of workflow-based knowledge from workflow models and their execution histories. So, this paper proposes a knowledge discovery algorithm which is able to discover workflow-based affiliation networks that represent the association and participation relationships between activities and performers defined in ICN-based workflow models. In order particularly to prove the correctness and feasibility of the proposed algorithm, this paper tries to apply the algorithm to a specific workflow model and to show that it is able to derive its corresponding workflow-based affiliation network knowledge.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.662-673
• /
• 2003

This paper proposed a workflow enactment model to provide process management functions for the next generation Internet service environment such as Web Service and Grid Computing. The existing enterprise workflow enactment models could not meet the scalability and reliability requirements for aforementioned environments. To satisfy these requirements, this study addressed on applying P2P model to the workflow enactment model. Mathematical description and proof were employed to show the recovery based on set theory and we also showed performance enhancement through simulations, which demonstrated a comprehensive result giving more than 100 times fast response time than the existing centralized model on the same resources.

• Proceedings of the CALSEC Conference
• /
• 2003.09a
• /
• pp.230-235
• /
• 2003

A Workflow Management System is one which provides procedural automation of a business process by management of the sequence of work activities. The existing workflow management systems have limitation of interaction among application systems. In this paper, we propose a new workflow management system that can be adapted in dynamically changed paradigm of distributed computing by using Web Service. System Architecture and prototyping execution model of the system is described in BPEL4WS.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.65-71
• /
• 2016

In this paper, we propose a novel analysis method and its algorithms to perform the betweenness centrality measurements on a valued and directed workflow-supported social network. The conventional workflow-supported social network model is to represent the existences of task transferring relationships among their performers by using a binary social network. However, it is necessary to consider not only the existences of task transferring relationships but also their quantities and directions in order to obtain much more effective and sophisticated analysis results. In conclusion, this paper newly defines a concept of valued and directed workflow-supported social network, and its betweenness centrality analysis method and algorithms. Especially, to verify the proposed method and algorithms, we try to apply the conventional method and the proposed method to an example workflow model respectively, and compare their betweenness centrality analysis results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3096-3117
• /
• 2013

To execute the performance driven Grid applications, an effective and scalable workflow scheduling is seen as an essential. To optimize cost & makespan, in this paper, we propose a Scalable Cost-Time Trade-off (SCTT) model for scheduling workflow tasks. We have developed a heuristic algorithm known as Scalable Cost-Time Trade-off Scheduling (SCTTS) with a lower runtime complexity based on the proposed SCTT model. We have compared the performance of our proposed approach with other heuristic and meta-heuristic based scheduling strategies using simulations. The results show that the proposed approach improves performance and scalability with different workflow sizes, task parallelism and heterogeneous resources. This method, therefore, outperforms other methods.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.677-687
• /
• 2001

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.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.6
• /
• pp.121-130
• /
• 2020

In order to provide customized services according to a specific user or environment, various service scenarios should be developed based on context-aware workflow model. As the context-aware workflow model is constructed using limited context information and service information in the service domain, overlapping elements can occur in many service scenarios. The repetitive work process that results from these overlapping elements delays the development process of the service scenario. Therefore, the elements of the context-aware workflow model must be reused to solve the unnecessary work processes of service scenario development. In this paper, we propose a reuse method XML Object in context-aware workflow model to improve the process of service scenario development. The proposed method documents and manages the independent XML Object of the context-aware workflow model and reuses it by invoking the unit document in the service scenario development process. It can also be applied to new service scenarios by changing the attribute values of reusable elements. Experiments show example that the development process of the service scenario is simplified by reusing the elements of the context-aware workflow model.