A recursively scalable network VLSI implementation

Vecchia, Gennaro Della; Sanges, C.

doi:10.1016/0167-739x(88)90007-6

Cited by 111 publications

(42 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, Sierpiński graphs were studied from numerous other points of view, recent investigations include [11,16,17,20,23,28,29,30]. We also point out that earlier than the Sierpiński graphs, the so-called WK-recursive networks were introduced in [6], see also [10]. WK-recursive networks are very similar to Sierpiński graphs-they can be obtained from Sierpiński graphs by adding a link (an open edge) to each of its extreme vertices.…”

Section: Introductionmentioning

confidence: 99%

Generalized Power Domination: Propagation Radius and Sierpiński Graphs

Dorbec

Klavžar

2014

Acta Appl Math

View full text Add to dashboard Cite

The recently introduced concept of k-power domination generalizes domination and power domination, the latter concept being used for monitoring an electric power system. The k-power domination problem is to determine a minimum size vertex subset S of a graph G such that after setting X = N [S], and iteratively adding to X vertices x that have a neighbour v in X such that at most k neighbours of v are not yet in X, we get X = V (G). In this paper the k-power domination number of Sierpiński graphs is determined. The propagation radius is introduced as a measure of the efficiency of power dominating sets. The propagation radius of Sierpiński graphs is obtained in most of the cases.

show abstract

Section: Introductionmentioning

confidence: 99%

Generalized Power Domination: Propagation Radius and Sierpiński Graphs

Dorbec

Klavžar

2014

Acta Appl Math

View full text Add to dashboard Cite

show abstract

“…When we cut a network into two equal haves, the minimum number of edges or channels along that cut is called the channel bisection width [3,[9][10][11]. Here we have denoted it as 'b'.…”

Section: Bisection Widthmentioning

confidence: 99%

“…The network topology which secures constant node degree is highly desirable. Constant node degree facilitates modularity in building blocks for scalable systems [3,[9][10][11]. Therefore the node degree of MLO is constant when d > 1.…”

Section: Node Degreementioning

confidence: 99%

See 1 more Smart Citation

Optimal Routing Algorithm in Multilayer Octagon-Cell: A New Class of Octagon-Cell Interconnected Networks

Mohanty

Behera

2017

TNC

View full text Add to dashboard Cite

In communication system of network routing algorithm acts an important role. The efficiency of a parallel system depends on the reliable and efficient routing algorithm which is used to route the messages between the fault-free nodes. In this paper a new class of interconnection network of Octagon-Cell is introduced, which is called Multilayer Octagon-Cell (MLO). The structure of Multilayer Octagon-cell is recursive in nature. It can be expanded, if we increase the depth of MLO. This paper introduces the node degree, diameter, number of links, bisection width of the MLO network and we have also developed the optimal routing algorithm of MLO.

show abstract

“…By using techniques introduced in this paper, we can also obtain the best known VLSI layouts for the above networks. These techniques can also be applied to a variety of other hierarchical networks, such as WK recursive networks [9] and cyclic networks [ 271.…”

Section: [G +G)]mentioning

confidence: 99%

VLSI layouts of complete graphs and star graphs

Yeh

Parhami

1998

Information Processing Letters

View full text Add to dashboard Cite

In this paper, we present efficient layouts for complete graphs and star graphs. We show that an N-node complete graph can be optimally laid out using LN2/4] tracks for a colinear layout, and can be laid out in N4/16 + o(N4) area for a 2D layout. We also show that an N-node star graph can be laid out in N2/16 + o(N2) area, which is smaller than any possible layout of a similar-size hypercube. This solves an open question posed by Akers and Krishnamurthy in 1986. Both the layouts of complete graphs and star graphs are optimal within a factor 1 + o(l). 0

show abstract

A recursively scalable network VLSI implementation

Cited by 111 publications

References 4 publications

Generalized Power Domination: Propagation Radius and Sierpiński Graphs

Generalized Power Domination: Propagation Radius and Sierpiński Graphs

Optimal Routing Algorithm in Multilayer Octagon-Cell: A New Class of Octagon-Cell Interconnected Networks

VLSI layouts of complete graphs and star graphs

Contact Info

Product

Resources

About