检索结果-内蒙古大学图书馆

parallel implementations FOR SOLVING GENERALIZED EIGENVALUE PROBLEMS WITH SYMMETRICAL SPARSE MATRICES

APPLIED NUMERICAL MATHEMATICS 1993年第5期12卷 391-402页

作者： PHILIPPE, B VITAL, B IRISA Campus de Beaulieu 35042 Rennes Cedex France

We compare three algorithms to solve the sparse symmetric generalized eigenvalue problem on vector and parallel computers: reduction to a standard problem, use of Sturm sequences, and Lanczos method. An efficient vect... 详细信息

关键词： GENERALIZED EIGENVALUE PROBLEM BANDED MATRICES TRIDIAGONALIZATION STURM SEQUENCES LANCZOS METHOD parallel implementations

来源：评论

学校读者我要写书评

暂无评论

parallel implementations of the Ant Colony Optimization Metaheuristic 8th

Parallel Implementations of the Ant Colony Optimization Meta...

引用

8th Asian Conference on Intelligent Information and Database Systems (ACIIDS)

作者： Sieminski, Andrzej Wroclaw Univ Technol Fac Comp Sci & Management Wroclaw Poland

ISBN: (纸本)9783662493816;9783662493809

The paper discusses different approaches to parallel implementation of the Ant Colony Optimization metaheuristic. The metaheuristic is applied to the well-known Travelling Salesman Problem. Although the Ant Colony Optimization approach is capable of delivering good quality solutions for the TSP it suffers from two factors: complexity and non-determinism. Overpopulating ants makes the ACO performance more predictable but increasing the number of ants makes the need for parallel processing even more apparent. The proposed Ant Colony Community (ACC) uses a coarse grained approach to parallelization. Two implementations using RMI and Sockets respectively are compared. Results of an experiment prove the ACC is capable of a substantial reduction of processing time.

关键词： Ant colony optimization Travelling salesman problem parallel implementations RMI Sockets

来源：评论

学校读者我要写书评

暂无评论

Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations

引用

parallel COMPUTING 2002年第10期28卷 1477-1500页

作者： Ju, L Du, Q Gunzburger, M Iowa State Univ Sci & Technol Dept Math Ames IA 50011 USA Penn State Univ Dept Math University Pk PA 16802 USA

Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi cells. In this paper, some probabilistic methods for determining CVTs and their parallel implementations on distributed memory systems are presented. By using multi-sampling in a new probabilistic algorithm we introduce, more accurate and efficient approximations of CVTs are obtained without the need to explicit construct Voronoi diagrams. The new algorithm lends itself well to parallelization, i.e., near prefect linear speed up in the number of processors is achieved. The results of computational experiments performed on a CRAY T3E-600 system are provided which illustrate the superior sequential and parallel performance of the new algorithm when compared to existing algorithms. In particular, for the same amount of work, the new algorithms produce significantly more accurate CVTs. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： centroidal Voronoi tessellations probabilistic algorithms parallel implementations rejection method

来源：评论

学校读者我要写书评

暂无评论

ON THE parallel implementations OF THE LINEAR KALMAN AND LAINIOTIS FILTERS AND THEIR EFFICIENCY

引用

SIGNAL PROCESSING 1991年第3期25卷 289-305页

作者： KATSIKAS, SK LIKOTHANASSIS, SD LAINIOTIS, DG Technological Education Institute of Athens Department of Computer Science Ag. Spyridonas 12210 Egaleo Athens Greece University of the Aegean Department of Mathematics Karlovassi 83200 Samos Greece Technological Education Institute of Patras School of Applied Technology Koukouli Patras Greece University of Patras Department of Computer Engineering 26500 Patras Greece Florida Institute of Technology Department of Electrical and Computer Engineering Melbourne FL 32901-6988 USA INDECON Advanced Technology 9–11 Laodikias & Michalacopoulou St. Athens 11528 Greece

In this paper, the parallel implementations of two well-known linear state-space filtering algorithms, namely the Kalman and the Lainiotis filters, in MIMD machines are studied from a computational standpoint. The analysis assumes both time invariant and time varying system models and uses precedence graphs and critical paths. The parallelism efficiency of the implementations is also defined and studied. Results indicate that these algorithms can be implemented in parallel using a comparatively small number of processors. Furthermore, the efficiency of the parallel implementations can be very high or very low, depending on the state and measurement vector dimensions.

