2,208 research outputs found

    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

    Real-time Monitoring of Low Voltage Grids using Adaptive Smart Meter Data Collection

    Get PDF

    Performance Evaluation of Scheduling Algorithms for Real Time Cloud Computing Systems

    Get PDF
    Cloud computing shares data and oers services transparently among its users. With the increase in number of users of cloud the tasks to be scheduled increases. The performance of cloud depends on the task scheduling algorithms used in the scheduling components or brokering components. Scheduling of tasks on cloud computing systems is one of the research problem, Where the matching of machines and completion time of the tasks are considered. Tasks matching of machines problem is that, assume number of active hosts are Y, number of VMs in each host are Z. Maximum number of possible Virtual Machines(VMs) to schedule a single task is (y*z). If we need to schedule X tasks, number of possibilities are (y *z)^x. So scheduling of tasks is NP Hard problem. NP Hard means this scheduling of tasks on VMs not having polynomial time complexity, but it may have algorithm for verifying solution. Fault-tolerance becomes an important key to establish dependability in cloud computing system. In task scheduling, if task not completed in it's deadline ,then it is one type of fault in scheduling of tasks. In this thesis this type of faults are taken and try to overcome it. In this thesis we present a non-preemptive scheduling algorithm, By inserting the ideal time for postponing the task by ensuring the other task will completes its execution with in the deadline. In simulation the proposed algorithm maximizes the prot of 25%, throughput of 25% and minimizes the penalty of 20% over EDF

    Performance Evaluation of Scheduling Algorithms for Real Time Cloud Computing Systems

    Get PDF
    Cloud computing shares data and oers services transparently among its users. With the increase in number of users of cloud the tasks to be scheduled increases. The performance of cloud depends on the task scheduling algorithms used in the scheduling components or brokering components. Scheduling of tasks on cloud computing systems is one of the research problem, Where the matching of machines and completion time of the tasks are considered. Tasks matching of machines problem is that, assume number of active hosts are Y, number of VMs in each host are Z. Maximum number of possible Virtual Machines(VMs) to schedule a single task is (y*z). If we need to schedule X tasks, number of possibilities are (y *z)^x. So scheduling of tasks is NP Hard problem. NP Hard means this scheduling of tasks on VMs not having polynomial time complexity, but it may have algorithm for verifying solution. Fault-tolerance becomes an important key to establish dependability in cloud computing system. In task scheduling, if task not completed in it's deadline ,then it is one type of fault in scheduling of tasks. In this thesis this type of faults are taken and try to overcome it. In this thesis we present a non-preemptive scheduling algorithm, By inserting the ideal time for postponing the task by ensuring the other task will completes its execution with in the deadline. In simulation the proposed algorithm maximizes the prot of 25%, throughput of 25% and minimizes the penalty of 20% over EDF

    Defining and applying prediction performance metrics on a recurrent NARX time series model.

    No full text
    International audienceNonlinear autoregressive moving average with exogenous inputs (NARMAX) models have been successfully demonstrated for modeling the input-output behavior of many complex systems. This paper deals with the proposition of a scheme to provide time series prediction. The approach is based on a recurrent NARX model obtained by linear combination of a recurrent neural network (RNN) output and the real data output. Some prediction metrics are also proposed to assess the quality of predictions. This metrics enable to compare different prediction schemes and provide an objective way to measure how changes in training or prediction model (Neural network architecture) affect the quality of predictions. Results show that the proposed NARX approach consistently outperforms the prediction obtained by the RNN neural network

    Creating an Agent Based Framework to Maximize Information Utility

    Get PDF
    With increased reliance on communications to conduct military operations, information centric network management becomes vital. A Defense department study of information management for net-centric operations lists the need for tools for information triage (based on relevance, priority, and quality) to counter information overload, semi-automated mechanisms for assessment of quality and relevance of information, and advances to enhance cognition and information understanding in the context of missions [30]. Maximizing information utility to match mission objectives is a complex problem that requires a comprehensive solution in information classification, in scheduling, in resource allocation, and in QoS support. Of these research areas, the resource allocation mechanism provides a framework to build the entire solution. Through an agent based mindset, the lessons of robot control architecture are applied to the network domain. The task of managing information flows is achieved with a hybrid reactive architecture. By demonstration, the reactive agent responds to the observed state of the network through the Unified Behavior Framework (UBF). As information flows relay through the network, agents in the network nodes limit resource contention to improve average utility and create a network with smarter bandwidth utilization. While this is an important result for information maximization, the agent based framework may have broader applications for managing communication networks

    Smart manufacturing scheduling: A literature review

    Full text link
    [EN] Within the scheduling framework, the potential of digital twin (DT) technology, based on virtualisation and intelligent algorithms to simulate and optimise manufacturing, enables an interaction with processes and modifies their course of action in time synchrony in the event of disruptive events. This is a valuable capability for automating scheduling and confers it autonomy. Automatic and autonomous scheduling management can be encouraged by promoting the elimination of disruptions due to the appearance of defects, regardless of their origin. Hence the zero-defect manufacturing (ZDM) management model oriented towards zero-disturbance and zero-disruption objectives has barely been studied. Both strategies combine the optimisation of production processes by implementing DTs and promoting ZDM objectives to facilitate the modelling of automatic and autonomous scheduling systems. In this context, this particular vision of the scheduling process is called smart manufacturing scheduling (SMS). The aim of this paper is to review the existing scientific literature on the scheduling problem that considers the DT technology approach and the ZDM model to achieve self-management and reduce or eliminate the need for human intervention. Specifically, 68 research articles were identified and analysed. The main results of this paper are to: (i) find methodological trends to approach SMS models, where three trends were identified; i.e. using DT technology and the ZDM model, utilising other enabling digital technologies and incorporating inherent SMS capabilities into scheduling; (ii) present the main SMS alignment axes of each methodological trend; (iii) provide a map to classify the literature that comes the closest to the SMS concept; (iv) discuss the main findings and research gaps identified by this study. Finally, managerial implications and opportunities for further research are identified.This work was supported by the Spanish Ministry of Science, Innovation and Universities project entitled 'Optimisation of zero-defects production technologies enabling supply chains 4.0 (CADS4.0) ' (RTI2018-101344-B-I00) , the European Union H2020 research and innovation programme with grant agreement No. 825631 "Zero Defect Manufacturing Platform (ZDMP) " and the European Union H2020 research and innovation programme with agreement No. 958205 "In-dustrial Data Services for Quality Control in Smart Manufacturing (i4Q) ".Serrano-Ruiz, JC.; Mula, J.; Poler, R. (2021). Smart manufacturing scheduling: A literature review. Journal of Manufacturing Systems. 61:265-287. https://doi.org/10.1016/j.jmsy.2021.09.0112652876

    A holonic multi-agent methodology to design sustainable intelligent manufacturing control systems

    Full text link
    [EN] The urgent need for sustainable development is imposing radical changes in the way manufacturing systems are designed and implemented. The overall sustainability in industrial activities of manufacturing companies must be achieved at the same time that they face unprecedented levels of global competition. Therefore, there is a well-known need for tools and methods that can support the design and implementation of these systems in an effective way. This paper proposes an engineering method that helps researchers to design sustainable intelligent manufacturing systems. The approach is focused on the identification of the manufacturing components and the design and integration of sustainability-oriented mechanisms in the system specification, providing specific development guidelines and tools with built-in support for sustainable features. Besides, a set of case studies is presented in order to assess the proposed method.This research was supported by research projects TIN2015-65515-C4-1-R and TIN2016-80856-R from the Spanish government. The authors would like to acknowledge T. Bonte for her contribution to the NetLogo simulator of the AIP PRIMECA cell.Giret Boggino, AS.; Trentesaux, D.; Salido Gregorio, MÁ.; Garcia, E.; Adam, E. (2017). A holonic multi-agent methodology to design sustainable intelligent manufacturing control systems. Journal of Cleaner Production. 167(1):1370-1386. https://doi.org/10.1016/j.jclepro.2017.03.079S13701386167
    corecore