检索结果-内蒙古大学图书馆

Algorithmic node classification in AND/OR mobile workflow graph

INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING 2020年第2期11卷 143-168页

作者： Ali, Ihtisham Bagchi, Susmit Gyeongsang Natl Univ Dept Aerosp & Software Engn Informat Jinju South Korea

The data-intensive applications employ complex workflow graph models in dynamic networks having heterogeneity and mobility of nodes, which result in enhanced end-to-end delay in executions. The current workflow models lack structural stability for visualising a complex workflow graph. This paper proposes a hybrid AND/OR mobile workflow graph (MWG) model to visualise a fully conditioned complex workflow graph containing mobile nodes. This paper proposes nodes validity detection (NVD) algorithm for classifying the total number of nodes in the AND/OR MWG. Furthermore, nodes criticality detection (NCD) algorithm is also proposed to identify the set of critical nodes in the AND/OR MWG aiming to enable efficient analysing, mapping and scheduling of complex workflow graphs in a dynamic network environment. The algorithms are implemented and evaluated on Java platform and, the regression analysis is performed to project the algorithmic performances. A detailed comparative analysis with other works is presented in this paper.

关键词： workflow graph dynamic networks mobile node nodes classification critical node

来源：评论

学校读者我要写书评

暂无评论

A novel strategy for deterministic workflow scheduling with load balancing using modified min-min heuristic in cloud computing environment

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2024年第5期27卷 6985-7006页

作者： Choudhary, Anjali Rajak, Ranjit Dr Harisingh Gour Cent Univ Dept Comp Sci & Applicat Sagar India

Cloud Computing Environment (CCE) has gained considerable attention in recent years because of scalability, flexibility, and cost-effectiveness. workflow scheduling, a critical aspect of CCE, involves assigning tasks of a workflow to suitable resources to optimize various performance metrics. Load balancing plays an important role in achieving efficient resource utilization and reducing execution time in workflow scheduling. There are many scheduling algorithms are developed and Min-Min is out of them that uses independent tasks. However, the original Min-Min heuristic does not consider the load distribution among resources, which can lead to imbalanced resource utilization and increased execution *** address this limitation, we introduce a modified Min-Min heuristic that incorporates load-balancing principles. Taking into consideration both task completion time and resource load, the method aims to achieve optimal load distribution and minimize the overall execution time of the *** evaluate the effectiveness of the proposed load-balancing method, extensive simulations are performed using benchmark workflow datasets such as randomly generated workflows and Montage workflows. The results show that the modified Min-Min heuristic outperforms as compared to heuristics HEFT and PETS in terms of load balancing, makespan, speedup, efficiency,and resource utilization. The proposed method achieves more balanced resource allocation, reduces the completion time of the workflow, and improves overall system performance. The present study contributes to the area of workflow scheduling in CCE by presenting a load-balancing method that enhances the efficiency of resource allocation. The findings emphasize the importance of considering load-balancing principles in task scheduling to optimize performance in cloud computing environments. The proposed method can serve as a valuable tool for practitioners and researchers involved in workflow scheduling in CCE, offering impro

关键词： workflow graph DAG Makespan Load balancing Virtual machine Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Designing hybrid graph model and algorithmic analysis of workflow decomposition in mobile distributed systems

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 86卷 145-161页

作者： Ali, Ihtisham Bagchi, Susmit Gyeongsang Natl Univ Dept Aerosp & Software Engn Informat Jinju 660701 South Korea

The execution of data intensive workflow is challenging in the domain of mobile distributed systems due to the involvement of heterogeneous computing devices and dynamic network topology. Moreover, data intensive workflow execution requires frequent access to database servers for dataflow and control flow operations resulting in massive data transfer. The workflow decomposition and distribution are required to minimize data transfer and to reduce execution delay in mobile distributed systems. This paper proposes a hybrid graph model of workflow in mobile distributed systems relying on dynamic network topology and distributed database in order to facilitate workflow decomposition. The algebraic and numerical analysis of the hybrid graph model is represented providing inherent properties. Furthermore, we have presented an extensive analytical study of existing workflow decomposition approaches and have provided detailed analysis to determine the suitability of these approaches in mobile distributed systems. We have also proposed a novel framework and implementation directions for workflow decomposition based on multiple parameters for mobile distributed systems. (C) 2018 Elsevier B.V. All rights reserved.

