English

Blackboard Meets Dijkstra for Optimization of Web Service Workflows

Distributed, Parallel, and Cluster Computing 2018-01-03 v1

Abstract

This paper presents the integration of Dijkstra's algorithm within a Blackboard framework to optimize the selection of web services from service providers. In addition, methods are presented how dynamic changes during the workflow execution can be handled; specifically, how changes of the service parameters have effects on the system. For justification of our approach, and to show practical feasibility, a sample implementation is presented.

Keywords

Cite

@article{arxiv.1801.00322,
  title  = {Blackboard Meets Dijkstra for Optimization of Web Service Workflows},
  author = {Christian Vorhemus and Erich Schikuta},
  journal= {arXiv preprint arXiv:1801.00322},
  year   = {2018}
}

Comments

17 pages, 10 figures, paper submitted for publication

R2 v1 2026-06-22T23:33:24.386Z