Task swapping networks in distributed systems

TL;DR

This paper introduces task swapping networks in distributed systems, utilizing group-theoretic methods to optimize task reassignments through local swaps across various network topologies.

Contribution

It presents a novel approach using group theory to determine minimal sequences of task swaps for efficient task reassignment in distributed systems.

Findings

Group-theoretic methods effectively find minimal swap sequences.

Applicable to multiple well-known network topologies.

Enhances efficiency of task reassignments in distributed systems.

Abstract

In this paper we propose task swapping networks for task reassignments by using task swappings in distributed systems. Some classes of task reassignments are achieved by using iterative local task swappings between software agents in distributed systems. We use group-theoretic methods to find a minimum-length sequence of adjacent task swappings needed from a source task assignment to a target task assignment in a task swapping network of several well-known topologies.