Priority-based task reassignments in hierarchical 2D mesh-connected systems using tableaux
Dohan Kim

TL;DR
This paper introduces a novel hierarchical 2D mesh system and models priority-based task reassignments using tableaux, reducing the problem to a jeu de taquin slide for efficient task relocation.
Contribution
It presents a new hierarchical 2D mesh model and a tableau-based algorithm for priority task reassignments, simplifying the process to a jeu de taquin slide.
Findings
Task reassignments are effectively modeled by tableaux.
Reassignment algorithms are reduced to jeu de taquin slides.
The approach exploits the regular structure of 2D mesh systems.
Abstract
Task reassignments in 2D mesh-connected systems (2D-MSs) have been researched for several decades. We propose a hierarchical 2D mesh-connected system (2D-HMS) in order to exploit the regular nature of a 2D-MS. In our approach priority-based task assignments and reassignments in a 2D-HMS are represented by tableaux and their algorithms. We show how task relocations for a priority-based task reassignment in a 2D-HMS are reduced to a jeu de taquin slide.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
