Task swapping networks in distributed systems

DOI10.1080/00207160.2013.772985MaRDI QIDQ2874305zbMATH OpenOpenAlexFDO

Authors Dohan Kim

Publication date 29 January 2014

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1107.1851

zbMATH Keywords

distributed systempermutation grouptask assignmenttask swapping graphtask swapping network

Mathematics Subject Classification ID

Distributed systems (68M14)

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.

Recommendations

• Distributed computation in dynamic networks
• Distributed Computing - IWDC 2004
• Distributed computation and reconfiguration in actively dynamic networks
• Distributed Computation and Reconfiguration in Actively Dynamic Networks
• Task allocation on a network of processors
• scientific article; zbMATH DE number 719724
• Task scheduling in networks
• Task assignment in distributed computing systems
• Task Scheduling in Networks
• scientific article; zbMATH DE number 1256754

Cites work

• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• A group-theoretic model for symmetric interconnection networks
• Algebraic Graph Theory
• An approximation algorithm for the generalized assignment problem
• Approximation algorithms for scheduling unrelated parallel machines
• Assignment Problems
• Combinatorics of Coxeter Groups
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1196829 (Why is no real title available?)
• scientific article; zbMATH DE number 944424 (Why is no real title available?)
• scientific article; zbMATH DE number 3248033 (Why is no real title available?)
• Machine scheduling with resource dependent processing times
• Minimal factorizations of permutations into star transpositions
• New classes of interconnection topology structures and their properties
• On the representation of permutations as products of transpositions
• Permutations as Products of Transpositions
• Reduced decompositions and permutation patterns
• Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ary trees
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Task assignment in Cayley interconnection topologies
• The complexity of finding minimum-length generator sequences

Cited in

(4)

• Sorting on graphs by adjacent swaps using permutation groups
• Swapped interconnection networks: Topological, performance, and robustness attributes
• Priority-based task reassignments in hierarchical 2D mesh-connected systems using tableaux
• Distributed Computing - IWDC 2004

This page was built for publication: Task swapping networks in distributed systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874305)