268 research outputs found

    Semantic business process management: a vision towards using semantic web services for business process management

    Get PDF
    Business process management (BPM) is the approach to manage the execution of IT-supported business operations from a business expert's view rather than from a technical perspective. However, the degree of mechanization in BPM is still very limited, creating inertia in the necessary evolution and dynamics of business processes, and BPM does not provide a truly unified view on the process space of an organization. We trace back the problem of mechanization of BPM to an ontological one, i.e. the lack of machine-accessible semantics, and argue that the modeling constructs of semantic Web services frameworks, especially WSMO, are a natural fit to creating such a representation. As a consequence, we propose to combine SWS and BPM and create one consolidated technology, which we call semantic business process management (SBPM

    Using Intelligent Agents to Manage Business Processes

    No full text
    This paper describes work undertaken in the ADEPT (Advanced Decision Environment for Process Tasks) project towards developing an agent-based infrastructure for managing business processes. We describe how the key technology of negotiating, service providing, autonomous agents was realised and demonstrate how this was applied to the BT business process of providing a customer quote for network services

    Coordinating Large Distributed Relational Process Structures

    Get PDF
    Representing a business process as a collaboration of interacting processes has become feasible with the emergence of data-centric business process management paradigms. Usually, these interacting processes have relations and, thereby, form a complex relational process structure. The interactions of processes within this relational process structure need to be coordinated to arrive at a meaningful overall business goal. However, relational process structures may become arbitrarily large. With the use of cloud technology, they may additionally be distributed over multiple nodes, allowing for scalability. Coordination processes have been proposed to coordinate relational process structures, where processes may have one-to-many and many-to-many relations at run-time. This paper shows how multiple coordination processes can be used in a decentralized fashion to more efficiently coordinate large, distributed process structures. The main challenge of using multiple coordination processes is to effectively realize the coordination responsibility of each coordination process. Key components of the solution are the subsidiary principle and the hierarchy of the relational process structure. Finally, an implementation of the coordination process concept based on microservices was developed, which allows for fast and concurrent enactment of multiple, decentralized coordination processes in large, distributed process structures

    SysRT: A Modular Multiprocessor RTOS Simulator for Early Design Space Exploration

    Get PDF
    International audienc

    IT Management Using a Heavyweight CIM Ontology

    Get PDF
    This paper presents an approach for ontology-based IT management based on a heavyweight (formal) ontology using the Web Ontology Language (OWL). The ontology comprises a complete OWL representation of the Common Information Model (CIM) and management rules defined in the Semantic Web Rule Language (SWRL). The ontology not only models the managed system types, but a runtime system dynamically updates model instances in the ontology that reflect values of managed system entities. This allows the evalution of rules that take into account both model and model instances. A reaction module uses the CIM interface of the managed system to invoke CIM methods according to rule evaluation results, thus resulting in automated management. In order to ensure the consistency of the ontology when changes are performed, belief change theory is employed

    On The Hourglass Model, The End-to-End Principle and Deployment Scalability

    Get PDF
    The hourglass model is a widely used as a means of describing the design of the Internet, and can be found in the introduction of many modern textbooks. It arguably also applies to the design of other successful spanning layers, notably the Unix operating system kernel interface, meaning the primitive system calls and the interactions between user processes and the kernel. The impressive success of the Internet has led to a wider interest in using the hourglass model in other layered systems, with the goal of achieving similar results. However, application of the hourglass model has often led to controversy, perhaps in part because the language in which it has been expressed has been informal, and arguments for its validity have not been precise. Making a start on formalizing such an argument is the goal of this paper

    Towards Aggregate Processes in a Field Calculus-Based Platform

    Get PDF
    Aggregate programming è un paradigma promettente che vuole spostare il modo di vedere i sistemi distribuiti da una visione locale dei singoli device ad una visione aggregata. Il comportamento viene definito trattando il sistema nell'insieme come una singola entità, mentre le interazioni fra singoli diventa implicita. Tuttavia, il comportamento delle entità in sistemi distribuiti adattivi complessi potrebbe cambiare nel tempo per via di politiche di self-organization. In questo scenario, si creano dei gruppi dinamici di entità con l'obiettivo di raggiungere determinati risultati. Un processo aggregato identifica un insieme di azioni che ogni entità di un gruppo deve eseguire. Il lavoro svolto in questa tesi discute nel dettaglio il concetto di Aggregate process applicato ad aggregate computing. Un framework basato su aggregate programming e field calculus, chiamato scafi, è utilizzato per fornire una implementazione per Aggregate processes. Come prova di concetto, vengono presentate delle librerie che implementano modelli di coordinazione recenti. In particolare, i modelli in questione sono Spatial tuples, un modello basato sullo spazio di tuple in cui le tuple hanno una posizione fisica nello spazio, e Replicated gossip, una versione migliorata dei classici protocolli di gossip in cui sono utilizzate delle replicazioni basate sul tempo

    Resource Management in Message Passing Environments

    Get PDF
    This paper discusses the need for resource management support for parallel applications running on workstation clusters and communicating by message passing among tasks. Many resource management systems are only able to start a message passing runtime environment and parallel applications, but dynamic reconfiguration fails because of the missing cooperation between the resource manager and the runtime environment. In order to utilize computational resources in message passing environments efficiently, to control execution of parallel applications by rescheduling tasks at runtime, and to minimize their execution time, a resource management system has been developed and preliminary tests results have been carried out. Most of our efforts in this regard have been to design an efficient approach to load measurement and process scheduling and implement the resource management system in a manner such that it can easily be adapted to any message passing framework. Although our first version is based on the PVM system, we also intend to implement an MPI – based resource management system
    • …
    corecore