Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods

Abstract

Abstract

Priority-Based Task Reassignments in Hierarchical 2d Mesh-Connected Systems Using Tableaux

“…The final state of Figure 2(b) is the task reassignment A 1 for the completion of task 1. Given an initial task assignment A 0 in Figure 2(a), Figure 2(c) shows the task (re)assignment sequence (A k ) m−1 k=0 for m = 9 corresponding to the task completion sequence (1,3,2,5,8,4,6,7,9). Algorithm 2 describes the Algorithm 2: Task reassignments: λ-(HMT i,j ) of normal shape Input: An initial task assignment A 0 represented by λ-(HMT i,j ) of normal shape; a task completion sequence (b 1 , b 2 , .…”

“…The final state of Figure 2(b) is the task reassignment A 1 for the completion of task 1. Given an initial task assignment A 0 in Figure 2(a), Figure 2(c) shows the task (re)assignment sequence (A k ) m−1 k=0 for m = 9 corresponding to the task completion sequence (1,3,2,5,8,4,6,7,9). Algorithm 2 describes the ; end procedure in Figure 2.…”

“…Although the construction of a 2D-MS using heterogeneous nodes is considered in [6], most of the traditional approaches [1,24,26,35,36] are based on the assumptions that nodes in a 2D-MS are homogeneous. Further, the topology of the assigned tasks on a 2D-MS is restricted (e.g., rectangular or square-mesh shape) and priority-based task assignments and reassignments have not often been considered.…”

“…A distributed system is a collection of processing nodes connected by an interconnection network [21,31]. Among various interconnection networks for distributed systems, a two-dimensional (2D) mesh has received extensive study due to its simplicity, efficiency, and structural regularity [6,26,35,36]. Some data structures, such as matrices and arrays, naturally fit into a 2D mesh-connected system (2D-MS) [26].…”