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

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Zhang, Jing Wu, Gongqing Hu, Xuegang Li, Shiying Hao, Shuilong School of Computer Science and Information Engineering Hefei University of Technology Hefei 230009 China

ISBN: (纸本)9780769545752

Clustering is one of the most popular methods for data analysis, which is prevalent in many disciplines such as image segmentation, bioinformatics, pattern recognition and statistics etc. The most popular and simplest clustering algorithm is K-means because of its easy implementation, simplicity, efficiency and empirical success. However, the real-world applications produce huge volumes of data, thus, how to efficiently handle of these data in an important mining task has been a challenging and significant issue. In addition, MPI (Message Passing Interface) as a programming model of message passing presents high performances, scalability and portability. Motivated by this, a parallel K-means clustering algorithm with MPI, called MKmeans, is proposed in this paper. The algorithm enables applying the clustering algorithm effectively in the parallel environment. Experimental study demonstrates that MKmeans is relatively stable and portable, and it performs with low overhead of time on large volumes of data sets. © 2011 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A parallel computing procedure for the lower and upper bounds on the functionals of solutions to PDE: Application to the J-integral in functionally graded materials

A parallel computing procedure for the lower and upper bound...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Xuan, Z.C. Department of Computer Science Tianjin University of Technology and Education Tianjin 300222 China

ISBN: (纸本)9780769545752

A parallel computing procedure for computing the bounds on the J-integral in functionally graded materials is presented based on a Neumann element a-posteriori error bound. The finite element solution of J-integral is first obtained on a coarser finite element mesh, then a-posteriori bounding procedure based on the finite element error estimate is used to compute the lower and upper bounds on the J-integral. The computation of the error estimate is performed by solving independent elemental Neumann subproblems decomposed from the finite element model, thus the computing procedure is parallel and potential to solve large scale structural problems. An example is given in the end of paper to compute the lower and upper bounds on the J-integral of functionally graded materials. © 2011 IEEE.

关键词： Functionally graded materials

来源：评论

学校读者我要写书评

暂无评论

High-performance Fortran and possible extensions to support conjugate gradient algorithms

High-performance Fortran and possible extensions to support ...

引用

5th IEEE international symposium on High Performance Distributed Computing

作者： Dincer, K Fox, GC Hawick, K SYRACUSE UNIV SCH COMP & INFORMAT SCINE PARALLEL ARCHITECTURES CTRSYRACUSENY 13244

ISBN: (纸本)0818675829

We evaluate the High Performance Fortran (HPF) language for the compact expression and efficient implementation of conjugate gradient iterative matrix-solvers on High-Performance Computing and Communications(HPCC) platforms. We discuss the use of intrinsic functions, data distribution directives and explicitly parallel constructs to optimize performance by minimizing communications requirements in a portable manner. We focus on implementations using the existing HPF definitions but also discuss issues arising that may influence a revised definition for HPF-2. Some of the codes discussed are available on the World Wide Web at http://***/hpfa/, along-with other educational and discussion material related to applications in HPF.

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Simulations of Wireless Signal Wave Propagation 22

Efficient Parallel Simulations of Wireless Signal Wave Propa...

引用

22nd international symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Ionita, Dorin-Marian Manole, Filip-George Slusanschi, Emil-Ioan Univ Politehn Bucuresti Comp Sci Dept Bucharest Romania

ISBN: (纸本)9781728176284

A common pattern in high performance scientific computing is the structured grid pattern in which one or more elements of a matrix are computed as a stencil operation of other matrix neighbouring elements. Since there are multiple options to efficiently implement this pattern on modern computing architectures, we provide a comparison of the performance of a number of parallel implementations on a multi-core system with GPU capabilities and also on a FPGA embedded inside a SoC. The application used for this case study implements the propagation of wireless signals in a bi-dimensional environment, considering reflections and signal attenuation. The parallel programming paradigms examined in this paper include CUDA, TBB, Rust, OpenMP, and HLS as hardware description paradigm, with CUDA proving to be the fastest implementation.

