Representations of task assignments in distributed systems using Young tableaux and symmetric groups.
Saved in:
| Title: | Representations of task assignments in distributed systems using Young tableaux and symmetric groups. |
|---|---|
| Authors: | Kim, Dohan1 |
| Source: | International Journal of Parallel, Emergent & Distributed Systems. Apr2016, Vol. 31 Issue 2, p152-175. 24p. |
| Subjects: | Task assessment, Young tableaux, Symmetric functions, Group theory, Approximation theory |
| Abstract: | This article 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 article, 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 article 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. [ABSTRACT FROM PUBLISHER] |
| Copyright of International Journal of Parallel, Emergent & Distributed Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 112859793 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Representations of task assignments in distributed systems using Young tableaux and symmetric groups. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Kim%2C+Dohan%22">Kim, Dohan</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Parallel%2C+Emergent+%26+Distributed+Systems%22">International Journal of Parallel, Emergent & Distributed Systems</searchLink>. Apr2016, Vol. 31 Issue 2, p152-175. 24p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Task+assessment%22">Task assessment</searchLink><br /><searchLink fieldCode="DE" term="%22Young+tableaux%22">Young tableaux</searchLink><br /><searchLink fieldCode="DE" term="%22Symmetric+functions%22">Symmetric functions</searchLink><br /><searchLink fieldCode="DE" term="%22Group+theory%22">Group theory</searchLink><br /><searchLink fieldCode="DE" term="%22Approximation+theory%22">Approximation theory</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This article 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 article, 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 article 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. [ABSTRACT FROM PUBLISHER] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Parallel, Emergent & Distributed Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=112859793 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/17445760.2014.997729 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 24 StartPage: 152 Subjects: – SubjectFull: Task assessment Type: general – SubjectFull: Young tableaux Type: general – SubjectFull: Symmetric functions Type: general – SubjectFull: Group theory Type: general – SubjectFull: Approximation theory Type: general Titles: – TitleFull: Representations of task assignments in distributed systems using Young tableaux and symmetric groups. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Kim, Dohan IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2016 Type: published Y: 2016 Identifiers: – Type: issn-print Value: 17445760 Numbering: – Type: volume Value: 31 – Type: issue Value: 2 Titles: – TitleFull: International Journal of Parallel, Emergent & Distributed Systems Type: main |
| ResultId | 1 |
