• 한국IT서비스학회지
• /
• 제7권4호
• /
• pp.167-178
• /
• 2008

This paper addresses the issue of workflow on Grid and P2P, and proposes a layered workflow architecture and its related workflow models that are used for not only distributing workflows' information onto Grid or P2P resources but also scheduling the enactment of workflows. Especially, the most critical rationale of this paper is on the fact that the nature of Grid computing environment is fitted very well into building a platform for the maximally parallel and very large scale workflows that are frequently found in very large scale enterprises. The layered architecture proposed in this paper, which we call Enterprise Workflow Grid Architecture, is targeting on maximizing the usability of computing facilities in the enterprise as well as the scalability of its underlined workflow management system in coping with massively parallel and very large scale workflow applications.

• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2003년도 추계학술대회
• /
• pp.55-63
• /
• 2003

Workflow Management System (WFMS) is a software system to support an efficient execution, control and management of complex business processes. Since traditional commercial systems mainly focus on automating processes, they don't have methods for enhancing the task performer's efficiency. In this paper, we propose a new method of executing business processes more efficiently in that a whole process is scheduled considering the degree of the participants' workload. The method allows managing the largest constraints among constituent resources of the process. We utilize DBR scheduling techniques to develop the method. We first consider the differences between workflow process models and DBR application models, and then develop the modified drum, buffer and rope. This leads us to develop WF-DBR (WorkFlow-DBR) that can control the proper size of the task performers' work list and arrival rate of process instances. Use of WF-DBR improves the efficiency of the whole process as well as the participants' working condition. We then carry out a set of simulation experiments and compare the effectiveness of our approach with that of scheduling techniques used in existing systems.

• ETRI Journal
• /
• 제42권3호
• /
• pp.388-398
• /
• 2020

We herein propose a heuristic redundancy selection algorithm that combines resubmission, replication, and checkpointing redundancies to reduce the resiliency overhead in fault-tolerant workflow scheduling. The appropriate combination of these redundancies for workflow tasks is obtained in two consecutive phases. First, to compute the replication vector (number of task replicas), we apportion the set of provisioned resources among concurrently executing tasks according to their needs. Subsequently, we obtain the optimal checkpointing interval for each task as a function of the number of replicas and characteristics of tasks and computational environment. We formulate the problem of obtaining the optimal checkpointing interval for replicated tasks in situations where checkpoint files can be exchanged among computational resources. The results of our simulation experiments, on both randomly generated workflow graphs and real-world applications, demonstrated that both the proposed replication vector computation algorithm and the proposed checkpointing scheme reduced the resiliency overhead.

• Asia pacific journal of information systems
• /
• 제11권3호
• /
• pp.149-164
• /
• 2001

In this paper, an adaptive workflow management system, called K-WFMS, is proposed. The K-WFMS integrates database system and knowledge-based system to automate business processes that are executed with complex and various business rules such as task scheduling, role resolution, and exception handling rules. The K-WFMS is adaptable in the sense that it allows its users to change workflow schema in the course of workflow execution as well as it provides rule-based modeling constructs to handle predictable exceptions during workflow modeling. The overall architecture and implementation of K-WFMS are explained, and the change propagation mechanism to maintain validity of workflow model is suggested.

• 정보처리학회논문지A
• /
• 제12A권4호
• /
• pp.289-296
• /
• 2005

그리드 환경에서 수행되는 작업 중 많은 작업들은 연관된 작업들이 서로 결합된 워크플로우의 형태로 수행된다. 이러한 워크플로우를 서비스로 추상화한다면 사용자는 보다 손쉽게 워크플로우로 구성된 작업을 수행할 수 있다. 본 논문에서는 워크플로우를 서비스로 매핑하기 위한 메타 서비스를 정의하였다. 이 메타 서비스를 사용하면 워크플로우를 포탈 서비스, 그리드 서비스, 웹 서비스 등으로 쉽게 변환할 수 있다. 또한 워크플로우 사용자들 간에 워크플로우를 서비스의 형태로 공유하는 것도 역시 가능해진다. 마지막으로 과거의 성능 데이터 등의 서비스를 효율적으로 수행할 수 있는 정보들을 제공하여 QoS를 향상시킬 수 있다.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2003년도 춘계학술대회 모바일 비즈니스 이노베이션
• /
• pp.47-48
• /
• 2003

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3126-3145
• /
• 2014