关键词： numerical simulation PDE structured grid CUDA TBB OpenMP Rust GP-GPU FPGA HLS wave propagation

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 1st Aizu international symposium on parallel algorithms/Architecture Synthesis, AISPAS 1995

Proceedings - 1st Aizu International Symposium on Parallel A...

引用

1st Aizu international symposium on parallel algorithms/Architecture Synthesis, AISPAS 1995

ISBN: (纸本)081867038X

The proceedings contain 42 papers. The topics discussed include: improvement of duplication scheduling heuristic algorithm with nonstrict triggering of program graph nodes;cohesion : an efficient distributed shared memory system supporting multiple memory consistency models;supercompilers for massively parallel architectures;investigation of some hardware accelerators for relational algebra operations;implementing higher-order gamma on MasPar: a case study;a framework for visual parallel programming;parallelizing a PDE solver: experiences with PISCES-MP;efficient scalable mesh algorithms for merging, sorting and selection;and constructing parallel implement at ions with algebraic programming tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CUDA Grid-Level Task Progression algorithms 17

CUDA Grid-Level Task Progression Algorithms

引用

2015 IEEE 17th international Conference on High Performance Computing and Communications (HPCC)

作者： Kartsaklis, Christos Joubert, Wayne Hernandez, Oscar R. Eisenbach, Markus Elwasif, Wael R. Bernholdt, David E. Oak Ridge Natl Lab Oak Ridge TN 37831 USA

ISBN: (纸本)9781479989379

Tasking is a prominent parallel programming model. In this paper we conduct a first study into the feasibility of task-parallel execution at the CUDA grid, rather than the stream/kernel level, for regular, fixed in-out dependency task graphs, similar to those found in wavefront computational patterns, making the findings broadly applicable. We propose and evaluate three CUDA task progression algorithms, where threadblocks cooperatively process the task graph, and argue about their performance in terms of tasking throughput, atomics and memory IO overheads. Our initial results demonstrate a throughput of 38 million tasks/second on a Kepler K20X architecture.

关键词： parallel architectures parallel programming CUDA grid-level task progression algorithm CUDA task progression algorithm Kepler K20X architecture parallel programming model wavefront computational pattern Computational modeling Graphics processing units Instruction sets Kernel parallel processing Radiation detectors Runtime

来源：评论

学校读者我要写书评

暂无评论

On the Feasibility of a Distributed Runtime for the Chemical programming Model

On the Feasibility of a Distributed Runtime for the Chemical...

引用

26th IEEE international parallel and Distributed Processing symposium (IPDPS)

作者： Obrovac, Marko Tedeschi, Cedric Univ Rennes 1 INRIA IRISA F-35014 Rennes France

ISBN: (纸本)9780769546766

Chemical computing was initially proposed as an intuitive paradigm to capture the essence of parallel computing. Within such a model, a program is a solution of information-carrying molecules, that, at run time, collide non-deterministically to produce new data. Such a paradigm allowed the programmers to focus on the logic of the problem to be solved in parallel, without having to worry about implementation's considerations. Throughout the years, the model has been enriched with various features related to program structure, control and practicability. More importantly, the model was raised to the higher order, increasing again its expressiveness. With the rise of service-oriented computing, such models have recently regained a lot of interest. They have been shown to provide adequate abstractions to enhance service-oriented architectures with autonomic properties such as self-adaptation, self-healing, or self-organisation. However, the deployment of chemical programs over large scale distributed platforms is still a widely open problem, hindering the model to be leveraged in practice. This paper studies the possibility of building a distributed execution environment for chemical programs. A generic peer-to-peer-based runtime model and distributed algorithms for large scale chemical computing are discussed. To complete this study, a software prototype was developed and experimented over the Grid'5000 test-bed. Experimental performance results are detailed, allowing for a discussion of the feasibility and performance of such a runtime, thus lifting a barrier towards the enactment of the chemical programming model.

关键词： Runtime Software prototyping chemical compounds Service-oriented architecture distributed algorithms Computer personnel programming parallel PROCESSING (COMPUTERS) Worry Distribute Essences Formal logic

来源：评论

学校读者我要写书评

暂无评论

Bit-parallel approximate pattern matching: Kepler GPU versus Xeon Phi

