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

A massively parallel particle-in-cell code for the simulation of field-emitter based electron sources

NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT 2006年第1期558卷 154-158页

作者： Candel, AE Dehler, MM Troyer, M ETH CH-8093 Zurich Switzerland Paul Scherrer Inst Villigen Switzerland

For the realistic simulation of electron sources using field emitter arrays, the sub-micron resolution required for the emitters leads to simulation models not suitable for current serial codes. Thus, a parallel high-performance 3D Particle-In-Cell code, called Capone, has been implemented in C+ + using the POOMA II framework on the Linux platform. Sophisticated C+ + expression templates techniques deliver Fortran performance combined with high-level programming and development comfort. For the computation of external fields, matching parallel field solvers are in development with the electrostatic one being completed. The Maxwell field solver is based on the Finite Integration Algorithm on a non-uniform rectilinear grid. Anisotropic epsilon and mu constants and perfect electric/magnetic materials stored in triangulated grid cells are supported as well as open, electric and magnetic boundary conditions. Self-consistent macro-particle pushing is accomplished by integrating the classical relativistic equations of motion in combination with charge-conserving current scattering onto the computational grid. parallelization is performed by partitioning the calculation domain into patches associated to individual processors. Fields are statically distributed while Particles are concurrently distributed to processors according to their position to allow fast local interpolation. (c) 2005 Elsevier B.V. All rights reserved.

关键词： electromagnetism charged-particle beam free-electron lasers computer simulation Maxwell self-consistent particle dynamics particle-in-cell time-domain parallel computing C plus

来源：评论

学校读者我要写书评

暂无评论

A generic formulation of neural nets as a model of parallel and self-programming computation

引用

4th International Work-conference on Artificial Neural Networks (IWANN 97)

作者： Mira, J Herrero, JC Delgado, AE Univ Nacl Educ Distancia Dpto Inteligencia Artificial Madrid Spain

ISBN: (纸本)3540630473

In the same way the more conventional fields of computer science need some theory, including the mathematical foundations of the calculus and the establishment of formal models, neural computation also needs its own. The basic requirements of this model are modularity, "small grain", high connectivity, parametric local computation and some capacity of self-programming by means of the adjustment of these parameters. We present here a proposal in this line that allows the integration in a single frame of all current models (analogic, logic and inferential) and makes clear the natural way to bridge the symbolic and connectionistic perspectives of AI extending the model of local computation to hierarchic graphs, building networks by joining graphs and studying the set of operators we need for modifying local computation parameters values.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

A model of objects and communication for massively parallel programming

A model of objects and communication for massively parallel ...

引用

International Symposium on parallel Processing

作者： M.F. Kilian Center for Research in Computing Technology Harvard University Cambridge MA USA

For serial computation, the object-oriented methodology (O-O) has been shown to aid program modeling increase reusability, and result in more robust programs. Because of its object-centricity, O-O seems well suited to data parallel models of massively parallel programming. Many of the benefits of O-O stem from the arbitrary combining of objects, and the resulting arbitrary message passing patterns. Unfortunately, when working with tens of thousands of processors in parallel, this arbitrariness can result in communication conflicts. The paper proposes a model of objects and communication that resolves this problem.< >

关键词： parallel programming Object oriented modeling Message passing Object oriented programming Robustness Broadcasting Computers Libraries Filling

来源：评论

学校读者我要写书评

暂无评论

11th International conference on parallel Processing and Applied Mathematics, PPAM 2015

11th International Conference on Parallel Processing and App...

引用

11th International conference on parallel Processing and Applied Mathematics, PPAM 2015

ISBN: (纸本)9783319321486

The proceedings contain 56 papers. The special focus in this conference is on parallel Architectures and Resilience, Numerical Algorithms and parallel Scientific Computing. The topics include: Exploring memory error vulnerability for parallel programming models;an approach for ensuring reliable functioning of a supercomputer based on a formal model;sparse matrix multiplication on dataflow engines;energy efficient calculations of text similarity measure on FPGA-accelerated computing platforms;a bucket sort algorithm for the particle-in-cell method on manycore architectures;experience on vectorizing lattice boltzmann kernels for multi- and many-core architectures;performance analysis of the Kahan-enhanced scalar product on current multicore processors;performance analysis of the Chebyshev basis conjugate gradient method on the K computer;dense symmetric indefinite factorization on GPU accelerated architectures;a parallel multi-threaded solver for symmetric positive definite bordered-band linear systems;parallel algorithm for quasi-band matrix-matrix multiplication;comparative performance analysis of coarse solvers for algebraic multigrid on multicore and manycore architectures;LU preconditioning for overdetermined sparse least squares problems;experimental optimization of parallel 3D overlapping domain decomposition schemes;massively parallel approach to sensitivity analysis on HPC architectures by using scalarm platform;GPU implementation of Krylov solvers for block-tridiagonal eigenvalue problems;comparison of large graphs using distance information;fast incremental community detection on dynamic graphs;a diffusion process for graph partitioning;a parallel algorithm for LZW decompression, with GPU implementation;parallel FDFM approach for computing GCDs using the FPGA and parallel induction of nondeterministic finite automata.

