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

international symposium on parallel architectures, algorithms, and programming

作者： Jiang, Guiyuan Zhang, Guiyuan Zhang, Dakun School of Computer Science and Software Engineering Tianjin Polytechnic University Tianjin 300000 China

ISBN: (纸本)9780769543123

This paper deals with the issue of developing efficient algorithms for accelerating SIFT (Scale Invariant Feature Transform) features extraction under distributed environment. The proposed distributed dynamic parallel algorithm (DDP-SIFT) using a special data parallel approach that divides the Gauss Scale Space by octave aimed at acquiring large image blocks which is of great importance in some application. To make this approach effective, steps of building Gauss Scale Space are changed, and only the prerequisite part which is only 1/13 of the whole pyramid will be produced before tasks allocation, and Allocation Data Quantity (ADQ) is decreased by 13 times. Data blocks are assembled as tasks maintained in task lists, and dynamically allocated to Computing Nodes. A refined-blocking approach is proposed to further improve load balance. Our investigations show that the proposed algorithm has remarkable performance on accelerating SIFT features extraction while pursuing large data blocks. © 2010 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Program transformations and skeletons: Formal derivation of parallel programs 1

Program transformations and skeletons: Formal derivation of ...

引用

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

作者： Geerling, A. Max Computing Science Institute University of Nijmegen Toernooiveld 1 NijmegenNL-6525 ED Netherlands

ISBN: (纸本)081867038X

The paper describes-from a software engineering perspective-a framework for the formal development of parallel algorithms on arbitrary architectures. The algorithms are synthesised in a transformational way, i.e. by applying correctness preserving rewrite rules to a formal specification. The architectures are modelled by skeletons-higher order functions that represent elementary computations on a certain architecture. It is shown that the combination of transformational programming and skeletons stimulates the reuse of program derivations. Furthermore, interskeleton transformations will provide the means for architecture independent program development. © 1995 IEEE.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

programming METHODOLOGY AND PERFORMANCE ISSUES FOR ADVANCED COMPUTER architectures

引用

parallel COMPUTING 1988年第1-3期8卷 41-58页

作者： DONGARRA, JJ SORENSEN, DC CONNOLLY, K PATTERSON, J Mathematics and Computer Science Division Argonne National Laboratory Argonne IL 60439 U.S.A.

This paper will describe some recent attempts to construct transportable numerical software for high-performance computers. Restructuring algorithms in terms of simple linear algebra modules is reviewed. This technique has proved very succesful in obtaining a high level of transportability without severe loss of performance on a wide variety of both vector and parallel computers. The use of modules to encapsulate parallelism and reduce the ratio of data movement to floating-point operations has been demonstrably effective for regular problems such as those found in dense linear algebra. In other situations it may be necessary to express explicitly parallel algorithms. We also present a programming methodology that is useful for constructing new parallel algorithms which require sophisticated synchronization at a large grain level. We describe the SCHEDULE package which provides an environment for developing and analyzing explicitly parallel programs in FORTRAN which are portable. This package now includes a preprocessor to achieve complete portability of user level code and also a graphics post processor for performance analysis and debugging. We discuss details of porting both the SCHEDULE package and user code. Examples from linear algebra, and partial differential equations are used to illustrate the utility of this approach.

关键词： parallel programming portable parallel algorithms the package SCHEDULE

来源：评论

学校读者我要写书评

暂无评论

An Entertaining Approach to parallel programming Education 32

An Entertaining Approach to Parallel Programming Education

引用

32nd IEEE international parallel and Distributed Processing symposium (IPDPS)

作者： Buzek, Emanuel Krulis, Martin Charles Univ Prague Fac Math & Phys Parallel Architectures Applicat Algorithms Res Gr Prague Czech Republic

ISBN: (纸本)9781538655559