引用

parallel COMPUTING 2016年 54卷 128-138页

作者： Tuan Tu Tran Liu, Yongchao Schmidt, Bertil Johannes Gutenberg Univ Mainz Inst Informat D-55128 Mainz Germany Georgia Inst Technol Sch Computat Sci & Engn Atlanta GA 30332 USA

Approximate pattern matching (APM) targets to find the occurrences of a pattern inside a subject text allowing a limited number of errors. It has been widely used in many application areas such as bioinformatics and information retrieval. Bit-parallel APM takes advantage of the intrinsic parallelism of bitwise operations inside a machine word. This approach typically encodes non-deterministic finite automaton (NFA) states or value differences between adjacent cells of a dynamic programming matrix in the form of bit arrays. Wu-Manber (WM) is a well-known bit-parallel APM algorithm, which simulates an NFA and gains parallel efficiency by performing multiple state updates within a machine word. An important parameter is the machine word size (e.g. 32 or 64 bits for CPUs). Due to increasing vector capabilities, efficient mapping of bit-parallel APM algorithms onto modern high performance computing architectures is an interesting research topic. Prominent examples are Xeon Phi coprocessors and CUDA-enabled GPUs, which provide words of size 512 bits (by means of vector registers) and 1024 bits (by means of warps), respectively. In this paper, we investigate mappings of the WM algorithm onto these two accelerator types. Both architectures are able to achieve around two orders-of-magnitude speedups compared to a single-threaded CPU implementation. Moreover, our tile-based implementation on a GeForce Titan graphics card runs up to 2.9 x faster than our implementation on an Intel Xeon Phi 5110P. Source code is available at http://***. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Bit-parallel Approximate pattern matching Wu-Manber algorithm CUDA GPU Xeon Phi

来源：评论

学校读者我要写书评

暂无评论

Cover model: a framework for design and execution of distributed applications 3

Cover model: a framework for design and execution of distrib...

引用

3rd international symposium on parallel architectures, algorithms, and Networks (I-Span 97)

作者： Ivannikov, VP Dyshlevoi, KV Kamensky, VE Klimov, AV Manzheley, SG Omelchenko, VA Solovskaya, LB Vinokurov, AA Russian Acad Sci Inst Syst Programming Moscow Russia

ISBN: (纸本)0818682596

Many problems of distributed object-oriented applications can be uniformly resolved in the frame of approach based on the concept of cover. The cover is defined as an environment that transparently controls all aspects of object's community life: creation, interaction etc. To enable transparency, an object-oriented application must obey a principle of late binding, a reference to server object being obtained by the client at run time from a system environment. To implement cove services, the technique of metaobject control is applied, which provides extensions of program's semantics without changing the program code, by means of attaching additional method calls to each application object invocation. A special language (TL) in which the user can incrementally define new metaservices is described and illustrated by numerous examples.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

PCAR: parallelism based cache replacement scheme to exploit inter-disks parallelism and intra-disk spatial locality in parallel disk array

PCAR: Parallelism based cache replacement scheme to exploit ...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Shi, Xiaodong Feng, Dan Computer College Huazhong University of Science and Technology Wuhan Hubei 430074 China Wuhan National Laboratory for Optoelectronics Wuhan Hubei 430074 China

ISBN: (纸本)9780769545752

For parallel disk array systems, the parallelism among disks is the key factor influencing the performance and the scale of systems. Unfortunately, the parallelism of cached blocks is largely ignored by cache management schemes that focus on reducing the number of cache misses. Therefore, the performance of parallel disks array systems for workloads with a skew access pattern can be seriously degraded. To solve this problem, we propose a parallelism based Cache Replacement scheme (PCAR) for parallel disks array systems, which can exploit both of the inter-disks parallelism and the intra-disk spatial locality. We have implemented the prototype of PCAR algorithm in Linux 2.6.18. And, the experimental results show that PCAR outperforms DULO and LRU by up to 22.8% and 33.1% in terms of the average response time, and by up to 20% and 43.9% in terms of throughput. © 2011 IEEE.

关键词： Computer operating systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：