Folded Dualcube: A New Interconnection Topology for Parallel Systems

Adhikari, Nibedita; Tripathy, C. R.

doi:10.1109/icit.2008.49

Cited by 15 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…,where is the time required to solve the problem by a single processor using the fastest sequential algorithm,T p is the time required to solve the problem by a parallel algorithm using a multiprocessor system having p processors and is the ratio of the cost of penalty to cost of processors. For linear time penalty in T p , is chosen as 1 [7]. performance.…”

Section: Proofmentioning

confidence: 99%

Reliable, Effective and Fault-Tolerant Design of LeafyCube Interconnection Network Topology

Adhiakri*¹,

Singh²,

Swain³

2019

IJITEE

View full text Add to dashboard Cite

This paper attempts to derive the performance properties of the Leafycube (LC) interconnection network. The Leafycube is already observed to have quite superior topological properties in comparison to the other contemporary networks. The various performance parameters of the LC network are studied and compared with the existing HC and its variants. The routing and broadcasting algorithms are proposed and the time complexities are also compared. The paper attempts to evaluate the cost effectiveness, reliability and fault tolerance aspects of LC interconnection network in order to justify the novelty in the design of the proposed structure. The leafy structure helps to retain the original hypercube while improving the node packing density in the interconnection network.

show abstract

Section: Proofmentioning

confidence: 99%

Reliable, Effective and Fault-Tolerant Design of LeafyCube Interconnection Network Topology

Adhiakri*¹,

Singh²,

Swain³

2019

IJITEE

View full text Add to dashboard Cite

show abstract

“…In a parallel computing environment, a good network should provide some degree of fault tolerance . In this section, we discuss the fault‐tolerant capabilities of E F H ( s , t ).…”

Section: Fault‐tolerant Capabilitiesmentioning

confidence: 99%

An exchanged folded hypercube‐based topology structure for interconnection networks

et al. 2015

Concurrency and Computation

View full text Add to dashboard Cite

Summary This paper focuses on the topology structure of interconnection networks. To overcome drawbacks in the existing hypercube structure, we present an exchanged folded hypercube (EFH) structure, which is an improvement of the exchanged hypercube. Compared with the existing hypercube structures, EFH shows better performance in terms of many metrics such as smaller diameter, lower cost factor, and constant node degree. In this paper, we first introduce the structure of an EFH; then, we propose a routing algorithm and a load‐balancing algorithm for EFHs. Finally, we analyze the fault tolerance characteristics of EFHs including fault diameter and the cost effectiveness factor. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

“…Similarly, there are other numerous interconnection networks which are designed by improving a particular topological parameter. Some examples are the Folded Hypercube (FH) (Amway et al, 1991), Dual Cube (DC) (Li et al, 2000), Folded Dual Cube (FDC) (Adhikari et al, 2008), Meta Cube (MC) (Li et al, 2002), Folded Met cube (FMC) , and the Folded Cross Cube (FCC) (Adhikari et al, 2010).…”

Section: Introductionmentioning

confidence: 99%

Properties and Performance of Cube-Based Multiprocessor Architectures

Siddiqui

Samad

Khan

2016

International Journal of Applied Evolutionary Computation

View full text Add to dashboard Cite

Parallel architectures provide the possibility of solving highly computational parallel applications in a variety of ways. Numerous interconnection topologies have been designed to achieve the desired performance. Nevertheless, the actual performance is far below the expectation of users when executing parallel applications on a particular multiprocessor network. This paper presents the performance study on a special class of parallel architectures known as cube based multiprocessor architectures. It describes the issues and challenges related to the design of cube-based architectures. The issues related to the design of highly parallel system such as scalability, complexity of the system and mapping of parallel application on to it are discussed. Furthermore, the problem of routing between nodes has been analyzed along with the topological properties of cube-based architectures. Simulation results are obtained by applying task scheduling algorithm on various multiprocessor networks. The comparative study implies the various aspects while designing an efficient multiprocessor interconnection network with optimal scheduling algorithm.

show abstract

Folded Dualcube: A New Interconnection Topology for Parallel Systems

Cited by 15 publications

References 5 publications

Reliable, Effective and Fault-Tolerant Design of LeafyCube Interconnection Network Topology

Reliable, Effective and Fault-Tolerant Design of LeafyCube Interconnection Network Topology

An exchanged folded hypercube‐based topology structure for interconnection networks

Properties and Performance of Cube-Based Multiprocessor Architectures

Contact Info

Product

Resources

About