MapReduce has become a dominant parallel computing paradigm for storing and processing massive data due to its excellent scalability, reliability, and elasticity. in this paper, we present a new architecture of Distri...
详细信息
ISBN:
(纸本)9781467387095
MapReduce has become a dominant parallel computing paradigm for storing and processing massive data due to its excellent scalability, reliability, and elasticity. in this paper, we present a new architecture of distributed Beta Wavelet Networks {DBWN} for large image classification in MapReduce model. First to prove the performance of wavelet networks, a parallelized learning algorithm based on the Beta Wavelet Transform is proposed. T hen the proposed structure of the {DBWN} is itemized. However the new algorithm is realized in MapReduce model. Comparisons with Fast Beta Wavelet Network {FBWN} are presented and discussed. Results of comparison have shown that the {DBWN} model performs better than {FBWN} model in classification rate and in the context of training run time.
A tristate approach (TA) for image denoising processing is presented;the noise is aimed at the presence of pepper-and-salt noise. The newness of this method is that it develops a new route in the field of image restor...
详细信息
High efficiency in parallel adaptive integration is difficult to achieve. Dependencies between integration regions are dynamic and therefore dynamic region redistribution is necessary. In our approach, we employ a con...
详细信息
ISBN:
(纸本)9780769530895
High efficiency in parallel adaptive integration is difficult to achieve. Dependencies between integration regions are dynamic and therefore dynamic region redistribution is necessary. In our approach, we employ a control infrastructure designed to support parallel application global state monitoring. It includes monitors (called synchronizers), which observe application global states and take control decisions based on predicates computed on global states. Region redistribution strategy Is implemented inside the monitors. The most and least loaded processes are selected and ordered to level their loads by region exchange. The paper shows that this strategy can work well, underlining some important factors, which influence the performance. Two methods' which aim at eliminating excessive region transfers, are presented. It is also shown, that good parallel efficiency can be obtained easier if interprocessor network supports efficient transmissions of large data packets. The problem of finding an optimal communication frequency between computing processes has been much reduced - it is enough if processes report their local load reasonably often.
In this article, a hardware and software co-design method for the Intelligent Transport Systems (ITS) imageprocessing system is proposed. The objective of this method is to optimize the division offitnctions between ...
ISBN:
(纸本)0769505716
In this article, a hardware and software co-design method for the Intelligent Transport Systems (ITS) imageprocessing system is proposed. The objective of this method is to optimize the division offitnctions between hardware and software by, the optimum tradeoff: Under this method, first, the targeted overall system is modeled by software, and then functions and structures are adjusted. The performance of each function of software and hardware in the model is evaluated by simulation, and the optimized division offitnctions between hardware and software is obtained. Each functionally divided process of hardware and software is re-designed and fine-tuned and then operations are verified by the co-design test board in order to quickly design and construct a system which satisfies the design objectives. The ITS imageprocessing development area is chosen as an application example for this,method and its effectiveness is verified by evaluating the construction of a safe driving support system.
A new concept of working out computer means, with the architecture controlled by the parameters of the images (CPI) is being suggested. The methods and processor structures of image parameters determination are presen...
详细信息
We investigate the problem of partitioning finite difference meshes in two dimensions among the processors of a parallel computer. The objective is to achieve a perfect load balance while minimizing the communication ...
详细信息
ISBN:
(纸本)9781479927289
We investigate the problem of partitioning finite difference meshes in two dimensions among the processors of a parallel computer. The objective is to achieve a perfect load balance while minimizing the communication cost. There are well-known graph, hypergraph, and geometry-based partitioning algorithms for this problem. The known geometric algorithms have linear running time and obtain the best results for very special mesh sizes and processor numbers. We propose another geometric algorithm. The proposed algorithm is linear;is applicable to much more cases than some well-known alternatives;obtains better results than the graph partitioning algorithms;obtains better results than the hypergraph partitioning algorithms almost always. Our algorithm also obtains better results than a known asymptotically-optimal algorithm for some small number of processors. We also catalog related theoretical results.
The most important information in transforming a 2D image into a 3D image is the depth of each pixel in the image. However, a normal 2D image usually does not contain such information, which makes the transformation i...
详细信息
ISBN:
(纸本)9780769545769
The most important information in transforming a 2D image into a 3D image is the depth of each pixel in the image. However, a normal 2D image usually does not contain such information, which makes the transformation impossible. On the other hand, for certain types of pictures, such as personal portraits, it is possible to infer crude depth information from their known contexts and properties. Unfortunately, depth map generation is very involving and, if executed on a mobile phone, will consume a lot of energy. This is undesirable, particularly when the mobile device is running out of battery. The application must be aware of the energy status of the system, make appropriate tradeoffs, and then adapt accordingly. This paper presents such an energy-aware, 2D-to-3D image transformation tool for personal portraits on mobile phones. The tool will choose a suitable depth-map generation algorithm based on the remaining energy of the device. We will discuss how to make the tradeoffs and evaluate the idea on real machines.
This paper describes a software implementation of a fast distributed scatterer search algorithm for the problem of displacement velocity calculation based on the Apache Spark platform. A complete scheme for calculatin...
详细信息
This paper describes a software implementation of a fast distributed scatterer search algorithm for the problem of displacement velocity calculation based on the Apache Spark platform. A complete scheme for calculating displacement velocities by the persistent scatterer method is considered. The proposed algorithm is integrated into the scheme after the stage of subpixel-accuracy alignment of a stack of time-series images. The search for distributed scatterers is carried out independently in shift windows over the entire area of the image. The presence of distributed scatterers is determined based on the assumption that pairs of samples in the window, which are composed of vectors of complex pixel values in each of the N images, are homogeneous. This assumption stems from the fulfillment of the Kolmogorov-Smirnov criterion for each pair. Toestimate phases of homeogenic pixels, the maximization problem is solved. It is shown that the proposed algorithm is not iterative and can be implemented in the framework of the parallel computing paradigm. Toenable distributed in-memory processing of radar data arrays (from 60 images) across many physical nodes in a network environment, we use the Apache Spark parallelprocessing platform. In this case, the time it takes to find distributed scatterers is reduced by a factor of 10 on average as compared to a single-processor implementation of the algorithm. The comparative results of testing the computing system on a demo cluster are presented. The algorithm is implemented in Python with a detailed description of the objects and methods of the algorithm.
The trend towards computers with multiple processing units keeps going with no end in sight. Modern consumer computers come with 2 - 6 processing units. Programming methods have been unable to keep up with this fast d...
详细信息
ISBN:
(纸本)9780819491299
The trend towards computers with multiple processing units keeps going with no end in sight. Modern consumer computers come with 2 - 6 processing units. Programming methods have been unable to keep up with this fast development. In this paper we present a framework that uses a dataflow model for parallelprocessing: the Generic parallel Rapid Development Toolkit, GePaRDT. This intuitive programming model eases the concurrent usage of many processing units without specialized knowledge about parallel programming methods and it's pitfalls.
parallelization of operations is of utmost importance for efficient implementation of Public Key Cryptography algorithms. Starting with a classification of parallelization methods at different abstraction levels of pu...
详细信息
parallelization of operations is of utmost importance for efficient implementation of Public Key Cryptography algorithms. Starting with a classification of parallelization methods at different abstraction levels of public key algorithms, we propose a novel memory architecture for elliptic curve implementations with multiple modular multiplier units. This architecture is well-suited for different point addition and doubling algorithms over GF(p) to be implemented on FPGAs. It allows the execution time to scale with the number of modular multipliers and exhibits nearly no overhead compared to the mere runtime of the multipliers. The advantages of this distributed memory architecture are demonstrated by means of two different point addition and doubling algorithms.
暂无评论