In this paper, we present an efficient algorithm to solve the orientation optimization problem for a layered wheel floorplan. The strategy used is to generate all the nonredundant implementations for the floorplan. The ...

It is well known that the hypercube has a rich set of good properties, and consequently it has been recognized an ideal structure for parallel computation. Nevertheless, according to the current VLSI technology, the ...

The star interconnection network has recently been suggested as an alternative to the hypercube. As hypercubes are often viewed as universal and capable of simulating other architectures efficiently, we investigate embeddings ...

Fault tolerance in hypercubes is achieved by exploiting inherent redundancy and executing tasks on faulty hypercubes. The authors consider tasks that require linear chain, ring, mesh, and torus structure, which are quite ...

In this paper, we study the strong connectivity of Cayley color graphs when a certain number of vertices are removed. We prove that there are 1/2D1/2 vertex-disjoint paths from every vertex to every other vertex in a Cayley ...

Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compared to hypercubes. In this paper, we focus ...

Linear layouts play an important role in many applications including networks and VLSI design. Stack and queue layouts are two important types of linear layouts. We consider the stack number, s(G), and queue number, q(G), ...

The structure of the interconnection network can be the deciding and limiting factor in performance and cost of parallel computers. Hypercube is one of the most popular interconnection networks. The symmetry, logarithmic ...

Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type ...