Two ranking schemes for efficient computation on the star interconnection network

Saikia, Dilip Kr.; Sen, Ranjan

doi:10.1109/71.494627

Cited by 18 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Efficient communication algorithms were proposed for shortest-path routing [1,19], multiple-path routing [8,9], multicasting [11], broadcasting [16,19,25], gossiping [5], and scattering [11]. Moreover, efficient algorithms were designed for sorting and merging [15,19], selection [18], prefix sums [19], ranking [24], Fourier transform [10], and computational geometry [20].…”

Section: Introductionmentioning

confidence: 99%

Hamiltonian-laceability of star graphs

Hsieh

Chen

2000

Networks

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Hamiltonian-laceability of star graphs

Hsieh

Chen

2000

Networks

View full text Add to dashboard Cite

“…Many different ranking schemes have been proposed in the literature that embed grids, linear arrays and multiple ring networks [1,11,15] in the star network. The problem of embedding a Hamiltonian cycle in the star graph has also been studied in the past [11,17].…”

Section: Basic Algorithmmentioning

confidence: 99%

Perfect load balancing on the star interconnection network

2007

View full text Add to dashboard Cite

In this paper, we use the regular distribution method to design a perfect load balancing algorithm for an n-star with a maximum error of 1 and a time complexity of 3n(n + 1). This algorithm is based on the novel notion of leader trees. A second algorithm proposed in this paper as an enhancement to our first algorithm and uses an arbitrary spanning tree as the leader tree and has a worst time complexity of 2.25n 2 − 3n + 0.75. We also discuss the issue of dynamically selecting the leader tree and hybrid load balancing algorithms in general. Furthermore, we present a hybrid algorithm for load balancing on the star interconnection network which benefits from a diffusion load balancing preprocessing phase and shows a smaller mean time complexity than our two first algorithms.

show abstract

“…The star graph belongs to the class of Cayley graphs [5], is symmetric and strongly hierarchical, and has diameter and node degree that are superior to those of a similarsized hypercube. Also, it has been shown that a number of important algorithms can be performed efficiently on the star graph [6], [7], [8], [9], [10], [20], [36], [38], [42], [43], [45].…”

Section: Introductionmentioning

confidence: 99%

Macro-star networks: efficient low-degree alternatives to star graphs

Yeh

Varvarigos

1998

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

We propose a new class of interconnection networks, called macro-star networks, which belong to the class of Cayley graphs and use the star graph as a basic building module. A macro-star network can have node degree that is considerably smaller than that of a star graph of the same size, and diameter that is sublogarithmic and asymptotically within a factor of 1.25 from a universal lower bound (given its node degree). We show that algorithms developed for star graphs can be emulated on suitably constructed macro-stars with asymptotically optimal slowdown. This enables us to obtain through emulation a variety of efficient algorithms for the macro-star network, thus proving its versatility. Basic communication tasks, such as the multinode broadcast and the total exchange, can be executed in macro-star networks in asymptotically optimal time under both the single-port and the all-port communication models. Moreover, no interconnection network with similar node degree can perform these communication tasks in time that is better by more than a constant factor than that required in a macro-star network. We show that macro-star networks can embed trees, meshes, hypercubes, as well as star, bubble-sort, and complete transposition graphs with constant dilation. We introduce several variants of the macro-star network that provide more flexibility in scaling up the number of nodes. We also discuss implementation issues and compare the new topology with the star graph and other popular topologies.

show abstract

Two ranking schemes for efficient computation on the star interconnection network

Cited by 18 publications

References 8 publications

Hamiltonian-laceability of star graphs

Hamiltonian-laceability of star graphs

Perfect load balancing on the star interconnection network

Macro-star networks: efficient low-degree alternatives to star graphs

Contact Info

Product

Resources

About