Cloud computing is a computing paradigm in which users can rent computing resources from service providers according to their requirements. A spot instance in cloud computing helps a user to obtain resources at a lower cost. However, a crucial weakness of spot instances is that the resources can be unreliable anytime due to the fluctuation of instance prices, resulting in increasing the failure time of users' job. In this paper, we propose a Genetic Algorithm (GA)-based workflow scheduling scheme that can find the optimal task size of each instance in a spot instance-based cloud computing environment without increasing users' budgets. Our scheme reduces total task execution time even if an out-of-bid situation occurs in an instance. The simulation results, based on a before-and-after GA comparison, reveal that our scheme achieves performance improvements in terms of reducing the task execution time on average by 7.06%. Additionally, the cost in our scheme is similar to that when GA is not applied. Therefore, our scheme can achieve better performance than the existing scheme, by optimizing the task size allocated to each available instance throughout the evolutionary process of GA.

• 산업경영시스템학회지
• /
• 제29권1호
• /
• pp.1-8
• /
• 2006

This paper proposes a real-time resource allocation algorithm for minimizing the completion time of overall workflow process. The jobs in a workflow process are interrelated through the precedence graph including Sequence, AND, OR and Loop control structure. A resource should be allocated for the processing of each job, and the required processing time of the job can be varied by the resource allocation decision. Each resource has several inherent restrictions such as the functional, geographical, positional and other operational characteristics. The algorithm suggested in this paper selects an effective resource for each job by considering the precedence constraint and the resource characteristics such as processing time and the inherent restrictions. To investigate the performance of the proposed algorithm, several numerical tests are performed for four different workflow graphs including standard, parallel and two series-parallel structures. In the tests, the solutions by the proposed algorithm are compared with random and optimal solutions which are obtained by a random selection rule and a full enumeration method respectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.354-357
• /
• 1996

Virtual Manufacturing System(VMS) is an integrated computer based model which has physical, logical schema and behavior of real manufacturing system. In this paper, an integrated scheduling system is developed to simulate and control a Virtual Factory. A workflow model is constructed to define and analyze the structure of a VMS. On-line dynamic dispatching system is developed using MultiPass algorithm and scheduling system considering dynamic CAPP is carried out. Integrated scheduling system developed in this paper reduces the discrepancies between virtual model and real manufacturing system, and control of real shop floor is possible.

• Journal of Information Processing Systems
• /
• 제8권4호
• /
• pp.555-566
• /
• 2012

The cloud environment makes it possible to analyze large data sets in a scalable computing infrastructure. In the bioinformatics field, the applications are composed of the complex workflow tasks, which require huge data storage as well as a computing-intensive parallel workload. Many approaches have been introduced in distributed solutions. However, they focus on static resource provisioning with a batch-processing scheme in a local computing farm and data storage. In the case of a large-scale workflow system, it is inevitable and valuable to outsource the entire or a part of their tasks to public clouds for reducing resource costs. The problems, however, occurred at the transfer time for huge dataset as well as there being an unbalanced completion time of different problem sizes. In this paper, we propose an adaptive resource-provisioning scheme that includes run-time data distribution and collection services for hiding the data transfer time. The proposed adaptive resource-provisioning scheme optimizes the allocation ratio of computing elements to the different datasets in order to minimize the total makespan under resource constraints. We conducted the experiments with a well-known sequence alignment algorithm and the results showed that the proposed scheme is efficient for the cloud environment.