Despite the facts that multicore CPUs are present in virtually every personal computer or cell phone and distributed systems in the form of cloud services are steadily penetrating various domains of our lives, only a minority of programmers and computer science graduates are able to effectively design and develop parallel and distributed applications. Serial thinking is natural to all humans and it is also encouraged by many computer science curricula. Even though that leading educational institutions are attempting to rectify this trend by introducing parallel programming courses into their study programs, these courses are often dedicated for more experienced students in their fourth of fifth year since mastering modern parallel technologies like OpenMP or CUDA requires certain level of programming skills. It can be argued, that the parallel thinking should be taught much sooner, perhaps even before tertiary education. To this end, we have created an educational platform Parapple that aims to introduce parallelism and related problems like load balancing or synchronization to inexperienced programmers in an entertaining form. Our platform is web-based, so it can run in any modern browser on all operating systems without installation and the users are required to have only a very basic understanding of structural imperative programming.

关键词： parallel programming education simple visual web

来源：评论

学校读者我要写书评

暂无评论

Thread-level parallel algorithm for sorting integer sequence on multi-core computers

Thread-level parallel algorithm for sorting integer sequence...

引用

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

作者： Cheng, Zhong Qi, Ke Liu, Jun Huang, Yi-Ran School of Computer and Electronics and Information Guangxi University Nanning Guangxi 530004 China School of Information and Statistics Guangxi University for Finance and Economics Nanning Guangxi 530004 China

ISBN: (纸本)9780769545752

According to the characteristics of multi-core architectures and binary storage property of integer sequence, this paper proposes an efficient thread-level parallel algorithm for sorting integer sequence on multi-core computers. The algorithm divides the input integer sequence to several data blocks in main memory and distributes these blocks into the shared L2 cache and private L1 cache respectively, implements dynamically load balance among the processing cores, and utilizes data-level parallel SIMD instructions and thread-binding technique to speed up the sorting procedure. Experiment results show that the algorithm can obtain high speedup and good scalability, and its execution efficiency will not be affected by the data distribution of input integer sequence. © 2011 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Decentralized in-order execution of a sequential task-based code for shared-memory architectures 36

Decentralized in-order execution of a sequential task-based ...

引用

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

作者： Castes, Charly Agullo, Emmanuel Aumage, Olivier Saillard, Emmanuelle Inria LaBRI Bordeaux France Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781665497473

The hardware complexity of modern machines makes the design of adequate programming models crucial for jointly ensuring performance, portability, and productivity in high-performance computing (HPC). Sequential task-based programming models paired with advanced runtime systems allow the programmer to write a sequential algorithm independently of the hardware architecture in a productive and portable manner, and let a third party software layer -the runtime system- deal with the burden of scheduling a correct, parallel execution of that algorithm to ensure performance. Many HPC algorithms have successfully been implemented following this paradigm, as a testimony of its effectiveness. Developing algorithms that specifically require fine-grained tasks along this model is still considered prohibitive, however, due to per-task management overhead [1], forcing the programmer to resort to a less abstract, and hence more complex "task+X" model. We thus investigate the possibility to offer a tailored execution model, trading dynamic mapping for efficiency by using a decentralized, conservative in-order execution of the task flow, while preserving the benefits of relying on the sequential taskbased programming model. We propose a formal specification of the execution model as well as a prototype implementation, which we assess on a shared-memory multicore architecture with several synthetic workloads. The results show that under the condition of a proper task mapping supplied by the programmer, the pressure on the runtime system is significantly reduced and the execution of fine-grained task flows is much more efficient.

关键词： Runtime Computational modeling Software algorithms Computer architecture programming Hardware Software

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm of visualization of reservoir numerical simulation based on PEBI grids

Parallel algorithm of visualization of reservoir numerical s...

引用

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

作者： Dong, Lanfang Lu, Detang Li, Meng Vision Computing and Visualization Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei China Department of Modern Mechanics University of Science and Technology of China Hefei China

ISBN: (纸本)9780769545752

The speed of calculating, tracking and filling the isolines has a direct impact on the performance of user interaction. In this paper, we begin with the serial algorithm of visualization and implement its parallel algorithm. First, we divide the Delaunay grids generated from the PEBI grids into several regions. Calculation, tracking of isolines and calculation of saturation are implemented in each region respectively. Then the tracking results of each region are integrated for the entire work area. The parallel examples using OpenMP on computers with dual-core/quad-core are given at the end of this paper. The experimental results show that the parallel processing can greatly reduce the time required for data processing in visualization. © 2011 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

