The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete problem description. The information exchang...
详细信息
If a matching on a bipartite expander does not have maximum cardinality, it has a short augmenting path. This fact leads to an improved parallel algorithm for finding maximum cardinality matchings on such graphs. This...
详细信息
The authors present a novel method for embedding parallel programs of multiple processes exhibiting classical communication topologies into optical parallel architecture model (OPAM) parallel architecture. OPAM consis...
详细信息
Recently, there has been growing interest in simultaneous exploitation of task and data parallelism in scientific applications and in compiler and runtime support of this combined form of parallelism. In this paper we...
详细信息
ISBN:
(纸本)0818676833
Recently, there has been growing interest in simultaneous exploitation of task and data parallelism in scientific applications and in compiler and runtime support of this combined form of parallelism. In this paper we report on the integration of task and data parallelism on an important irregular application from the VLSI computer-aided design field namely VLSI layout verification. We report on the implementation, and experimental results of our study on a SUN Sparcserver 1000 shared memory multiprocessor a CM-5 distributed memory multiprocessor.
Efficient divide and conquer algorithms can be mapped to a parallel computer using either Task parallelism or Data parallelism. The former involves significant data movement and the latter can lead to severe load imba...
详细信息
ISBN:
(纸本)0818676833
Efficient divide and conquer algorithms can be mapped to a parallel computer using either Task parallelism or Data parallelism. The former involves significant data movement and the latter can lead to severe load imbalances. III this paper a new strategy is proposed, which we call Concatenated parallelism,for efficient parallel solution of problems resulting in divide and conquer trees. Our strategy is useful when the communication rime due to data movement in distributing the subproblems is significant in comparison to the rime required for subdivision.
An efficient technique for mapping arbitrarily large Bayesian belief networks on hypercubes with deadlock free implementation is presented. This technique shows that the speedup does not vary with the number of nodes ...
详细信息
ISBN:
(纸本)0818676833
An efficient technique for mapping arbitrarily large Bayesian belief networks on hypercubes with deadlock free implementation is presented. This technique shows that the speedup does not vary with the number of nodes in Bayesian network and is limited by the height of the Peot-Shachter tree. This technique also shows that the overhead in implementing Bayesian networks on parallel machines like hypercubes can be large.
作者：
Duppel, N.University of Stuttgart
Institute of Parallel and Distributed High Performance Systems Breitwiesenstr. 20 Stuttgart W-7000 Germany
The author introduces queueing network models for the optimization of the concurrent evaluation of complex database queries, which occur e.g. in deductive query processing. The basic principle for the optimization is ...
详细信息
Each vertex of an undirected graph possesses a piece of information which must be sent to every other vertex. The method of communication is to send bounded size packets of messages from one vertex to another. We desc...
详细信息
Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs, This paper presents an efficient distributed algori...
详细信息
ISBN:
(纸本)0818676833
Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs, This paper presents an efficient distributed algorithm to detect conjunctive form global predicates in distributed systems. The algorithm detects the first consistent global state that satisfies a given conjunction of local predicates. The algorithm is distributed because the predicate detection, efforts as well as the necessary information is equally distributed among the processes.
暂无评论