A dynamic load balance algorithm is presented for PC cluster parallel system on unstructured meshes in two dimensions. With a non-oscillatory maximum and minimum bounded (MmB) schemes developed, this algorithm can eff...
详细信息
A dynamic load balance algorithm is presented for PC cluster parallel system on unstructured meshes in two dimensions. With a non-oscillatory maximum and minimum bounded (MmB) schemes developed, this algorithm can efficiently keep load balance on the parallel system. The numerical results show that the parallel algorithm is satisfied.
A new radii-based evolutionary algorithm (EA) designed for multimodal optimization problems is proposed. The approach can be placed within the genetic chromodynamics framework and related to other EAs with local inter...
详细信息
ISBN:
(纸本)0780393635
A new radii-based evolutionary algorithm (EA) designed for multimodal optimization problems is proposed. The approach can be placed within the genetic chromodynamics framework and related to other EAs with local interaction, e.g. using species formation or clearing procedures. The underlying motivation for modifying the original algorithm was to preserve its ability to search for many optima in parallel while increasing convergence speed, especially for complex problems, through generational selection and different replacement schemes. The algorithm is applied to function optimization and classification;obtained experimental results, in part improved immensely by state-of-the-art parameter tuning (SPO), encourage further investigation.
parallel algorithm of time-independent Monte Carlo transport problem is successful because particles are typically independent and easily distributed to multiple processors. However, for time-dependent Monte Carlo tra...
详细信息
parallel algorithm of time-independent Monte Carlo transport problem is successful because particles are typically independent and easily distributed to multiple processors. However, for time-dependent Monte Carlo transport problem, due to the communication of each time-step about scattering source attribute and meshes, it reduces the parallel efficiency and limits enlarge of parallel scale. We research two algorithms. Where adaptive processor assignment and the optimized processor choice are obtained. We propose a scheme that is based upon Monte Carlo layered sampling technique for treatment of scattering source communication. It greatly reduces the communication cost. The parallel expandability is obviously improved. The larger speedup over the basic algorithm is obtained.
This paper proposes an algorithm for finding the vertex sets with the first two specified leading symbols in directed split-stars. Our algorithm generalizes the previous distributed algorithms on directed split-stars ...
详细信息
ISBN:
(纸本)9806560426
This paper proposes an algorithm for finding the vertex sets with the first two specified leading symbols in directed split-stars. Our algorithm generalizes the previous distributed algorithms on directed split-stars that we know.
A Personal Distributed Environment (PDE) is the global set of inter-networked communication enabled device that a user possesses, and replaces the single terminal of the traditional personal communication model. The P...
详细信息
The parallel complexity of template matching has been well studied. In this paper we present more work-efficient algorithms than the existing ones. Our algorithms are based on FFT primitives. We consider the following...
详细信息
The parallel complexity of template matching has been well studied. In this paper we present more work-efficient algorithms than the existing ones. Our algorithms are based on FFT primitives. We consider the following models of computing: PRAM and the hypercube.
As an implementation of business processes workflows are inherently distributed. Consequently, there is a considerable amount both of commercial products and research prototypes that address distribution issues in wor...
详细信息
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (which is oblivious of its index in the...
详细信息
ISBN:
(纸本)9781581139860
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (which is oblivious of its index in the sequence) choose its position on the circle by learning the positions of as few existing nodes as possible. At the same time, we desire that that the variation in arc-lengths be small. To this end, we propose a new algorithm that works as follows: The kth node chooses r random points on the circle, inspects the sizes of v arcs in the vicinity of each random point, and places itself at the mid-point of the largest arc encountered. We show that for any combination of r and v satisfying rv ≥ c log k, where c is a small constant, the ratio of the largest to the smallest arc-length is at most eight w.h.p., for an arbitrarily long sequence of n nodes. This strategy of node placement underlies a novel decentralized load-balancing algorithm that we propose for Distributed Hash Tables (DHTs) in peer-to-peer environments. Underlying the analysis of our algorithm is Structured Coupon Collection over n/b disjoint cliques with b nodes per clique, for any n, b ≥ 1. Nodes are initially uncovered. At each step, we choose d nodes independently and uniformly at random. If all the nodes in the corresponding cliques are covered, we do nothing. Otherwise, from among the chosen cliques with at least one uncovered node, we select one at random and cover an uncovered node within that clique. We show that as long as bd ≥ c log n, O(n) steps are sufficient to cover all nodes w.h.p. and each of the first Ω(n) steps succeeds in covering a node w.h.p. These results are then utilized to analyze a stochastic process for growing binary trees that are highly balanced - the leaves of the tree belong to at most four different levels with high probability. Copyright 2005 ACM.
Many parallel algorithms have been proposed for computing the two-dimensional block-based medial axis transform (2D_BB_MAT). Unfortunately, almost all of them are dedicated for solving 2D_BB_AAT problem and are very d...
详细信息
In this work, we implement a genome alignment system which applies parallelization schemes to the ClustalW algorithm and the interface of database querying. parallel construction of the distance matrices and paralleli...
详细信息
暂无评论