algorithms FOR parallel MEMORY ALLOCATION

引用

international JOURNAL OF parallel programming 1988年第4期17卷 303-345页

作者： ELLIS, CS OLSON, TJ DUKE UNIV DEPT COMP SCIDURHAMNC 27706 UNIV ROCHESTER DEPT COMP SCIROCHESTERNY 14627

Dynamic storage allocation is a vital component of programming systems intended for multiprocessor architectures that support globally shared memory. Highly parallel algorithms for access to system data structures lie at the core of effective memory allocation strategies as well as solutions to other parallel systems problems. In this paper, we investigate four algorithms, all based on the first fit approach, that provide different granularities of parallel access to the allocator's data structures. These solutions employ a variety of design techniques including specialized locking protocols, the use of atomic fetch-and-Ф operations, and structural modifications. We describe experiments designed to compare the performance of these schemes. The results show that simple algorithms are appropriate when the expected number of concurrent requests per memory is low and the request pattern is not bursty. algorithms that support finer granularity access while avoiding locking protocols are successful in a range of larger processor/memory ratios.

关键词： Concurrent data structures first fit memory allocation parallel algorithms shared memory multiprocessing

来源：评论

学校读者我要写书评

暂无评论

Pervasive parallel Computing - An Historic Opportunity for Innovation in programming and Architecture 07

Pervasive Parallel Computing - An Historic Opportunity for I...

引用

ACM SIGPLAN symposium on Principles and Practice of parallel programming

作者： Chien, Andrew A. Intel Corp Res Santa Clara CA 95051 USA

ISBN: (纸本)9781595936028

parallel programming has been the subject of deep research for decades - and renowned in the software community as a difficult challenge to the degree that many companies have teams of parallelism and concurrency experts. Further, many ISV's explicitly design their software architectures so as to ensure that the majority of the development effort, including of course debug and test, can be done without consideration of parallelism. What makes parallelism so difficult, are the knotty and coupled problems of correctness, performance - particularly data locality, and software modularity. In Terascale (manycore) chip-level multiprocessors, we are facing a pervasive and critical parallel programming challenge. Core counts on a single chip are expected to increase rapidly, progressing with Moore's law, and quad-core systems are already available today in mainstream volume client and server platforms. To continue the rapid performance scaling to which we have become accustomed, applications will need to exhibit ample parallelism (and increasing amounts of it) for Successive generations of hardware. Further, because the move to Multiple-core parallelism as the primary basis for performance improvement is pervasive, this requirement falls on a wide range of applications including traditional large-scale commercial and HPC server, desktop, laptop, and even those running on small mobile devices. That breadth has numerous implications for the types of solutions that are required. We will discuss some of the requirements for Terascale parallel programming solutions, and point Out several potentially fruitful directions. A number of these solutions will build on mainstream programming approaches (objects, modularity, imperative), particularly introducing parallelism with modest disruption to both large-scale and local-scale program structure. However, there is an opportunity for radically different approaches to take hold in the mainstream (e.g. functional). On the hardware front

关键词： algorithms Performance Languages

来源：评论

学校读者我要写书评

暂无评论

Constructing limited Voronoi mesh in parallel based on multi-core environment and its implementation

Constructing limited Voronoi mesh in parallel based on multi...

引用

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

作者： Dong, Lanfang Wu, Yuan Li, Meng Vision Computing and Visualization Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9780769545752

Voronoi mesh as the basic primitive in the field of computational geometry has been widely applied on solving fluid-related problem by finite volume method. By analyzing various limited conditions for reasonable point distributions and modifying parallel data structure (doubly-connected list) for complex boundaries features in Voronoi mesh generation, considering the rapid development of multi-core processors and high performance computing, we present an efficient and feasible parallel algorithm of limited Voronoi mesh generation in standalone multi-core CPU environment. The algorithm solves the practical application of Voronoi mesh generation of large-scale points set;the experiment results show that this method improved the efficiency of the algorithm and could be widely used in various applications. © 2011 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：