关键词：

来源：评论

学校读者我要写书评

暂无评论

massively parallel programming models Used as Hardware Description Languages: The OpenCL Case

Massively Parallel Programming Models Used as Hardware Descr...

引用

IEEE/ACM International conference on Computer-Aided Design (ICCAD)

作者： Owaida, Muhsen Bellas, Nikolaos Antonopoulos, Christos D. Daloukas, Konstantis Antoniadis, Charalambos Univ Thessaly Dept Comp & Commun Engn Volos Greece

ISBN: (纸本)9781457713989

The problem of automatically generating hardware modules from high level application representations has been at the forefront of EDA research during the last few years. In this paper, we introduce a methodology to automatically synthesize hardware accelerators from OpenCL applications. OpenCL is a recent industry supported standard for writing programs that execute on multicore platforms and accelerators such as GPUs. Our methodology maps OpenCL kernels into hardware accelerators, based on architectural templates that explicitly decouple computation from memory communication whenever this is possible. The templates can be tuned to provide a wide repertoire of accelerators that meet user performance requirements and FPGA device characteristics. Furthermore, a set of high-and low-level compiler optimizations is applied to generate optimized accelerators. Our experimental evaluation shows that the generated accelerators are tuned efficiently to match the applications memory access pattern and computational complexity, and to achieve user performance requirements. An important objective of our tool is to expand the FPGA development user base to software engineers, thereby expanding the scope of FPGAs beyond the realm of hardware design.

关键词： OpenCL FPGA Electronic Design Automation Reconfigurable Computing Embedded Systems

来源：评论

学校读者我要写书评

暂无评论

Research on Control Mechanism of FAST Nodes Based on Goal programming

Research on Control Mechanism of FAST Nodes Based on Goal Pr...

引用

IEEE International conference on Electrical Engineering, Big Data and Algorithms (EEBDA)

作者： Zhang, Lipeng Changsha Univ Sci & Technol Changsha Peoples R China

ISBN: (纸本)9781665416061

As one of the three major innovations of FAST, the active reflective surface is composed of main components such as the main cable net, reflective panel, pull-down cable, actuator and supporting structure. Its essence is to adjust the reflecting surface in the illumination range to the designated parabolic position in real time according to the position of the observed celestial body, so that the parallel electromagnetic waves emitted by the celestial body will always converge at one point after being reflected by the reflecting surface. Aiming at the problem that the Chinese FAST sky eye reflector panel automatically adjusts the overall shape to the working paraboloid to achieve the best electromagnetic wave reflection effect under the condition of different positions of the measured celestial body, a single target optimization, target planning, single reflector panel and other models have been constructed. With the ideal parabola and actuator adjustment scheme, the reception ratio after adjustment is increased by 5 times. According to the adjustment strategy of the reflective panel obtained by the research, the nodes with a node displacement greater than 0.5m account for 0.14%, and the performance is good.

关键词： FAST single objective optimization variable step size search method objective programming

来源：评论

学校读者我要写书评

暂无评论

A short overview of executing Λ Chemical Reactions over the ΣC and τC Dataflow programming models

A short overview of executing Λ Chemical Reactions over the...

引用

15th Annual International conference on Computational Science, ICCS 2015

作者： Cudennec, Loïc Goubier, Thierry CEA LIST Gif-sur-Yvette91191 France

