A parallelization scheme, which drives processing in simulations of the Monte Carlo type, suitable in highly heterogeneous computer system of a general purpose, is proposed. the message passing is applied and the MPI ...
详细信息
ISBN:
(纸本)9783540681052
A parallelization scheme, which drives processing in simulations of the Monte Carlo type, suitable in highly heterogeneous computer system of a general purpose, is proposed. the message passing is applied and the MPI library is exploited. For testing, the 2D Ising model in a magnetic field is taken. the dependence of speedup on the number of parallel processes is studied, showing that the scheme works well in different parallel computer systems. the condition for the best speedup in these simulations is explained. the possibility of parallel use of any available computing power from the surrounding is also indicated.
Minimally Synchronous parallel ML (MSPML) is a functional parallel programming language. It is based on a small number of primitives on a parallel data structure. MSPML programs are written like usual sequential ML pr...
详细信息
ISBN:
(纸本)9783540681052
Minimally Synchronous parallel ML (MSPML) is a functional parallel programming language. It is based on a small number of primitives on a parallel data structure. MSPML programs are written like usual sequential ML program and use this small set of functions. MSPML is deterministic and deadlock free. the execution time of the programs can be estimated. Divide-and-conquer is a natural way of expressing parallel algorithms. MSPML is a flat language: it is not possible to split the parallel machine in order to implement divide-and-conquer parallel algorithms. this paper presents an extension of MSPML to deal withthis kind of algorithms: a parallel composition primitive.
Derivation of input sequences for distinguishing states of a finite state machine (FSM) specification is well studied in the context of FSM-based functional testing. We present a parallel multithreaded implementation ...
详细信息
ISBN:
(纸本)9781509054541
Derivation of input sequences for distinguishing states of a finite state machine (FSM) specification is well studied in the context of FSM-based functional testing. We present a parallel multithreaded implementation of the exact algorithm using Open Multi-processing (OpenMP). Experiments are conducted to assess the performance of the parallel implementation as compared to the sequential implementation using both execution time speedup and efficiency.
In this paper, we introduce one important source of high-performance computations, namely mathematical modelling of deep geological repositories of the spent nuclear fuel, and describe two real concepts of such reposi...
详细信息
ISBN:
(纸本)9783540681052
In this paper, we introduce one important source of high-performance computations, namely mathematical modelling of deep geological repositories of the spent nuclear fuel, and describe two real concepts of such repositories. Mathematical modelling is practically the only way how to predict the behaviour of such facilities in their long-term existence. We present a simplified mathematical model that considers thermo-mechanical behaviour of the repositories and the corresponding in-house solver. this solver is analyzed as a parallel application with both MPI and OpenMP realizations. On the example of the two repositories and related demanding computations we develop a case study focused on practical comparison of those two paradigms of parallelprocessing.
there are several parallel programming models available for numerical computations at different levels of expressibility and ease of use. For the development of new domain specific programming models, a splitting into...
详细信息
ISBN:
(纸本)9783540681052
there are several parallel programming models available for numerical computations at different levels of expressibility and ease of use. For the development of new domain specific programming models, a splitting into a distributed data container and parallel data iterators is proposed. Data distribution is implemented in application specific libraries. Data iterators are directly analysed and compiled automatically into parallel code. Target architectures of the source-to-source translation include shared (pthreads, Cell SPE), distributed memory (MPI) and hybrid programming styles. A model applications for grid based hierarchical numerical methods and an auto-parallelizing compiler are introduced.
We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. this problem has application in several areas of combinatorial scientific computing. Since an exact algorithm ...
详细信息
ISBN:
(纸本)9783540681052
We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. this problem has application in several areas of combinatorial scientific computing. Since an exact algorithm for the weighted matching problem is both fairly expensive to compute and hard to parallelise we instead consider fast approximation algorithms. We analyse a distributed algorithm due to Hoepman [8] and show how this can be turned into a parallel algorithm. through experiments using both complete as well as sparse graphs we show that our new parallel algorithm scales well using up to 32 processors.
Sequence alignment is one of the most important techniques in Bioinformatics. Although efficient dynamic programming algorithms exist for this problem, the alignment of very long DNA sequences still requires significa...
详细信息
ISBN:
(纸本)9783540681052
Sequence alignment is one of the most important techniques in Bioinformatics. Although efficient dynamic programming algorithms exist for this problem, the alignment of very long DNA sequences still requires significant time on traditional computer architectures. In this paper, we present a scalable and efficient mapping of DNA sequence alignment onto the Cell BE multi-core architecture. Our mapping uses two types of parallelization techniques: (i) SIMD vectorization within a processor and (ii) wavefront parallelization between processors.
the paper describes an application of parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). Synchronous master-slave model with periodic so...
详细信息
ISBN:
(纸本)9783540681052
the paper describes an application of parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). Synchronous master-slave model with periodic solution update is being used. the paper contains description of the method, recommendations for optimal parameters settings and summary of results obtained during algorithm's evaluation. A comparison of our novel approach to a PGA metaheuristic proposed in the literature is given. Finally, directions for further work in the subject are suggested.
the concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. the representation is derived from a represent...
详细信息
ISBN:
(纸本)9783540681052
the concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. the representation is derived from a representation of permutations by iterative decomposition of symmetric permutation group S-n into cosets. New algorithms are proposed for generation of partial set derangements in t. the control sequences produced by the generation algorithms appear either in lexicographic or reverse lexicographic order while the output sequences representing partial derangements are obtained from the control sequences in corresponding linear orders. A parallel hardware implementation of the generator of partial derangements is described.
this paper presents a fast scheme for solving a time-domain electric field integral equation pertinent to the analysis of transient plane wave scattering from nonplanar doubly periodic structures. the proposed scheme ...
详细信息
this paper presents a fast scheme for solving a time-domain electric field integral equation pertinent to the analysis of transient plane wave scattering from nonplanar doubly periodic structures. the proposed scheme efficiently evaluates scattered fields from periodic structures by decomposing the sources that produce them into present and past components. the fields radiated by present sources are evaluated classically. In contrast, fields generated by past sources are expanded into time domain Floquet waves with modal amplitudes that are evolved in both space and time using a spectral time-stepping scheme complemented by Huygens' principle based boundary conditions. the kernel equations and efficient parallel evaluation associated withthe scattered fields generated by past sources are validated and effectiveness of the resulting algorithm are demonstrated by a number of examples.
暂无评论