关键词： workflow decomposition Distributed database workflow graph Algorithmic analysis Mobile distributed systems Adjacency matrices

来源：评论

学校读者我要写书评

暂无评论

An alternative method for refined process structure trees (RPST)

引用

BUSINESS PROCESS MANAGEMENT JOURNAL 2020年第2期26卷 613-629页

作者： Choi, Yongsun Ha, N. Long Kongsuwan, Pauline Han, Kwan Hee Inje Univ Dept Ind & Management Engn Gimhae South Korea Inje Univ Dept Informat & Commun Syst Gimhae South Korea Rajamangala Univ Technol Thanyaburi Fac Engn Pathum Thani Thailand Gyeongsang Natl Univ Dept Ind & Syst Engn Jinju South Korea

Purpose The refined process structure tree (RPST), the hierarchy of non-overlapping single-entry single-exit (SESE) regions of a process model, has been utilized for better comprehension and more efficient analysis of business process models. Existing RPST methods, based on the triconnected components of edges, fail to identify a certain type of SESE region. The purpose of this paper is to introduce an alternative method for generating a complete RPST utilizing rather simple techniques. Design/methodology/approach The proposed method first focuses on the SESE regions of bonds and rigids, from the innermost ones to the outermost ones, utilizing dominance and post-dominance relations. Then, any SESE region of a series nested in a bond or a rigid is identified with a depth-first search variation. Two-phase algorithms and their completeness proofs, a software tool incorporating visualization of stepwise outcomes, and the experimental results of the proposed method are provided. Findings The proposed method utilizes simple techniques that allow their straightforward implementation. Visualization of stepwise outcomes helps process analysts to understand the proposed method and the SESE regions. Experiments with 604 SAP reference models demonstrated the limitation of the existing RPST methods. The proposed method, however, completely identified all types of SESE regions, defined with nodes, in less computation time than with the old methods. Originality/value Each triconnected component of the undirected version of a process model is associated with a pair of boundary nodes without discriminating between the entry and the exit. Here, each non-atomic SESE region is associated with two distinct entry and exit nodes from the original model in the form of a directed graph. By specifying the properties of SESE regions in more comprehensible ways, this paper facilitates a deeper understanding of SESE regions rather than relying on the resulting RPST.

关键词： Process model Dominance Post-dominance Single-entry single-exit region workflow graph

来源：评论

学校读者我要写书评

暂无评论

Static analysis and process model transformation for an advanced business process to Petri net mapping

引用

SOFTWARE-PRACTICE & EXPERIENCE 2018年第1期48卷 161-195页

作者： Heinze, Thomas S. Amme, Wolfram Moser, Simon Friedrich Schiller Univ Jena Inst Comp Sci Ernst Abbe Pl 2 D-07743 Jena Germany IBM Res & Dev Boblingen Schonaicher Str 220 D-71032 Boblingen Germany

Verification of business processes typically relies on Petri net-based process models. While they allow for natural modeling and analysis of aspects such as parallelism and message exchange, such a process model is seldom complete and precise. This is mainly because the available techniques for deriving a Petri net model from the original model neglect process data in favor of feasible verification. In this paper, we present an approach for deriving more precise process models by leveraging a process-to-Petri-net compiler, which takes as input a business process and generates as output a Petri net model for the process. This can be subsequently used for verification. However, in contrast to a conventional compiler, our compiler's objective is not to create the most efficient code but rather to produce a most precise but still effectively verifiable Petri net-based process model.

