Data-parallel algorithms are presented for polygonizing a collection of line segments represented by a data-parallel bucket PMR quadtree, a data-parallel R-tree, and a data-parallel R+-tree. Such an operation is usefu...
详细信息
in this article, we present a solution to the maximum clique problem using a gradient-ascent learning algorithm of the Hopfield neural network. This method provides a near-optimum parallel algorithm for finding a maxi...
详细信息
in this article, we present a solution to the maximum clique problem using a gradient-ascent learning algorithm of the Hopfield neural network. This method provides a near-optimum parallel algorithm for finding a maximum clique. To do this, we use the Hopfield neural network to generate a near-maximum clique and then modify weights in a gradient-ascent direction to allow the network to escape from the state of near-maximum clique to maximum clique or better. The proposed parallel algorithm is tested on two types of random graphs and some benchmark graphs from the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). The simulation results show that the proposed learning algorithm can find good solutions in reasonable computation time.
This paper describes a new parallel algorithm for solving multiphysics problems. These kind of problems are very demanding in terms of CPU time and memory space, which are typically not available on a single processor...
详细信息
For a positive integer c, a c-vertex-ranking of a graph G = (V,E) is a labeling of the vertices of G with integers such that, for any label i, deletion of all vertices with labels > i leaves connected components, e...
详细信息
Let G be a graph with n vertices and m edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and n - 1 edges. In this paper, we propose an O(log n) time parallel algor...
详细信息
Let G be a graph with n vertices and m edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and n - 1 edges. In this paper, we propose an O(log n) time parallel algorithm with O(n/log n) processors on an EREW PRAM for constructing a spanning tree on trapezoid graphs.
In this paper, we present a parallel algorithm for medial axis transformation, which is based on the parallel distance transformation presented in [1]. We first modify the parallel distance transformation as described...
详细信息
A novel algorithm for performing parallel, distributed computer simulations on the Internet using Internet protocol (IP) control messages is introduced. The algorithm employs carefully constructed Internet control mes...
详细信息
A novel algorithm for performing parallel, distributed computer simulations on the Internet using Internet protocol (IP) control messages is introduced. The algorithm employs carefully constructed Internet control message protocol (ICMP) packets that enable the required computations to be completed as part of the standard IP communication protocol. After providing a detailed description of the algorithm, experimental applications in the areas of stochastic neural networks and deterministic cellular automata axe discussed. As an example of the algorithm's potential power, a simulation of a deterministic cellular automaton involving 10(5) Internet-connected devices was performed.
In this paper we analyze a two-level preconditioner for finite element systems arising in approximations of second order elliptic boundary value problems by Crouzeix-Raviart non-conforming triangular linear elements. ...
详细信息
We present an efficient and scalable coarse grained multicomputer (CGM) coloring algorithm that colors a graph G with at most Delta + 1 colors where A is the maximum degree in G. This algorithm is given in two variant...
详细信息
We present an efficient and scalable coarse grained multicomputer (CGM) coloring algorithm that colors a graph G with at most Delta + 1 colors where A is the maximum degree in G. This algorithm is given in two variants: randomized and deterministic. We show that on a p-processor CGM model the proposed algorithms require a parallel time of O(\G\/p) and a total work and overall communication cost of O(\G\). These bounds correspond to the average case for the randomized version and to the worst case for the deterministic variant. (C) 2003 Elsevier B.V. All rights reserved.
Deadlock prevention for routing messages has a central role in communication networks, since it directly influences the correctness of parallel and distributed systems. In this paper, we extend some of the computation...
详细信息
Deadlock prevention for routing messages has a central role in communication networks, since it directly influences the correctness of parallel and distributed systems. In this paper, we extend some of the computational results presented in Second Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton University Press, 1995, pp. 1-12 on acyclic orientations for the determination of optimal deadlock-free routing schemes. In this context, minimizing the number of buffers needed to prevent deadlocks for a set of communication requests is related to finding an acyclic orientation of the network which minimizes the maximum number of changes of orientations on the dipaths realizing the communication requests. The corresponding value is called the rank of the set of dipaths. We first show that the problem of minimizing the rank is NP-hard if all shortest paths between the couples of nodes wishing to communicate have to be represented and even not approximable if only one shortest path between each couple has to tie represented. This last result holds even if we allow an error which is any sublinear function in the number of couples to be connected. We then improve some of the known lower and upper bounds on the rank of all possible shortest dipaths between any couple of vertices for particular topologies, such as grids and hypercubes, and we find tight results for tori. (C) 2002 Elsevier Science B.V. All rights reserved.
暂无评论