• 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.

• 한국디지털정책학회:학술대회논문집
• /
• 2004.11a
• /
• pp.299-310
• /
• 2004

Business process in e-government mostly embody as the flow of documents. Constructing a web-based document flow system becomes an critical task for today s digital government. But few of them use an off-the-shelf workflow product. Why? One of the reasons is that most of the workflow system are heavyweight, monolithic, and package a comprehensive set of features in an all-or-nothing manner. Another reason is that workflow technology lacks the constructs and modeling capability as programming language. It is incumbent on government IT organizations to transform their solution development to component-based computing model. Component technology isolates the computation and communication parts, but how to compose different software components is still a hard nut. An integrated development environment is necessary for CBSD. In this paper we propose a XML and component-based document flow-oriented integrated development environment (DFoIDE) for software developers. By writing some xml configure file, and operate on DFoIDE, developer can construct a workflow application quickly. This method divides system to several components and the activities in process are implemented as business component. Different components are discribed detailedly in this paper, especially one of the core component. Component Integrating Tool. Different perspectives in workflow application are seperated and depicted as different XML files. Correspondly, A component composition method for developing workflow application instead of workflow itself is proposed.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3611-3634
• /
• 2015

In this paper, we build a theoretical framework for quantitatively measuring and graphically representing the degrees of closeness centralization among performers assigned to enact a workflow procedure. The degree of closeness centralization of a workflow-performer reflects how near the performer is to the other performers in enacting a corresponding workflow model designed for workflow-supported organizational operations. The proposed framework comprises three procedural phases and four functional transformations, such as discovery, analysis, and quantitation phases, which carry out ICN-to-WsoN, WsoN-to-SocioMatrix, SocioMatrix-to-DistanceMatrix, and DistanceMatrix-to-CCV transformations. We develop a series of algorithmic formalisms for the procedural phases and their transformative functionalities, and verify the proposed framework through an operational example. Finally, we expatiate on the functional expansion of the closeness centralization formulas so as for the theoretical framework to handle a group of workflow procedures (or a workflow package) with organization-wide workflow-performers.

• International Journal of Contents
• /
• v.16 no.4
• /
• pp.16-25
• /
• 2020

The size of observation data in astronomy has been increasing exponentially with the advents of wide-field optical telescopes. This means the needs of changes to the way used for large-scale astronomy data analysis. The complexity of analysis tools and the lack of extensibility of computing environments, however, lead to the difficulty and inefficiency of dealing with the huge observation data. To address this problem, this paper proposes a workflow execution system for analyzing large-scale astronomy data efficiently. The proposed system is composed of two parts: 1) a workflow execution manager and its RESTful endpoints that can automate and control data analysis tasks based on workflow templates and 2) an elastic resource manager as an underlying mechanism that can dynamically add/remove virtualized computing resources (i.e., virtual machines) according to the analysis requests. To realize our workflow execution system, we implement it on a testbed using OpenStack IaaS (Infrastructure as a Service) toolkit and HTCondor workload manager. We also exhaustively perform a broad range of experiments with different resource allocation patterns, system loads, etc. to show the effectiveness of the proposed system. The results show that the resource allocation mechanism works properly according to the number of queued and running tasks, resulting in improving resource utilization, and the workflow execution manager can handle more than 1,000 concurrent requests within a second with reasonable average response times. We finally describe a case study of data reduction system as an example application of our workflow execution system.

• The Journal of Information Technology and Database
• /
• v.5 no.1
• /
• pp.97-108
• /
• 1998

This paper proposes a conceptual taxonomy of architectures for workflow management systems. The systematic classification work is based on a framework for workflow architectures. The framework, consisting of generic-level, conceptual-level and implementation-level architectures, provides common architectural principles for designing a workflow management system. We define the taxonomy by considering the possibilities for centralization or distribution of data, control, and execution. That is, we take into account three criteria. How are the major components of a workflow model and system, like activities, roles, actors, and workcases, concretized in workflow architecture. Which of the components is represented as software modules of the workflow architecture\ulcorner And how are they configured and operating in the architecture\ulcorner The workflow components might be embodied, as active (processes or threads) modules or as passive (data) modules, in the software architecture of a workflow management system. One or combinations of the components might become software modules in the software architecture. Finally, they might be centralized or distributed. The distribution of the components should be broken into three: Vertically, Horizontally and Fully distributed. Through the combination of these aspects, we can conceptually generate about 64 software Architectures for a workflow management system. That is, it should be possible to comprehend and characterize all kinds of software architectures for workflow management systems including the current existing systems as well as future systems. We believe that this taxonomy is a significant contribution because it adds clarity, completeness, and global perspective to workflow architectural discussions. The vocabulary suggested here includes workflow levels and aspects, allowing very different architectures to be discussed, compared, and contrasted. Added clarity is obtained because similar architectures from different vendors that used different terminology and techniques can now be seen to be identical at the higher level. Much of the complexity can be removed by thinking of workflow systems. Therefore, it is used to categorize existing workflow architectures and suggest a plethora of new workflow architectures. Finally, the taxonomy can be used for sorting out gems and stones amongst the architectures possibly generated. Thus, it might be a guideline not only for characterizing the existing workflow management systems, but also for solving the long-term and short-term architectural research issues, such as dynamic changes in workflow, transactional workflow, dynamically evolving workflow, large-scale workflow, etc., that have been proposed in the literature.

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

