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.
Notes
1. In this paper, we use task migration and process migration interchangeably.
2. An alternative method to find a minimum-length permutation factorization of permutation using the generating set S1={(i i+ 1): 1≤i<n} is to apply numbers game Citation4Citation15 of finite Coxeter group of type An−1 Citation20Citation53. An interested reader may refer to Citation4Citation15Citation20Citation53 for further details.
3. Source codes and sample data are available at http://www.airesearch.kr/downloads/tsg.zip.