Parallel computation | Guide books skip to main content ACM Digital Library home ACM home
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …

Undertakes a comparative study of two important interconnection network topologies: the
star graph and the hypercube, from the graph theory point of view. Topological properties …

Suppose that G is a bipartite graph with its partite sets of equal size. G is said to be strongly
Hamiltonian‐laceable if there is a Hamiltonian path between every two vertices that belong …

In recent times the use of star and pancake networks as a viable interconnection scheme for
parallel computers has been examined by a number of researchers. An attractive feature of …

Data communication and fault tolerance are important issues in parallel computers in which
the processors are interconnected according to a specific topology. One way to achieve fault …

The star graph possess many nice topological properties. Edge fault tolerance is an
important issue for a network since the edges in the network may fail sometimes. In this …

In this paper, we propose and analyze a new interconnection network called bubblesort star
graph, which is the merger of the bubblesort graph and the star graph. We present the …

We survey routing problems on fixed-connection networks. We consider many aspects of the
routing problem and provide known theoretical results for various communication models …

The star and pancake networks were proposed recently as attractive alternatives to the
popular hypercube for interconnecting processors on a parallel computer. In this paper, we …

In this paper we consider three fundamental communication problems on the star
interconnection network: the problem of simultaneous broadcasting of a message from every …