This paper theoretically derives an algorithm to discover a new type of social networks from workflow models, which is termed workflow-based social network intelligence. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict from workflow models and their execution histories. So, this paper proposes an algorithm, which is termed ICN-based workflow-based social network intelligence discovery algorithm, to be classified into the type of discovery techniques, which are able to discover workflow-based social network intelligence that are formed among workflow performers through a series of workflow models and their executions, 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 generate its corresponding workflow-based social network intelligence.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.976-995
• /
• 2016

Workflow scheduling is one of the challenging problems in cloud computing, especially when service reliability is considered. To improve cloud service reliability, fault tolerance techniques such as fault recovery can be employed. Practically, fault recovery has impact on the performance of workflow scheduling. Such impact deserves detailed research. Only few research works on workflow scheduling consider fault recovery and its impact. In this paper, we investigate the problem of workflow scheduling in clouds, considering the probability that cloud resources may fail during execution. We formulate this problem as a multi-objective optimization model. The first optimization objective is to minimize the overall completion time and the second one is to minimize the overall execution cost. Based on the proposed optimization model, we develop a heuristic-based algorithm called Min-min based time and cost tradeoff (MTCT). We perform extensive simulations with four different real world scientific workflows to verify the validity of the proposed model and evaluate the performance of our algorithm. The results show that, as expected, fault recovery has significant impact on the two performance criteria, and the proposed MTCT algorithm is useful for real life workflow scheduling when both of the two optimization objectives are considered.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.909-915
• /
• 2002

Collaborative system is an essential idea in the global and e-business environments Workflow plays a key role implementing collaborative system. Workflow is an emerging technology for business process automation, monitoring integrity enforcement, and recovery. A process model describes the structure of business process in the real world The process model can be transformed into a Workflow model utilizing a computer. The paper proposes a web-based Workflow process design in the B2B environment Considering a global environment where the partners interchange their processes beyond the company boundaries, a web-based infrastructure is the most preferred platform Considering this, Workflow processes and e-Business structures were combined together on the web environment.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1288-1297
• /
• 1999

오늘날 많은 워크플로우 응용들은 마감 시간과 같은 시간 제약 조건들의 효율적인 관리를 요구하고 있다. 이러한 시간 제약성 워크플로우의 가장 중요한 목적들 중의 하나는 마감 시간을 만족하는 워크플로우 인스턴스의 수를 최대화하는 것이다. 시간 제약성 워크플로우 처리의 성능을 개선하기 위해서는 효과적인 액티비티들의 마감 시간 할당 방법이 요구된다. 이에 본 논문에서는 액티비티의 체재 시간과 워크플로우 제어 구조들의 특성을 고려하여 효과적인 마감 시간 할당 방법인 PST를 제안한다. PST는 기존의 방법들과 달리 워크플로우 제어 흐름을 분석하여 액티비티의 마감 시간을 할당하기 때문에 과부하에서도 높은 성능을 지원할 수 있다. 부가적으로 기존의 방법들과 성능 평가를 통해 본 논문에서 제안된 방법의 효용성을 검증한다.Abstract Nowadays, many workflow applications are requiring efficient time management such as deadline. With time-constrained workflows, one of the most important goals is to maximize the number of workflow instances that satisfy the deadline. In this regard, effective deadline assignment mechanisms should be developed to achieve high performance of time-constrained workflow processing. We propose in this paper our novel deadline assignment method called PST based on both an activity's sojourn time and the characteristics of workflow control structures. Because the method allocates the deadline to activities from analyzing the control flow of workflow, it can support good and stable workflow performance even under the high workload. In addition, we validate the usefulness of our proposed method through various experiments.