Many-core processors offer top computational power while keeping the energy consumption reasonable compared to complex processors. Today they enter both high-performance computing systems, as well as embedded systems. However, these processors require dedicated programming models to efficiently benefit from their massively parallel architectures. The chemical programming paradigm has been introduced in the late eighties as an elegant way of formally describing distributed programs. Data are seen as molecules that can freely react thanks to operators to create new data. This paradigm has also been used within the context of grid computing and now seems to be relevant for many-core processors. Very few implementations of runtimes for chemical programming have been proposed, none of them giving serious elements on how it can be deployed onto a real architecture. In this paper, we propose to implement some parts of the chemical paradigm over the ΣC dataflow programming language, that is dedicated to many-core processors. We show how to represent molecules using agents and communication links, and to iteratively build the dataflow graph following the chemical reactions. A preliminary implementation of the chemical reaction mechanisms is provided using the τC dataflow compilation toolchain, a language close to ΣC, in order to demonstrate the relevance of the proposition. © The Authors. Published by Elsevier B.V.

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

Compiler-Directed Performance Model Construction for parallel Programs

Compiler-Directed Performance Model Construction for Paralle...

引用

23rd International conference on Architecture of Computing Systems (ARCS 2010)

作者： Schindewolf, Martin Kramer, David Cintra, Marcelo KIT Inst Comp Sci & Engn Haid Und Neu Str 7 D-76131 Karlsruhe Germany Univ Edinburgh Sch Informat 10 Crichton St Edinburgh EH8 9AB Edinburgh Midlothian Scotland

ISBN: (纸本)9783642119491

During the last decade, performance prediction for industrial and scientific workloads on massively parallel high-performance computing systems has been and still is an active research area. Due to the complexity of applications, the approach to deriving an analytical performance model from current workloads becomes increasingly challenging: automatically generated models often suffer from inaccurate performance prediction;manually constructed analytical models show better prediction, but are very labor-intensive. Our approach aims at closing the gap between compiler-supported automatic model construction and the manual analytical modeling of workloads. Commonly, performance-counter values are used to validate the model, so that prediction errors can be determined and quantified. Instead of manually instrumenting the executable for accessing performance counters, we modified the GCC compiler to insert calls to run-time system functions. Added compiler options enable the user to control the instrumentation process. Subsequently, the instrumentation focuses on frequently executed code parts. Similar to established frameworks, a run-time system is used to track the application behavior: traces are generated at run-time, enabling the construction of architecture independent models (using quadratic programming) and, thus, the prediction of larger workloads. In this paper, we introduce our framework and demonstrate its applicability to benchmarks as well as real world numerical workloads. The experiments reveal an average error rate of 9% for the prediction of larger workloads.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A truly concurrent semantics for a simple parallel programming language 13th

引用

8th Annual conference of the European-Association-for-Computer-Science-Logic (EACSL)/13th International Workshop on Computer Science Logic (CSL 99)

作者： Gastin, P Mislove, M Univ Paris 07 LIAFA F-75251 Paris 05 France Tulane Univ Dept Math New Orleans LA 70118 USA

ISBN: (纸本)3540665366

This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, paxallelism and choice. We present a simple programming language which includes (weakly) sequential composition, asynchronous and synchronous parallel composition, a restriction operator, and that supports recursion. We develop an operational and a denotational semantics for this language, and we obtain a theorem relating the behavior of a process as described by the transition system to the meaning of the process in the denotational model. This implies that the denotational model is adequate with respect to the operational model. Our denotational model is based on the resource traces of Gastin and Teodesiu, and since a single resource trace represents all possible executions of a concurrent process, we axe able to model each term of our concurrent language by a single trace. Therefore we obtain a deterministic semantics for our language and we axe able to model parallelism without introducing nondeterminism.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

programming rich interactions using the hierarchical state machine toolkit 06

Programming rich interactions using the hierarchical state m...

引用

AVI '06 - working conference on Advanced Visual Interfaces 2006

作者： Blanch, Renaud Beaudouin-Lafon, Michel LRI and INRIA Futurs Université Paris-Sud F-91405 Orsay Cedex France

ISBN: (纸本)1595933530

Structured graphics models such as Scalable Vector Graphics (SVG) enable designers to create visually rich graphics for user interfaces. Unfortunately current programming tools make it difficult to implement advanced interaction techniques for these interfaces. This paper presents the Hierarchical State Machine Toolkit (HsmTk), a toolkit targeting the development of rich interactions. The key aspect of the toolkit is to consider interactions as firstclass objects and to specify them with hierarchical state machines. This approach makes the resulting behaviors self-contained, easy to reuse and easy to modify. Interactions can be attached to graphical elements without knowing their detailed structure, supporting the parallel refinement of the graphics and the interaction. Copyright 2006 ACM.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：