We presents two heterogeneous processing (HP) problem representations that are 1) a program representation called a "Meta Graph" and 2) a targeted HP hardware configuration representation called an "Arc...
详细信息
A parallel implementation of proteomic ovarian cancer diagnosis system based on logical analysis of data is shown. the implementation is based on computational cluster elaborated in System Engineering Group at Silesia...
详细信息
ISBN:
(纸本)3540341412
A parallel implementation of proteomic ovarian cancer diagnosis system based on logical analysis of data is shown. the implementation is based on computational cluster elaborated in System Engineering Group at Silesian University of Technology. For verification of algorithm and software Ovarian Dataset 8-7-02 (which can be found at http://***) was used. this mass spectrometry data contains intensity levels of 15 154 peptides defined by their mass/charge ratios (m/z) in serum of 162 ovarian cancer and 91 control cases. A Seti-like and OpenMosix with PVM cluster technology was used to construct in LAD a fully reproducible models (1) using full range and (2) using only 700-12000 of m/z values of peptides and proved in multiple cross-validation leave-one-out tests to guarantee sensitivities and specificities of up to 100%.
Tone injection (TI) is an effective technique to overcome high PAPR (peak-to-average power ratio) of OFDM. the PAPR reduction problem solved with TI is a combinatorial problem. Although the effectiveness of GA has bee...
详细信息
ISBN:
(纸本)9781479959556
Tone injection (TI) is an effective technique to overcome high PAPR (peak-to-average power ratio) of OFDM. the PAPR reduction problem solved with TI is a combinatorial problem. Although the effectiveness of GA has been demonstrated for this problem, GA involves relative complex operators. this implies that, when implementing the methods of TI on digital circuits, other methods may outperform GA under the same processing time. In this paper, we investigate effective parallel search methods for the PAPR reduction, which are of simple structure for implementing digital circuits. At first, as the basis of the parallel methods, we propose two types of stochastic search methods. the one is Flip-Probability-specified type (FP) search and the other is a specified-Number-of-Flips type (NF) search. Both of them use only simple stochastic operators. then, we propose an effective digital circuit implementation of the solution evaluation function. Finally, we propose a parallel search method based on FP and NF search. the simulation results show that, the proposed parallel search methods can improve not only the processing speed but also the quality of the solution.
Large data and information processing requires high processing power that usually involve supercomputers which are costly. MapReduce parallel framework introduces an automated way of distributing these large processes...
详细信息
ISBN:
(纸本)9781467308946;9788994364261
Large data and information processing requires high processing power that usually involve supercomputers which are costly. MapReduce parallel framework introduces an automated way of distributing these large processes to many computers. this paper proposes to conduct preliminary studies on scalability using MapReduce as an automated parallelprocessing running on low-cost off-the-shelf hardware. the system architecture is built with collections of off-the-shelf hardware. the scalability test will be conducted by adding an off-the-shelf hardware one at a time to the architecture. MapReduce tool is used as a parallel framework to automatically distribute tasks according to available resources. Performance will be evaluated based on improvement in speedup. It is found that MapReduce is able to accommodate scalability of off-the-shelf hardware resources by automatically distributing tasks regardless of the number of hardware being added to the architecture.
the present paper deals withthe parallelization of an explicit time stepping algorithm in a general finite element environment. Particular attention has been paid to nonlocal constitutive models. A central difference...
详细信息
the present paper deals withthe parallelization of an explicit time stepping algorithm in a general finite element environment. Particular attention has been paid to nonlocal constitutive models. A central difference method has been used to discretize the governing equations in time. Modifications of both node-cut and element-cut strategies have been developed to provide an efficient support for nonlocal constitutive models. Efficiency of the proposed approach is demonstrated on different hardware platforms. (C) 2001 Civil-Comp Ltd. and Elsevier Science Ltd. All rights reserved.
Withthe high requirements of gene sequencing in the field of scientific research, it is essential to make faster sequencing process. the one of the main sequencing operation is done using Smith Waterman algorithm. th...
详细信息
ISBN:
(纸本)9781941763346
Withthe high requirements of gene sequencing in the field of scientific research, it is essential to make faster sequencing process. the one of the main sequencing operation is done using Smith Waterman algorithm. this algorithm is used in two conventional ways to evaluate the matrix elements. they are i. Sequential processes ii. Conventional parallel processes. Sincethe work is to consider these both of these approaches and evolve a new so that these there are three main objectives are met a) Should take less time for the computation of the matrix elements b) optimize the processor used. Even though later one conventional parallel (O(2m)) is faster than the former one sequential processing O(2mn), this work tried an attempt for reducing the timing still further, with a challenge to reduce to an extent of O(m) by introducing cross diagonal element wise parallelprocessing approach. Also as a part of the work processor optimization of the processor for the conventional parallel and the cross diagonal element wise parallel approach is completed with a satisfactory result. the Cross Diagonal Element Wise parallelprocessing Approach (CDEWPPA) performs better than the conventional parallel approach for the query execution time test as well as for the speed up ratio.
As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architec...
详细信息
ISBN:
(纸本)9783540681052
As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectural features on these new processors. Fine grain parallelism becomes a major requirement and introduces the necessity of loose synchronization in the parallel execution of an operation. this paper presents an algorithm for the QR factorization where the operations can be represented as a sequence of small tasks that operate on square blocks of data. these tasks can be dynamically scheduled for execution based on the dependencies among them and on the availability of computational resources. Compared to the standard approach, say with LAPACK, may result in an out of order execution of the tasks which will completely hide the presence of intrinsically sequential tasks in the factorization. Performance comparisons are presented withthe LAPACK algorithm for QR factorization where parallelism can only be exploited at the level of the BLAS operations.
A novel architecture of the precoding is proposed for pre-distortion based transmitters. To reduce the circuit complexity, we introduce a parallel prefix network based a DQPSK precoder, a flip-flop based look up table...
详细信息
ISBN:
(纸本)9784885522307
A novel architecture of the precoding is proposed for pre-distortion based transmitters. To reduce the circuit complexity, we introduce a parallel prefix network based a DQPSK precoder, a flip-flop based look up table, and a coordinate transformation for a dual drive Mach-Zehnder modulator.
this paper presents a new family of 3D thinning algorithms for extracting skeleton-like shape features (i.e, centerline, medial surface, and topological kernel) from volumetric images. A 2-subfield strategy is applied...
详细信息
ISBN:
(纸本)9780889868236
this paper presents a new family of 3D thinning algorithms for extracting skeleton-like shape features (i.e, centerline, medial surface, and topological kernel) from volumetric images. A 2-subfield strategy is applied: all points in a 3D picture are partitioned into two subsets which are alternatively activated. At each iteration, a parallel operator is applied for deleting some border points in the active subfield. the proposed algorithms are derived from Ma's sufficient conditions for topology preservation, and they use various endpoint characterizations.
this paper proposes a novel method using Vedic mathematics for calculating the square of binary numbers. An improved Vedic multiplier architecture is used in the binary squaring circuit. the circuit is further improve...
详细信息
暂无评论