Workflow decomposition algorithm for scheduling with quantum annealer-based hybrid solver
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915318239068160 |
|---|---|
| author | Kroczek, Marcin Zawalska, Justyna Rycerz, Katarzyna |
| author_facet | Kroczek, Marcin Zawalska, Justyna Rycerz, Katarzyna |
| contents | We introduce the Series-Parallel Workflow Decomposition (SP\-WD) heuristic algorithm for the Workflow Scheduling Problem (WSP) decomposition. We demonstrate that the SPWD algorithm facilitates the scheduling of large WSP instances with the hybrid D-Wave Constrained Quadratic Model solver, enabling the scheduling of instances that would otherwise exceed its capacity limitations. We also describe the accompanying execution environment used to obtain the results of the experiments with real-life workflow instances available in the WfCommons standardization initiative repository. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_01567 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Workflow decomposition algorithm for scheduling with quantum annealer-based hybrid solver Kroczek, Marcin Zawalska, Justyna Rycerz, Katarzyna Distributed, Parallel, and Cluster Computing We introduce the Series-Parallel Workflow Decomposition (SP\-WD) heuristic algorithm for the Workflow Scheduling Problem (WSP) decomposition. We demonstrate that the SPWD algorithm facilitates the scheduling of large WSP instances with the hybrid D-Wave Constrained Quadratic Model solver, enabling the scheduling of instances that would otherwise exceed its capacity limitations. We also describe the accompanying execution environment used to obtain the results of the experiments with real-life workflow instances available in the WfCommons standardization initiative repository. |
| title | Workflow decomposition algorithm for scheduling with quantum annealer-based hybrid solver |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2506.01567 |