Joint Execution and State Residency for Recurrent Workflows in Computing Networks

Recurrent workflows revisit mutable state after intervening computations. Retaining state at its owner permits compact update returns, whereas migration changes future access paths and memory occupancy. This paper studies joint execution and state residency for serialized workflows in computing networks. The formulation distinguishes intermediate data, full-state fetches, and differential updates, minimizing computation and communication cost under resource reservations, peak-memory limits, and a completion deadline. Reuse-Frontier Label Search (RFLS) represents each execution prefix by the last host, owners of states awaiting reuse, and accumulated resource consumption. Componentwise dominance and admissible completion bounds prune the search. The unrestricted algorithm is exact; a finite label budget yields a heuristic. On 24 default synthetic instances, RFLS reduces mean paired cost by 4.64% relative to greedy placement. With a label width of 64, it matches 58 of the 63 certified optima in the intermediate-size tests. Experiments extending to 60 invocations examine the effects of resource limits, state reuse, and search effort on placement cost and runtime.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2026-11-18
DOI
https://doi.org/10.3390/electronics15225387
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Joint Execution and State Residency for Recurrent Workflows in Computing Networks

Danyang Zheng, Chao Wang, Xinyue Wan, Shuxue Ding
Electronics
Distributed and Parallel Computing Systems
article

Joint Execution and State Residency for Recurrent Workflows in Computing Networks

Danyang Zheng, Chao Wang, Xinyue Wan, Shuxue Ding
article en

Abstract

Recurrent workflows revisit mutable state after intervening computations. Retaining state at its owner permits compact update returns, whereas migration changes future access paths and memory occupancy. This paper studies joint execution and state residency for serialized workflows in computing networks. The formulation distinguishes intermediate data, full-state fetches, and differential updates, minimizing computation and communication cost under resource reservations, peak-memory limits, and a completion deadline. Reuse-Frontier Label Search (RFLS) represents each execution prefix by the last host, owners of states awaiting reuse, and accumulated resource consumption. Componentwise dominance and admissible completion bounds prune the search. The unrestricted algorithm is exact; a finite label budget yields a heuristic. On 24 default synthetic instances, RFLS reduces mean paired cost by 4.64% relative to greedy placement. With a label width of 64, it matches 58 of the 63 certified optima in the intermediate-size tests. Experiments extending to 60 invocations examine the effects of resource limits, state reuse, and search effort on placement cost and runtime.

ElectronicsVol. 15(22)
Georgia State University (US), Gandong College (CN), Southwest Jiaotong University (CN)
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon