𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Migration of Tasks in Interconnection Networks Based on the Star Graph

✍ Scribed by S. Latifi


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
603 KB
Volume
31
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

✦ Synopsis


The hierarchy of the star graph allows the assignment of its special subgraphs (substars), which have the same topological features as the original graph, to a sequence of incoming tasks. The procedure for task allocation in the star graph can be done using the star code and the allocation tree constructed based on this code. In this paper, the optimal set of codes which can collectively recognize a set of distinct substars is derived. It is shown that using only ( (n-1)) codes, almost half of the existing substars in an (\boldsymbol{n})-dimensional star is recognizable for (\boldsymbol{n} \leq \mathbf{9}). When relinquishment of tasks is considered, task migration could potentially improve the utilization of network resources by reducing/eliminating the fragmentation caused as a result of task deallocation. A deadlock-free procedure is presented to migrate a task, distributed over the nodes of one substar, to the nodes of the other substar wherein: (i) subtasks travel in parallel via disjoint paths; (ii) the adjacency among the mapped nodes is preserved. The procedure can be made distributed with a slight modification. The work can be extended to other hierarchical networks based on permutation group. (1995 \mathrm{Aca}) demic Press, Inc


📜 SIMILAR VOLUMES


A new class of interconnection networks
✍ Jung-Sing Jwo; S. Lakshmivarahan; S. K. Dhall 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 724 KB

This paper introduces a new class of interconnection scheme based on the Cayley graph of the alternating group. It is shown that this class of graphs are edge symmetric and 2-transitive. We then describe an algorithm for (a) packet routing based on the shortest path analysis, (b) finding a Hamiltoni

Modeling of very high-frequency effects
✍ A. K. Goel; S. E. Weitemeyer 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

## Abstract In this paper, a model of the propagation delays in the interconnection lines on GaAs‐based very high‐speed integrated circuits is presented. The model includes the very high‐frequency effects, such as geometric dispersion, substrate losses, and conductor losses. The model is used to si

On the implementation of linear diffusio
✍ J. Fernández-Berni; R. Carmona-Galán 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 721 KB

## Abstract In theory, cellular nonlinear networks (CNN) are well capable of implementing discrete‐space linear diffusion by means of the appropriate templates. In practice, good results have not been demonstrated with transconductance‐based circuits. In this paper, we prove that inherent mismatch

Network structural influences on the ado
✍ Kayo Fujimoto; Thomas W. Valente; Mary Ann Pentz 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract This study examined the impact of key variables in coalition communication networks, centralization and density, on the adoption of evidence‐based substance abuse prevention. Data were drawn from a network survey and a corresponding community leader survey that measured leader attitudes

Efficient extraction of equivalent circu
✍ M. Tong 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract Battle‐Lemarie father wavelet is used as a basis function in the method of moments (MoM) for solving interconnect and packaging problems and extracting circuit parameters needed in signal integrity. As the Battle‐Lemarie father wavelet or scalet is continuous, symmetric, and much more s