Abstract: The WK-Recursive network (WKRN) is a hierarchical interconnection network that is recursively defined and has excellent properties for scalable ...

In Section 3, we present techniques to embed rings of various sizes in a fault-free WKRN. In. Section 4, we describe how Hamiltonian cycles can be embedded in a ...

In this paper we describe the ability of a WKRN to implement algorithms that use the communication pattern of rings. We first describe how rings of arbitrary ...

Connected Papers is a visual tool to help researchers and applied scientists find academic papers relevant to their field of work.

Rings of even lengths are Mso embeddable. We provide an algorithm to systematically construct two isomorphic, embedded full binary trees (FBT's) in RCN's ...

Rings of even lengths are also embeddable. We provide an algorithm to systematically construct two isomorphic, embedded full binary trees (FBT's) in RCN's with ...

ABSTRACT: In this paper, we show a gathering of flexible interconnection organize topologies, named Recursive Cube of Rings (RCR), which are.

Algorithms for subnetwork allocation in a multiuser WK-Recursive network were presented in [9]. Embedding rings in a WK-Recursive network with faulty links ...

Mar 15, 2008 · In this paper, we investigate the routing of a message on RCR networks, that is a key to the performance of this network.

The problem of embedding rings or cycles into other interconnection networks has been studied by many researchers. It is well known that rings can be embedded.