关键词： KALMAN FILTERS LAINIOTIS FILTERS parallel implementations

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of parallel RANSAC implementations in 3D Space

引用

INTERNATIONAL JOURNAL OF parallel PROGRAMMING 2015年第5期43卷 703-720页

作者： Hidalgo-Paniagua, Alejandro Vega-Rodriguez, Miguel A. Pavon, Nieves Ferruz, Joaquin Univ Extremadura Polytech Sch Dept Technol Comp & Commun Caceres Spain Univ Huelva Higher Tech Sch Engn Dept Informat Technol Huelva Spain Univ Seville Higher Tech Sch Engn Dept Syst Engn & Automat Seville Spain

RANSAC (RAndom SAmple Consensus) is an iterative method for estimating the parameters of a certain mathematical model from a set of data which may contain a large number of outliers (noisy points). The main problem of the RANSAC algorithm is that it is too expensive in terms of execution time when real-time processing is needed (30 fps). In view of the importance of this algorithm and the rise of parallelism-based technologies, we analyze and compare in this work various parallel implementations based on different techniques (OpenMP, POSIX Threads, and CUDA). To the best of our knowledge, no other articles have attempted a similar study. In order to make this first study, we have used some standard metrics in parallelism (Runtime and Speedup) and some specific metrics used in evaluating search strategies (Precision, Recall, and F-Score). Furthermore, the experiments have been executed in different hardware alternatives in order to present a more complete study. The conclusions of our study show the advantages and disadvantages of the different parallel implementations.

关键词： RANSAC parallel implementations Comparative study CUDA OpenMP POSIX Threads

来源：评论

学校读者我要写书评

暂无评论

parallel CBIR implementations with load balancing algorithms

引用

JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2006年第8期66卷 1062-1075页

作者： Bosque, Jose L. Robles, Oscar D. Pastor, Luis Rodriguez, Angel U Rey Juan Carlos Dpto Informat Estadist & Telemat Madrid 28933 Spain UPM Dept Tecnol Foton Boadilla Del Monte 28660 Spain

The purpose of content-based information retrieval (CBIR) systems is to retrieve, from real data stored in a database, information that is relevant to a query. When large volumes of data are considered, as it is very often the case with databases dealing with multimedia data, it may become necessary to look for parallel solutions in order to store and gain access to the available items in an efficient way. Among the range of parallel options available nowadays, clusters stand out as flexible and cost effective solutions, although the fact that they are composed of a number of independent machines makes it easy for them to become heterogeneous. This paper describes a heterogeneous cluster-oriented CBIR implementation. First, the cluster solution is analyzed without load balancing, and then, a new load balancing algorithm for this version of the CBIR system is presented. The load balancing algorithm described here is dynamic, distributed, global and highly scalable. Nodes are monitored through a load index which allows the estimation of their total amount of workload, as well as the global system state. Load balancing operations between pairs of nodes take place whenever a node finishes its job, resulting in a receptor-triggered scheme which minimizes the system's communication overhead. Globally, the CBIR cluster implementation together with the load balancing algorithm can cope effectively with varying degrees of heterogeneity within the cluster;the experiments presented within the paper show the validity of the overall strategy. Together, the CBIR implementation and the load balancing algorithm described in this paper span a new path for performant, cost effective CBIR systems which has not been explored before in the technical literature. (C) 2006 Elsevier Inc. All rights reserved.

关键词： parallel implementations CBIR systems load balancing algorithms

来源：评论

学校读者我要写书评

暂无评论

A comparative study of parallel software SURF implementations

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2014年第17期26卷 2758-2771页

作者： Hidalgo-Paniagua, Alejandro Vega-Rodriguez, Miguel A. Pavon, Nieves Ferruz, Joaquin Univ Extremadura Dept Technol Comp & Commun Polytech Sch Caceres Spain Univ Huelva Higher Tech Sch Engn Dept Informat Technol Huelva Spain Univ Seville Higher Tech Sch Engn Dept Syst Engn & Automat Seville Spain

