This paper addresses the problem of creating software tools for visualizing the dynamic behavior of parallel applications and systems. PARADISE (parallel Animated Debugging and Simulation Environment) approaches this ...
详细信息
In this paper, we present a complete characterization of the shortest paths and node disjoint (parallel) paths between any two nodes in an interesting class of graphs called orthogonal graphs with minimum non-disjoint...
详细信息
A mixed-mode parallel machine's processing elements (PEs) are capable of operating in and switching between the SIMD and MIMD modes of parallelism. The paper analyzes various mappings of image correlation algorith...
详细信息
Language constructs (and their implementations) for execution mode management and achieving the overlap of control unit and processor operations in an explicitly parallel programming language are described. These are ...
详细信息
Leung (J. Algorithms, 5 (1984)) presented algorithms for generating all the maximal independent sets in interval graphs and circular-arc graphs. The algorithms take O (n2+p) steps, where β is the sum of the number of...
This paper presents an analysis that leads to the complete characterization of the node disjoint (parallel) paths in a star graph. It is shown that by exploiting the cycle structure of permutations (same as the conjug...
Finding biconnected components (BCs) of graphs is one of the fundamental problems in graph theory which has many practical applications. If n and m are the number of the nodes and edges, respectively, in graph G, find...
详细信息
The use of the star graph as a viable interconnection scheme for parallelcomputers has been examined by a number of authors in recent times. An attractive feature of this class of graphs is that it has sublogarithmic...
The use of the star graph as a viable interconnection scheme for parallelcomputers has been examined by a number of authors in recent times. An attractive feature of this class of graphs is that it has sublogarithmic diameter and has a great deal of symmetry akin to the binary hypercube. In this paper we describe a new class of algorithms for embedding (a) Hamiltonian cycle (b) the set of all even cycles and (c) a variety of two- and multi-dimensional grids in a star graph. In addition, we also derive an algorithm for the ranking and the unranking problem with respect to the Hamiltonian cycle.
暂无评论