Analyzing data-flow implementations for distributed execution of inter-organizational processes

Köpke, Julius; Franceschetti, Marco; Eder, Johann

doi:10.1145/3151759.3151775

Cited by 2 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have presented and evaluated existing approaches for the implementation of crossorganizational data-flows via message exchanges in [19]. Figure 2 shows 4 different augmentations for the example process in Fig.…”

Section: Base-line Approachesmentioning

confidence: 99%

“…A possibility to automatically obtain optimal data-flow implementations is to apply an exhaustive search employing some objective function to select the best solution for the given user requirements. All potential correct solutions can be generated with the equivalence transformations presented in [18] and the objective function can be composed of the measures for augmentations proposed in [19]. However, this approach does not scale, since the size of the search space explodes with the number of actors and with the number of xor-gateways in the process.…”

Section: On Finding 'Optimal' Implementationsmentioning

confidence: 99%

“…However, a direct implementation of this approach with heuristic search functions is not feasible for reasonably sized processes, because of the complexity of the problem. In [19] we defined measures for technical qualities of different implementations. These qualities cover the number of interactions or messages, the number of data transmissions and the impact on the complexity of some implementation.…”

Section: Introductionmentioning

confidence: 99%

“…Section 3 formalizes the underlying process model. Section 4 refines measures for assessing data-flow implementations from [19]. Section 5 newly introduces the class of non-redundant augmentations and revisits valuable other classes of data-flow implementations previously proposed in [19].…”

Section: Introductionmentioning

confidence: 99%

“…Section 4 refines measures for assessing data-flow implementations from [19]. Section 5 newly introduces the class of non-redundant augmentations and revisits valuable other classes of data-flow implementations previously proposed in [19]. Section 6 discusses optimization strategies for transitive submissions, lays the formal ground for incrementally computing augmentations and finally introduces a heuristic approach for deriving optimized data-flow implementations for various augmentation classes.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Optimizing data-flow implementations for inter-organizational processes

Köpke

Franceschetti

Eder

2018

Distrib Parallel Databases

Self Cite

View full text Add to dashboard Cite

Inter-organizational business processes can be designed top-down: starting from a global process model, where each activity and gateway is assigned to one of the participating organizations, local processes (or views/stubs for refinement) are generated for each organization. The resulting inter-organizational process is executed by the local processes in a fully distributed manner. Implementing the data-flow in such a scenario is highly complex, both because of the combinatorial explosion of possible solutions and because of conflicting goals for implementing the data-flow. We present a flexible, heuristic algorithm for implementing the data-flow for inter-organizational processes according to various user preferences, which significantly improves over the base-line approaches proposed so far. The approach is fully implemented and a comprehensive, multi-dimensional evaluation is provided.

show abstract

Section: Base-line Approachesmentioning

confidence: 99%

Section: On Finding 'Optimal' Implementationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations