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

Efficient parallel algorithms for numerical simulation

FUTURE GENERATION COMPUTER SYSTEMS 2001年第8期17卷 961-967页

作者： Lecomber, D Rudgyard, M Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Trinity Coll Oxford OX1 3BH England

COUPL+ is a programming environment for applications using unstructured and hybrid grids for numerical simulations. It automates parallelization by handling the partitioning of data and dependent data and maintaining halo interfaces and copy coherency. We explore some algorithms behind this package. A multi-level partitioning method is described which is effective in the presence of skewed data, solving the multi-set median-finding problem. Partitioning elements over a set of pre-partitioned nodes is explored and a novel method is suggested for reducing communication in the resulting distribution. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： numerical simulations parallel algorithms multi-set median-finding problem

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for ranking of trees 2

Parallel algorithms for ranking of trees

引用

2nd IEEE Symposium on parallel and Distributed Processing, SPDP 1990

作者： Liang, Y. Dhall, S.K. Lakshmivarahan, S. Parallel Processing Institute School of Electrical Engmeerin and Computer Science University of Oklahoma NormanOK73019 United States

ISBN: (纸本)0818620870

Ranking a tree is defined as a mapping rho of the nodes to the set (1, 2,...) such that if there is a path from u to v and rho (u)= rho (v) then there is a node w on the path from u to v such that rho (w)> rho (u). The highest number assigned to the node is called the rank number of the mapping. A mapping rho with the smallest rank number is called optimal ranking. The best known serial algorithm takes O(n) time for the optimal node ranking. However, the problem of finding the optimal tree ranking appears to be highly sequential. It remains open whether it is in NC. The paper proposes a fast parallel algorithm for finding approximate optimal node ranking of trees using O(logn) steps with n2 processors on a CRCW PRAM and an efficient parallel algorithm using O(log2n) steps with n processors on a EREW model. © 1990 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for the orthogonal multiprocessor 30

Parallel algorithms for the orthogonal multiprocessor

引用

30th Annual Southeast Regional Conference, ACM-SE 1992

作者： Elsayed, Khaled M. F. Department of Computer Science North Carolina State University RaleighNC27695-8207 United States

ISBN: (纸本)0897915062

The orthogonal multiprocessor is a partially shared memory architecture. The architecture exhibits attractive characteristics specially with regards to the simplicity of the interconnection network. This architecture proves to be a powerful platform for a large class of scientific problems. A large set of algorithms have been mapped into this architecture including matrix multiplication, fast Fourier transform, sorting, and partial differential equations. The major contribution of this paper is the mapping of two popular algorithms into the orthogonal multiprocessor architecture. The first algorithm is the Jacobi method for evaluating eigenvalues of a symmetric matrix. The second algorithm is image component labeling based on image shrinking operation. Also a discussion of areas of further study for the orthogonal multiprocessor is included. © 1992 ACM.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for the creation of medical database 2

Parallel algorithms for the creation of medical database

引用

2nd International Scientific Conference on Metrological Support of Innovative Technologies, ICMSIT II-2021

作者： Rakhimov, Bakhtiyar S. Mekhmanov, Mukhiddin S. Bekchanov, Bakhtiyar G. Urgench Branch of Tashkent Medical Academy Urgench Uzbekistan

Analysis of parallel algorithms for graphics processors allows you to determine the bottlenecks of the algorithm that affect its performance on a particular computing system. algorithms can be analyzed both at the AGM level and at the level of the CPU-GPU system. Despite the fact that the model does not reflect the overlap of the execution of computational operations and operations of access to the global memory, but estimates the upper limit of the execution time of the algorithm on the AGM, in any parallel algorithms for the AGM it is necessary to reduce this parameter of the algorithm due to the large number of clock cycles spent by the multiprocessor to implement global memory access operations. © Published under licence by IOP Publishing Ltd.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for treewidth two 23rd

引用

23rd International Workshop on Graph-Theoretic Concepts in Computer Science WG 1997

作者： de Fluiter, Babette Bodtaender, Hans L. Centre for Quantitative Methods P.O. Box 414 Eindhoven5600 AK Netherlands Department of Computer Science Utrecht University P.O. Box 80.089 Utrecht3508 TB Netherlands

ISBN: (纸本)3540637575

In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, constructs a tree decomposition or path decomposition of minimum width of G. The algorithm uses O(n) operations and O(log n log* n) time on an EREW PRAM, or O(log n) time on a CRCW PRAM. The algorithm makes use of the resemblance between series-parallel graphs and partial two-trees. It is a (non-trivial) extension of the parallel algorithm for series-parallel graphs that is presented in [6]. © Springer-Verlag Berlin Heidelberg 1997.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for classification and clustering

Parallel algorithms for classification and clustering

引用

Advanced algorithms and Architectures for Signal Processing II 1987

作者： Cybenko, George Allen, Thomas G. Department of Computer Science Tufts University MedfordMA02155 United States Alphatech Inc. 111 Middlesex Turnpike BurlingtonMA01803 United States

parallel algorithms for high level signal processing functions common to tracking and data fusion are presented and studied. The algorithms are general techniques for clustering, partitioning and ermumeration and are applicable in a variety of situations. parallel algorithms were implemented on a hypercube parallel computer and performance data is presented. © 1988 SPIE. All rights reserved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for partitioning sorted sets and related problems 4th

Parallel algorithms for partitioning sorted sets and related...

引用

4th European Symposium on algorithms, ESA 1996

作者： Chen, Danny Z. Chent, Wei Wada, Koichi Kawaguchi, Kimio Department of Computer Science and Engineering University of Notre Dame Notre DameLN46556 United States Department of Electrical and Computer Engineering Nagoya Institute of Technology ShowaNagoya466 Japan

ISBN: (纸本)3540616802

We consider the following partition problem: Given a set S of n elements that is organized as k sorted subsets of size n/k each and given a parameter h with 1/k ≤ h ≤ n/k, partition S into g = O(n/(hk)) subsets D1,D2,…..,Dg of size Θ(hk) each, such that for any two indices i and j with 1 ≤ i ≤ j ≤ g, no element in Di is bigger than any element in Dj. Note that with various combinations of the values of parameters h and k, several fundamental problems, such as merging, sorting, and finding an approximate median, can be formulated as or be redamed to this partition problem. The partition problem also finds applications in solving problems of parallel computing and computational geometry. In this paper, we present efficient parallel algorithms for solving the partition problem and its applications. Our parallel partition algorithm runs in O(log n) time using O(Formula Presented) processors in the EREW PRAM model. Iogn The complexity bounds of our parallel partition algorithm on the respective special cases match those of the optimal EREW PRAM algorithms for meting, sorting, and finding an approximate median. Using our parallel partition algorithm, we are also able to obtain better complexity bounds {even po6sibly on a weaker parallel model) than the previously best known parallel algorithms for several important problems, including parallel multi-selection, parallel multi-ranking, and parallel sorting of k sorted subsets. © Springer-Verlag Berlin Heidelberg 1996.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for asymmetric read-write costs 16

Parallel algorithms for asymmetric read-write costs

引用

28th ACM Symposium on parallelism in algorithms and Architectures, SPAA 2016

作者： Ben-David, Naama Blelloch, Guy E. Fineman, Jeremy T. Gibbons, Phillip B. Gu, Yan McGuffey, Charles Shun, Julian Carnegie Mellon University United States Georgetown University United States UC Berkeley United States

ISBN: (纸本)9781450342100

Motivated by the significantly higher cost of writing than reading in emerging memory technologies, we consider parallel algorithm design under such asymmetric read-write costs, with the goal of reducing the number of writes while preserving work-efficiency and low span. We present a nested-parallel model of computation that combines (i) small per-task stack-allocated memories with symmetric read-write costs and (ii) an unbounded heap-allocated shared memory with asymmetric read-write costs, and show how the costs in the model map efficiently onto a more concrete machine model under a work-stealing scheduler. We use the new model to design reduced-write, work-efficient, low-span parallel algorithms for a number of fundamental problems such as reduce, list contraction, tree contraction, breadth-first search, ordered filter, and planar convex hull. For the latter two problems, our algorithms are output-sensitive in that the work and number of writes decrease with the output size. We also present a reduced-write, low-span minimum spanning tree algorithm that is nearly work-efficient (off by the inverse Ackermann function). Our algorithms reveal several interesting techniques for significantly reducing shared memory writes in parallel algorithms without asymptotically increasing the number of shared memory reads. © 2016 ACM.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for grounded range search and applications

Parallel algorithms for grounded range search and applicatio...

引用

5th International Conference on parallel Processing, Euro-Par 1999

作者： Lamoureux, Michael G. Rau-Chaplin, Andrew Faculty of Computer Science Dalhousie University P.O. Box 1000 Halifax B3J 2X4 Canada

ISBN: (纸本)3540664432

This paper presents a parallel algorithm for solving grounded range search in associative-function mode using the BSP-like Coarse Grained Multicomputer (CGM). Given a set S of n weighted points in the plane, the algorithm requires O(1) communication rounds (h-relations with h = O(n/p)), O((n/p) log n) local computation, and O(n/p) memory per processor (n/p ≥ p), to solve m = O(n) grounded range search problems. The result implies new or improved solutions to a number of other geometric applications including d-dimensional range search, quadrant search, interval intersection, and chromatic range queries. © Springer-Verlag Berlin Heidelberg 1999.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for shortest paths and related problems on trapezoid graphs 10th

Parallel algorithms for shortest paths and related problems ...

引用

10th Annual International Symposium on algorithms and Computation, ISAAC 1999

作者： Hsu, F.R. Lin, Yaw-Ling Tsai, Yin-Te Providence University Shalu Taichung Hsien433 Taiwan National Science Council Taiwan Department of Accounting Taiwan Department of Computer Science and Information Management Taiwan

ISBN: (纸本)3540669167

In this paper, we consider parallel algorithms for shortest paths and related problems on trapezoid graphs under the CREW PRAM model. Given a trapezoid graph with its corresponding trapezoid diagram, we present parallel algorithms solving the following problems: For the single-source shortest path problem, the algorithm runs in O(log n) time using O(n) processors and space. For the all-pair shortest path query problem, after spending O(log n) preprocessing time using O(n log n) space and O(n) processors, the algorithm can answer the query in O(log 5) time using one processor. Here 5 denotes the distance between two queried vertices. For the minimum cardinality Steiner set problem, the algorithm runs in O(log n) time using O(n) processors and space. We also extend our results to the generalized trapezoid graphs. The single-source shortest path problem and the minimum cardinality Steiner set problem on d-trapezoid graphs and circular d-trapezoid graphs can both be solved in O(log n log d) time using O(nd) space and O(d2n/ log d) processors. The all-pair shortest path query problem on d-trapezoid graphs and circular d-trapezoid graphs can be answered in O(d log 5) time using one processor after spending O(log n log d) preprocessing time using O(nd log n) space and O(d2n/ log d) processors. © Springer-Verlag Berlin Heidelberg 1999.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：