The Optical Chained-Cubic Tree interconnection network: Topological structure and properties

Mahafzah, Basel A.; Alshraideh, Mohammad; Abu-Kabeer, Tasneem M.; Ahmad, Elham F.; Hamad, Nesreen A.

doi:10.1016/j.compeleceng.2011.11.023

Cited by 23 publications

(22 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Network throughput and average delay are presented as two performance metrics for simulation in Equations (10) and (11). They measure in flits/node/ cycle for each traffic pattern.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…In the interconnection network, the network performance depends on the characteristics of the network topology and the employed routing within it. In previous studies [7][8][9][10][11][12][13][14][15], different interconnect topologies, such as k-ary ncubes, are popular topologies that have been utilized. Figure 1 illustrates the taxonomy of interconnection networks.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Mathematical modelling for TM topology under uniform and hotspot traffic patterns

Moudi

Othman

2017

Automatika

View full text Add to dashboard Cite

Interconnection networks are introduced when dealing with the connection of a significant number of processors in massively parallel systems. TM topology is one of the latest interconnection networks to solve the deadlock problem and achieve high performance in massively parallel systems. This topology is derived from a Torus topology with removing cyclic channel dependencies. In this paper, we derive a mathematical model for TM topology under uniform and hotspot traffic patterns to compute the average delay. The average delay is formulated from the sum of the average delay of network, the average waiting time of the source node and the average degree of virtual channels. The results obtained from the mathematical model exhibit a close agreement with those predicted by simulation. In addition, sufficient simulation results are presented to revisit the TM topology performance under various traffic patterns.

show abstract

“…Network throughput and average delay are presented as two performance metrics for simulation in Equations (10) and (11). They measure in flits/node/ cycle for each traffic pattern.…”

Section: Simulation Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Mathematical modelling for TM topology under uniform and hotspot traffic patterns

Moudi

Othman

2017

Automatika

View full text Add to dashboard Cite

show abstract

“…Microsoft Azure service of creating multi-core virtual machines can be also invested to parallelize the MVPA_MVCP algorithm. Additionally, it can be parallelized over some types of interconnection networks like Chained-Cubic Tree interconnection network (CCT) [34], Optical Chained-Cubic Tree interconnection network (OCCT) [35], and Optical Transpose Interconnection System (OTIS) networks; such as OTIS-hypercube, OTIS-mesh, OTIS hyper hexa-cell, and OTIS mesh of trees [36,37]. These interconnection networks exposed their usefulness for solving various problems in a parallel mode [36][37][38].…”

Section: Discussionmentioning

confidence: 99%

Most Valuable Player Algorithm for Solving Minimum Vertex Cover Problem

Khattab¹,

Sharieh²,

Mahafzah³

2019

IJACSA

View full text Add to dashboard Cite

Minimum Vertex Cover Problem (MVCP) is a combinatorial optimization problem that is utilized to formulate multiple real-life applications. Owing to this fact, abundant research has been undertaken to discover valuable MVCP solutions. Most Valuable Player Algorithm (MVPA) is a recently developed metaheuristic algorithm that inspires its idea from team-based sports. In this paper, the MVPA_MVCP algorithm is introduced as an adaptation of the MVPA for the MVCP. The MVPA_MVCP algorithm is implemented using Java programming language and tested on a Microsoft Azure virtual machine. The performance of the MVPA_MVCP algorithm is evaluated analytically in terms of run time complexity. Its average-case run time complexity is ceased to , where I is the size of the initial population, |V| is the number of vertices and |E| is the number of edges of the tested graph. The MVPA_MVCP algorithm is evaluated experimentally in terms of the quality of gained solutions and the run time. The experimental results over 15 instances of DIMACS benchmark revealed that the MVPA_MVCP algorithm could, in the best case, get the best known optimal solution for seven data instances. Also, the experimental findings exposed that there is a direct relation between the number of edges of the graph under test and the run time.

show abstract

“…As future work, this algorithm will be adapted to run on a parallel architecture, just like in [46,47], where a parallel heuristic local search is used to solve travelling salesman problem using four parallel architectures (e.g. "OTIS-Hypercube", "OTIS-Mesh", OTIS hyper hexa-cell, and OTIS mesh of trees optoelectronic architectures) and testing against other architectures, such as "The optical chained-cubic tree interconnection network" which is illustrated in [48].…”

Section: Accuracy Percentagementioning

confidence: 99%

Chemical Reaction Optimization Algorithm to Find Maximum Independent Set in a Graph

Asmaran¹,

Sharieh²,

Mahafzah³

2019

IJACSA

View full text Add to dashboard Cite

Finding maximum independent set (MIS) in a graph is considered one of the fundamental problems in the computer science field, where it can be used to provide solutions for various real life applications. For example, it can be used to provide solutions in scheduling and prioritization problems. Unfortunately, this problem is one of the NP-problems of computer science, which limit its usage in providing solution for such problems with large sizes. This leads the scientists to find a way to provide solutions of such problems using fast algorithms to provide some near optimal solutions. One of the techniques used to provide solutions is to use metaheuristic algorithms. In this paper, a metaheuristic algorithm based on Chemical Reaction Optimization (CRO) is applied with various techniques to find MIS for application represented by a graph. The suggested CRO algorithm achieves accuracy percentages that reach 100% in some cases. This variation depends on the overall structure of the graph along with the picked parameters and colliding molecule selection criteria during the reaction operations of the CRO algorithm.

show abstract

The Optical Chained-Cubic Tree interconnection network: Topological structure and properties

Cited by 23 publications

References 26 publications

Mathematical modelling for TM topology under uniform and hotspot traffic patterns

Mathematical modelling for TM topology under uniform and hotspot traffic patterns

Most Valuable Player Algorithm for Solving Minimum Vertex Cover Problem

Chemical Reaction Optimization Algorithm to Find Maximum Independent Set in a Graph

Contact Info

Product

Resources

About