关键词： business process model transformation Petri net static analysis workflow graph

来源：评论

学校读者我要写书评

暂无评论

Service-Oriented workflow Executability from a Security Perspective 9th

Service-Oriented Workflow Executability from a Security Pers...

引用

9th International Conference on Security, Privacy, and Anonymity in Computation, Communication and Storage (SpaCCS)

作者： Hussain, Sardar Sinnott, Richard O. Poet, Ron Univ Glasgow Sch Comp Sci Glasgow G12 8QQ Lanark Scotland Univ Melbourne Dept Comp & Informat Syst Melbourne Vic 3010 Australia

ISBN: (纸本)9783319491486;9783319491479

Scientific workflows are composed of different services to support scientific experiments. Often such services are provided by different organizations that can have their own autonomous access control policies. workflows are often shared and repurposed with the same and/or different datasets to repeat scientific experiments, therefore, different users can require different privileges to access different services to execute (enact) a given workflow. It can be the case that a given user may not have sufficient privileges to access some of the services of the workflow. As such, it needs to be ascertained whether a user (or enactment engine acting on behalf of a user) with a given set of security credentials should be allowed to enact a workflow and whether this will lead to runtime failure of the workflow. Ideally it should be determined a priori whether a path exists from the root node of the workflow graph to the leaf node, i.e. that it is possible for the workflow to be fully executable or partially executable on the basis of the available credentials of the user. This paper presents an algorithm and its realization that exploits existing workflow patterns to determine the structural path of the workflow whilst checking the availability of credentials at different service points in the workflow path.

关键词： workflow security Scientific workflows workflow executability workflow graph workflow path

来源：评论

学校读者我要写书评

暂无评论

Instrumentation and Trace Analysis for Ad-hoc Python workflows in Cloud Environments 8

Instrumentation and Trace Analysis for Ad-hoc Python Workflo...

引用

IEEE 8th International Conference on Cloud Computing

作者： Acuna, Ruben Lacroix, Zoe Bazzi, Rida A. Arizona State Univ Sch Comp Informat & Decis Syst Engn Tempe AZ 85287 USA Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA

ISBN: (纸本)9781467372879

Knowledge of structure is critical to map legacy workflows to environments suitable to run on the cloud. We present a method which characterizes a workflow structure with the execution trace produced by instrumented logging functionality. The method generates the structure of workflows to support their reuse by permitting their transformation into modern execution environments. The method presented in the paper is implemented for Python workflows and demonstrated in the context of several legacy scientific workflows.

关键词： Cloud Instrumentation Python Scientific application Trace analysis workflow workflow graph workflow structure

来源：评论

学校读者我要写书评

暂无评论

Compiling More Precise Petri Net Models for an Improved Verification of Service Implementations 7

Compiling More Precise Petri Net Models for an Improved Veri...

引用

IEEE 7th International Conference on Service-Oriented Computing and Applications (SOCA)

作者： Heinze, Thomas S. Amme, Wolfram Moser, Simon Univ Jena D-07743 Jena Germany IBM Res & Dev Boeblingen D-71032 Boblingen Germany

ISBN: (纸本)9781479968336

Verification of distributed business processes typically relies on Petri-net-based process models, which allow for a natural modeling and analysis of aspects like parallelism and message exchange. Unfortunately, such a process model is seldom complete and precise today, mainly because the available techniques for its derivation neglect process data in favor of a feasible verification. In this paper, we present an approach for deriving more precise process models in terms of a transforming process-to-Petri-net compiler, which takes as input a business process and generates as output a Petri net model for the process which can subsequently be used for verification. However, in contrast to a conventional compiler, its objective is not to result in efficient runtime code but rather to produce a most-precise though still effectively verifiable Petri-net-based process model.

