18 research outputs found

    Dual-phase just-in-time workflow scheduling in P2P grid systems

    Get PDF
    This paper presents a fully decentralized justin-time workflow scheduling method in a P2P Grid system. The proposed solution allows each peer node to autonomously dispatch inter-dependent tasks of workflows to run on geographically distributed computers. To reduce the workflow completion time and enhance the overall execution efficiency, not only does each node perform as a scheduler to distribute its tasks to execution nodes (or resource nodes), but the resource nodes will also set the execution priorities for the received tasks. By taking into account the unpredictability of tasks' finish time, we devise an efficient task scheduling heuristic, namely dynamic shortest makespan first (DSMF), which could be applied at both scheduling phases for determining the priority of the workflow tasks. We compare the performance of the proposed algorithm against seven other heuristics by simulation. Our algorithm achieves 20%~60% reduction on the average completion time and 37.5%~90% improvement on the average workflow execution efficiency over other decentralized algorithms. © 2010 IEEE.published_or_final_versionProcessing (ICPP 2010), San Diego, CA., 13-16 September 2010. In Proceedings of the 39th ICCP, 2010, p. 238-24

    Decentralized workflow management on software defined infrastructures

    Get PDF

    Elastic Business Process Management: State of the Art and Open Challenges for BPM in the Cloud

    Full text link
    With the advent of cloud computing, organizations are nowadays able to react rapidly to changing demands for computational resources. Not only individual applications can be hosted on virtual cloud infrastructures, but also complete business processes. This allows the realization of so-called elastic processes, i.e., processes which are carried out using elastic cloud resources. Despite the manifold benefits of elastic processes, there is still a lack of solutions supporting them. In this paper, we identify the state of the art of elastic Business Process Management with a focus on infrastructural challenges. We conceptualize an architecture for an elastic Business Process Management System and discuss existing work on scheduling, resource allocation, monitoring, decentralized coordination, and state management for elastic processes. Furthermore, we present two representative elastic Business Process Management Systems which are intended to counter these challenges. Based on our findings, we identify open issues and outline possible research directions for the realization of elastic processes and elastic Business Process Management.Comment: Please cite as: S. Schulte, C. Janiesch, S. Venugopal, I. Weber, and P. Hoenisch (2015). Elastic Business Process Management: State of the Art and Open Challenges for BPM in the Cloud. Future Generation Computer Systems, Volume NN, Number N, NN-NN., http://dx.doi.org/10.1016/j.future.2014.09.00

    A Framework for distributed Workflows, Peer-to-Peer and PLM/PDM collaborations to support OEMs and SMEs

    Get PDF
    The recent development of communication technology and hardware devices has made it possible for messages to reach anybody, anywhere at anytime. One such technology is Peer-to-Peer (P2P) networking. The use of this technology however, is limited to mobile phones and swapping music in the internet for home users. To deploy this development into industry, there is a requirement to improve to sharing information in a collaborative and distributed product developing environment. The aim of this paper is therefore to discuss the development of a framework to enhance the integrity of data sharing and efficiency of network communication for the collaboration of Small and Medium Enterprises (SMEs) and Original Equipment Manufacturers (OEMs). The main technologies used in the framework are the P2P decentralized network together with workflow technology and Product Life Management System (PLM). In addition, the paper is also highlighted the security issues arise to implement the P2P applications within the framework

    A Distributed Task Management Solution for Peer-To-Peer and Cloud Environments

    Get PDF
    In this thesis we introduced the Lightweight Coordination Calculus based logic programming approach to the programming models of the Platform-as-a-Service cloud. By using this approach, PaaS based cloud systems will enable cloud application developers to have more options to implement various kinds of programming models for their distributed tasks. We built a prototype framework based on OpenKnowledge middleware because the OpenKnowledge currently is the only framework that fully supports the LCC based programming model. By adding task control and administrative features such as automated task initiation, task status querying, task termination and input/output message channel, we extended the original usage of the OpenKnowledge framework and made it capable of being used to construct PaaS cloud systems. The automation level of the transformed OpenKnowledge framework is improved and its original advantages are retained simultaneously. All of our work reveals the underlying mechanism of the next generation Platform-as-a-Service cloud system which supports logic programming

    Data Sets Replicas Placements Strategy from Cost-Effective View in the Cloud

    Get PDF

    Managing Workflows on top of a Cloud Computing Orchestrator for using heterogeneous environments on e-Science

    Full text link
    [EN] Scientific workflows (SWFs) are widely used to model processes in e-Science. SWFs are executed by means of workflow management systems (WMSs), which orchestrate the workload on top of computing infrastructures. The advent of cloud computing infrastructures has opened the door of using on-demand infrastructures to complement or even replace local infrastructures. However, new issues have arisen, such as the integration of hybrid resources or the compromise between infrastructure reutilisation and elasticity. In this article, we present an ad hoc solution for managing workflows exploiting the capabilities of cloud orchestrators to deploy resources on demand according to the workload and to combine heterogeneous cloud providers (such as on-premise clouds and public clouds) and traditional infrastructures (clusters) to minimise costs and response time. The work does not propose yet another WMS but demonstrates the benefits of the integration of cloud orchestration when running complex workflows. The article shows several configuration experiments from a realistic comparative genomics workflow called Orthosearch, to migrate memory-intensive workload to public infrastructures while keeping other blocks of the experiment running locally. The article computes running time and cost suggesting best practices.This paper wants to acknowledge the support of the EUBrazilCC project, funded by the European Commission (STREP 614048) and the Brazilian MCT/CNPq N. 13/2012, for the use of its infrastructure. The authors would like also to thank the Spanish 'Ministerio de Economia y Competitividad' for the project 'Clusters Virtuales Elasticos y Migrables sobre Infraestructuras Cloud Hibridas' with reference TIN2013-44390-R.Carrión Collado, AA.; Caballer Fernández, M.; Blanquer Espert, I.; Kotowski, N.; Jardim, R.; Dávila, AMR. (2017). Managing Workflows on top of a Cloud Computing Orchestrator for using heterogeneous environments on e-Science. International Journal of Web and Grid Services. 13(4):375-402. doi:10.1504/IJWGS.2017.10003225S37540213

    A Language for the Specification of Administrative Workflow Processes with Emphasis on Actors’ Views

    Get PDF
    International audienceAdministrative workflows refer to variable business processes in which all cases are known; tasks are predictable and their sequencing rules are simple and clearly defined. When such processes are collaboratively executed by several actors, it may be desirable, for security reasons (confidentiality), that each of them has at all times, only a partial perception (this is what we call "actor's view") of the current process state. This concern seems sufficiently important to be considered when specifying such workflows. However, traditional workflow specification languages (BPMN, BPEL, YAWL) only partially address it. This is why we present in this paper, a new language for specifying administrative workflows that allows us not only to simply model all of the processes tasks and their sequence, but also and especially to explicitly express the rights of the various actors with respect to each of them, in order to guarantee a certain degree of security. The proposed model is an executable grammatical specification that allows to express using decorated productions, the different types of basic flows (sequential, parallel, alternative and iterative) that are found in workflow specification languages; moreover, it also allows to specify the rights of each actor in each process and on its data in a formalism similar to that used in UNIX-like operating systems

    On Dead Path Elimination in Decentralized Process Executions

    Get PDF
    There has been a great deal of interest in recent years in the use of service oriented approach and relevant standards to implement business processes. Following the concepts of workflow-based process management, the major focus has been on service composition. Not surprisingly, this default composition approach suffers from the limitations of centralized workflow management. It is well recognized that a decentralized execution setting where composed services can establish P2P interactions, is central to a wide range of ubiquitous, mobile, large-scale and secure business process management. A natural way to enable the decentralized execution is to implement the relevant distributed cooperating processes of a centralized process on composed services. In this way, composed services can establish P2P interactions following the semantics of their processes. In this report, we present a generic approach that enables decentralized executions with such cooperating processes. Precisely, we present our method that derives the latter. We focus on the sophisticated control/data flow, conversationional aspects and especially Dead Path Elimination that run counter to naive intuition, most of which, we explain using deeper analysis of the algorithms and data structures that we employed
    corecore