๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On hypercube-based hierarchical interconnection network design

โœ Scribed by Sivarama P. Dandamudi; Derek L. Eager

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
653 KB
Volume
12
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Acceleration of hierarchical Bayesian ne
Acceleration of hierarchical Bayesian network based cortical models on multicore architectures
โœ Pavan Yalamanchili; Sumod Mohan; Rommel Jalasutram; Tarek Taha ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 788 KB

We examine the parallelization of two biologically inspired hierarchical Bayesian cortical models onto recent multicore architectures. These models have been developed recently based on new insights from neuroscience and have several advantages over traditional neural network models. In particular,

Migration of Tasks in Interconnection Ne
Migration of Tasks in Interconnection Networks Based on the Star Graph
โœ S. Latifi ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 603 KB

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 cons

A new class of interconnection networks
A new class of interconnection networks based on the alternating group
โœ 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