关键词： Petri nets business data processing formal verification parallel processing program compilers distributed business process message exchange natural analysis natural modeling parallelism process data process-to-Petri-net compiler service implementation verification verifiable Petri-net-based process model Analytical models Business Data models Games Process control Rocks Runtime Petri net control flow unfolding verification workflow graph Petri nets compilers information exchange business data processing Runtime parallelism Verification data models Formal verification Business ANALYSIS MODELS PARALLEL PROCESSING (COMPUTERS) Process control rocks procedural model

来源：评论

学校读者我要写书评

暂无评论

Execution Time Estimation for workflow Scheduling 9

Execution Time Estimation for Workflow Scheduling

引用

9th Workshop on workflows in Support of Large-Scale Science (WORKS)

作者： Chirkin, Artem M. Belloum, A. S. Z. Kovalchuk, Sergey V. Makkes, Marc X. ITMO Univ Birzhevaya Line 4 St Petersburg 199034 Russia Univ Amsterdam Amsterdam Netherlands Univ Amsterdam POB 94323 NL-1090 GH Amsterdam Netherlands TNO Informat & Commun Technol Amsterdam Netherlands

ISBN: (纸本)9781479970674

Estimation of the execution time is an important part of the workflow scheduling problem. The aim of this paper is to highlight common problems in estimating the workflow execution time and propose a solution that takes into account the complexity and the randomness of the workflow components and their runtime. The solution proposed in this paper addresses the problems at different levels from task to workflow, including the error measurement and the theory behind the estimation algorithm. The proposed estimation algorithm can be integrated easily into a wide class of schedulers as a separate module. We use a dual stochastic representation, characteristic / distribution functions, in order to combine tasks' estimates into the overall workflow makespan. Additionally, we propose the workflow reductions - the operations on a workflow graph that do not decrease the accuracy of the estimates, but simplify the graph structure, hence increasing the performance of the algorithm.

关键词： directed graphs scheduling workflow management software characteristic-distribution functions directed acyclic graph dual stochastic representation execution time estimation workflow component complexity workflow component randomness workflow graph workflow makespan workflow reductions workflow scheduling problem Chebyshev approximation Data models Estimation Random variables Runtime Scheduling Stochastic processes workflow management software workflow Runtime Chebyshev approximation data models Directed Acyclic graph directed graphs execution time Random variable Markov chain Error measure

来源：评论

学校读者我要写书评

暂无评论

A modelling approach to Service oriented Architecture for on-line diagnosis

引用

SERVICE ORIENTED COMPUTING AND APPLICATIONS 2012年第4期6卷 303-319页

作者： Alodib, Mohammed Bordbar, Behzad Qassim Univ POB 385 Al Qassim 51411 Saudi Arabia Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England

Failure diagnosis is one of the key challenges of Service oriented Architectures. One of the methods of identifying occurrences of failure is to use Diagnosers;software modules or services are deployed with the system to monitor the interaction between services for identifying whether a failure has happened or may have happened. This paper aims to present a suitable modelling framework to allow automated creation of Diagnosers based on Discrete Event System (DES) theory. Coming up with an appropriate modelling language framework is a prerequisite to applying DES techniques. Modelling languages popular in DES, such as Petri nets and automata, despite being sufficiently adequate for modelling, are not well adopted by the SoA community. Inspired by Petri nets and workflow graph, the modelling suggested in this paper closely follows BPEL that is widely used by the community. In particular, our language includes constructs that are supported by major tool vendors. To demonstrate that the suggested formal language is a suitable basis for the application of DES theory, we have extended one of the existing DES methods for the creation of centralised Diagnoser. Two algorithms for creating Diagnosers are put forward. These algorithms are applied into the models that are abstracted from the BPEL representation of the involving services. As a proof of concept, an implementation of the suggested approach is created as an Oracle JDeveloper plugin that automatically produces new Diagnosing services and integrates them to work with existing services. The paper ends with a series of empirical results on the performancerelated aspects of the proposed method.

关键词： Service oriented Architecture Failure Diagnosis workflow graph BPEL

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：