Representations of task assignments in distributed systems using Young tableaux and symmetric groups
Abstract
This paper presents a novel approach to representing task assignments for partitioned agents (respectively, tasks) in distributed systems. A partition of agents (respectively, tasks) is represented by a Young tableau, which is one of the main tools in studying symmetric groups and combinatorics. In this paper we propose a task, agent, and assignment tableau in order to represent a task assignment for partitioned agents (respectively, tasks) in a distributed system. This paper is concerned with representations of task assignments rather than finding approximate or near optimal solutions for task assignments. A Young tableau approach allows us to raise the expressiveness of partitioned agents (respectively, tasks) and their task assignments.
Cite
@article{arxiv.1012.1288,
title = {Representations of task assignments in distributed systems using Young tableaux and symmetric groups},
author = {Dohan Kim},
journal= {arXiv preprint arXiv:1012.1288},
year = {2016}
}
Comments
This is an Accepted Manuscript of an article published by Taylor & Francis Group in International Journal of Parallel, Emergent and Distributed Systems on 02/02/2015, available online: http://dx.doi.org/10.1080/17445760.2014.997729