Nowadays, it is common to find problems that require recognizing objects in an image, tracking them along time, or recognizing a complete real-world scene. One of the most known and used algorithms to solve these problems is the Speeded Up Robust Features (SURF) algorithm. SURF is a fast and robust local, scale and rotation invariant, features detector. This means that it can be used for detecting and describing a set of points of interest (keypoints) from an image. Because of the importance of this algorithm and the rise of the parallelism-based technologies, in the last years, diverse parallel implementations of SURF have been proposed. These parallel implementations are based on very different techniques: Compute Unified Device Architecture, OpenMp, OpenCL, and so on. In conclusion, we think valuable a comparative study of all of them highlighting the advantages and disadvantages of each parallel implementation. To our best knowledge, this article is the first attempt to do this comparative study. In order to make this study, we have used the standard metrics and image collection in this field, as well as other important metrics in parallelism as speedup and efficiency. Copyright (c) 2013 John Wiley & Sons, Ltd.

关键词： parallel implementations SURF comparative study CUDA OpenCL OpenMP OpenCV

来源：评论

学校读者我要写书评

暂无评论

FAST DIRECT SOLVERS FOR PIECEWISE HERMITE BICUBIC ORTHOGONAL SPLINE COLLOCATION EQUATIONS

引用

SIAM JOURNAL ON NUMERICAL ANALYSIS 1992年第1期29卷 156-173页

作者： BIALECKI, B FAIRWEATHER, G BENNETT, KR UNIV KENTUCKY DEPT MATHLEXINGTONKY 40506

Fast direct methods are proposed for the solution of linear systems arising when orthogonal spline collocation with piecewise Hermite bicubics is employed for the approximate solution of Poisson's equation in a rectangle. The new methods, which are matrix decomposition algorithms involving fast Fourier transforms, require O(N2 log N) arithmetric operations on an N x N uniform partition and are highly parallel in nature. The treatment of more general elliptic problems is also discussed and the results of numerical experiments using parallel implementations of the new algorithms on several shared memory machines are presented.

关键词： ORTHOGONAL SPLINE COLLOCATION PIECEWISE HERMITE BICUBICS GENERALIZED EIGENVALUE PROBLEM EIGENVALUES AND EIGENFUNCTIONS FAST DIRECT SOLVERS MATRIX DECOMPOSITION ALGORITHMS FAST FOURIER TRANSFORMS parallel implementations

来源：评论

学校读者我要写书评

暂无评论

A survey on parallel ant colony optimization

引用

APPLIED SOFT COMPUTING 2011年第8期11卷 5181-5197页

作者： Pedemonte, Martin Nesmachnow, Sergio Cancela, Hector Facultad de Ingeniería Universidad de la República Uruguay

Ant colony optimization (ACO) is a well-known swarm intelligence method, inspired in the social behavior of ant colonies for solving optimization problems. When facing large and complex problem instances, parallel computing techniques are usually applied to improve the efficiency, allowing ACO algorithms to achieve high quality results in reasonable execution times, even when tackling hard-to-solve optimization problems. This work introduces a new taxonomy for classifying software-based parallel ACO algorithms and also presents a systematic and comprehensive survey of the current state-of-the-art on parallel ACO implementations. Each parallel model reviewed is categorized in the new taxonomy proposed, and an insight on trends and perspectives in the field of parallel ACO implementations is provided. (C) 2011 Elsevier B. V. All rights reserved.

关键词： Ant colony optimization parallel implementations Taxonomy

来源：评论

学校读者我要写书评

暂无评论

GUD-Canny: a real-time GPU-based unsupervised and distributed Canny edge detector

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2022年第3期19卷 591-605页

作者： Fuentes-Alventosa, Antonio Gomez-Luna, Juan Medina-Carnicer, R. Univ Cordoba Dept Comp Sci & Numer Anal Cordoba Spain Swiss Fed Inst Technol Dept Informat Technol & Elect Engn Zurich Switzerland

The Canny algorithm is one of the most commonly used edge detectors due to its superior performance, especially in noisy environments. Its main limitation is that it is time consuming due to its multistage nature and the use of complex computational operations, primarily hysteresis thresholding. For this reason, many efficient implementations of the Canny edge detector have been developed on different accelerating platforms, such as ASICs, FPGAs and GPUs. The two main limitations of the GPU implementations developed to date are the bottleneck caused by the hysteresis process, and the use of fixed hysteresis thresholds. To overcome these issues, a novel GPU-based unsupervised and distributed Canny edge detector is proposed in this paper. Experimental evaluation showed that our Canny edge detector fully satisfies real time requirements, as it only requires 0.35 ms on average to detect edges on 512x512 images, and that it is faster than existing GPU and FPGA implementations.

关键词： Edge detection Canny edge detector GPU CUDA parallel implementations

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：