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

Selected Recent Applications of Sparse Grids

Numerical Mathematics(Theory,Methods and Applications) 2015年第1期8卷 47-77页

作者： Benjamin Peherstorfer Christoph Kowitz Dirk Pfluger Hans-Joachim Bungartz Scientific Computing Group Dept.of Computer ScienceBoltzmannstr.385748 GarchingGermany Institutefor Advanced Study Technische UniversitätMünchenLichtenbergstr.2a85748 GarchingGermany Institute for Parallel and Distributed Systems University of StuttgartUni-versitätsstr.3870569 StuttgartGermany

Sparse grids have become a versatile tool for a vast range of applications reaching from interpolation and numerical quadrature to data-driven problems and uncertainty *** review four selected real-world applications of sparse grids:financial product pricing with the Black-Scholes model,interactive explo-ration of simulation data with sparse-grid-based surrogate models,analysis of simu-lation data through sparse grid data mining methods,and stability investigations of plasma turbulence simulations.

关键词： Sparse grids hierarchical decomposition adaptivity combination technique

来源：评论

学校读者我要写书评

暂无评论

HPC-Coder: Modeling Parallel Programs using Large Language Models 39

HPC-Coder: Modeling Parallel Programs using Large Language M...

引用

39th International Conference on High Performance computing, ISC High Performance 2024

作者： Nichols, Daniel Marathe, Aniruddha Menon, Harshitha Gamblin, Todd Bhatele, Abhinav Department of Computer Science University of Maryland College ParkMD United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA United States Livermore Computing Lawrence Livermore National Laboratory LivermoreCA United States

ISBN: (纸本)9783982633602

Parallel programs in high performance computing (HPC) continue to grow in complexity and scale in the exascale era. The diversity in hardware and parallel programming models make developing, optimizing, and maintaining parallel software even more burdensome for developers. One way to alleviate some of these burdens is with automated development and analysis tools. Such tools can perform complex and/or remedial tasks for developers that increase their productivity and decrease the chance for error. Until recently, such tools for code development and performance analysis have been limited in the complexity of tasks they can perform, especially for parallel programs. However, with recent advancements in language modeling, and the availability of large amounts of open-source code related data, these tools have started to utilize predictive language models to automate more complex tasks. In this paper, we show how large language models (LLMs) can be applied to tasks specific to high performance and scientific codes. We introduce a new dataset of HPC and scientific codes and use it to fine-tune several pre-trained models. We compare several pre-trained LLMs on HPC-related tasks and introduce a new model, HPC-Coder, fine-tuned on parallel codes. In our experiments, we show that this model can auto-complete HPC functions where generic models cannot, decorate for loops with OpenMP pragmas, and model performance changes in scientific application repositories as well as programming competition solutions. © 2024 Research Paper Proceedings of the ISC High Performance 2024. All rights reserved.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

On combining computational differentiation and toolkits for parallel scientific computing 6

引用

6th International European Conference on Parallel computing, Euro-Par 2000

作者： Bischof, Christian H. Martin Bücker, H. Hovland, Paul D. Institute for Scientific Computing Aachen University of Technology Aachen52056 Germany Mathematics and Computer Science Division Argonne National Laboratory 9700 South Cass Ave ArgonneIL60439 United States

ISBN: (纸本)9783540679561

Automatic differentiation is a powerful technique for evaluating derivatives of functions given in the form of a high-level programming language such as Fortran, C, or C++. The program is treated as a potentially very long sequence of elementary statements to which the chain rule of differential calculus is applied over and over again. Combining automatic differentiation and the organizational structure of toolkits for parallel scientific computing provides a mechanism for evaluating derivatives by exploiting mathematical insight on a higher level. In these toolkits, algorithmic structures such as BLAS-like operations, linear and nonlinear solvers, or integrators for ordinary differential equations can be identified by their standardized interfaces and recognized as high-level mathematical objects rather than as a sequence of elementary statements. In this note, the differentiation of a linear solver with respect to some parameter vector is taken as an example. Mathematical insight is used to reformulate this problem into the solution of multiple linear systems that share the same coefficient matrix but differ in their right-hand sides. The experiments reported here use ADIC, a tool for the automatic differentiation of C programs, and PETSc, an object-oriented toolkit for the parallel solution of scientific problems modeled by partial differential equations. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Differentiation (calculus)

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm for optimization of spatial trusses considering self-weight loads 4

A genetic algorithm for optimization of spatial trusses cons...

引用

4th International Conference on Engineering Optimization, ENGOPT 2014

作者： Lemonge, A.C.C. Hallak, P.H. Fonseca, L.G. Barbosa, H.J.C. Department of Applied and Computational Mechanics Federal University of Juiz de Fora Brazil Department of Computer Science Federal University of Juiz de Fora Brazil LNCC - National Laboratory for Scientific Computing Brazil

ISBN: (纸本)9781138027251

In this paper a genetic algorithm is proposed to solve the weight minimization problem of domes, made up of standard modules considering configuration and sizing design variables. Previous work done by the authors [1] did not consider the geometrically nonlinear behavior of the domes which is included in this paper as well as loads due to the self-weight of the structures during the optimization process. They are important aspects, not to be neglected in this kind of structure. The domes are assembled from standard modules composed by ten members that are grouped into seven distinct profiles. In addition, cardinality constraints are introduced to define alternative member groupings of the standard modules. This type of evolution of the whole structural configuration is an attractive feature because it allows the designer to automate the search for the global configuration of the dome, finding the best number of standard modules simultaneously with the shape and sizing design variables for these modules. Several experiments are performed using a 120-bar dome as test-bed. © 2015 Taylor & Francis Group, London.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Provenance management in Swift

Provenance management in Swift

引用

作者： Gadelha Jr., Luiz M.R. Clifford, Ben Mattoso, Marta Wilde, Michael Foster, Ian Computer and Systems Engineering Program Federal University of Rio de Janeiro Brazil National Laboratory for Scientific Computing Brazil Computation Institute University of Chicago United States Mathematics and Computer Science Division Argonne National Laboratory United States

The Swift parallel scripting language allows for the specification, execution and analysis of large-scale computations in parallel and distributed environments. It incorporates a data model for recording and querying provenance information. In this article we describe these capabilities and evaluate the interoperability with other systems through the use of the Open Provenance Model. We describe Swift's provenance data model and compare it to the Open Provenance Model. We also describe and evaluate activities performed within the Third Provenance Challenge, which consisted of implementing a specific scientific workflow, capturing and recording provenance information of its execution, performing provenance queries, and exchanging provenance information with other systems. Finally, we propose improvements to both the Open Provenance Model and Swift's provenance system. © 2011 Elsevier B.V. All rights reserved.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Hydraulic Simulation of Water Supply Networks under Control

Hydraulic Simulation of Water Supply Networks under Control

引用

2005 World Water and Environmental Resources Congress

作者： Deuerlein, J. Cembrowicz, R.G. Dempe, S. Kaiserstr. 12 D-76131 Karlsruhe Institute for Scientific Computing and Optimization Department of Mathematics and Computer Science Technical University Bergakademie Freiberg Leipziger Str. 28 D-09596 Freiberg

ISBN: (纸本)0784407924

The objectives of simulating the hydraulic behavior of a water supply network, being either real or planned, focus upon identifying flow, pressure and velocities, following time variant system's operation or the propagation of water quality in the network, supporting leak detection, verifying the hydraulic impact of different system's elements, guiding gauging and calibration. Existing simulation models represented by available software show different capacities regarding control devices, including pressure control valves, pressure sustaining valves, flow control valves, check valves, speed regulated pumps - operated combined and simultaneously where convergence may not be obtained. Since a rigorous mathematical approach is lacking the system's behavior is presently treated heuristically without guarantee of success. Consequently a new mathematical approach has been derived and is presented here. First, the hydraulic simulation is conceived as optimization of the system's 'Content' and 'Co-Content' functions. Second, regarding flow control devices, Convex Analysis is utilized to allow a generalization of the hydraulic equations of system's elements in the form of subdifferential mappings leading to Kuhn-Tucker conditions, amenable to solution. Third, regarding pressure control devices, the definition of a Nash Equilibrium, according to Game Theory, between the 'Co-Content' and additional minimizing problems, describing the system behavior of the devices, also leads to a solution. Hence, arbitrary flow and pressure controlling devices can now be incorporated in water supply network simulation. Convergence is assured if the system's physics are feasible. The approach has been implemented as part of the water supply network simulation & optimization model KANET. Copyright ASCE 2005.

关键词： Water supply systems

来源：评论

学校读者我要写书评

暂无评论

Virtual machine provisioning, code management, and data movement design for the Fermilab HEPCloud Facility 22

Virtual machine provisioning, code management, and data move...

引用

22nd International Conference on computing in High Energy and Nuclear Physics, CHEP 2016

作者： Timm, S. Cooper, G. Fuess, S. Garzoglio, G. Holzman, B. Kennedy, R. Grassano, D. Tiradani, A. Krishnamurthy, R. Vinayagam, S. Raicu, I. Wu, H. Ren, S. Noh, S.-Y. Scientific Computing Division Fermilab BataviaIL60563 United States Computer Science Dept. Illinois Institute of Technology ChicagoIL60616 United States Korea Institute of Science and Technology Information Daejeon Korea Republic of

The Fermilab HEPCloud Facility Project has as its goal to extend the current Fermilab facility interface to provide transparent access to disparate resources including commercial and community clouds, grid federations, and HPC centers. This facility enables experiments to perform the full spectrum of computing tasks, including data-intensive simulation and reconstruction. We have evaluated the use of the commercial cloud to provide elasticity to respond to peaks of demand without overprovisioning local resources. Full scale data-intensive workflows have been successfully completed on Amazon Web Services for two High Energy Physics Experiments, CMS and NOνA, at the scale of 58000 simultaneous cores. This paper describes the significant improvements that were made to the virtual machine provisioning system, code caching system, and data movement system to accomplish this work. The virtual image provisioning and contextualization service was extended to multiple AWS regions, and to support experiment-specific data configurations. A prototype Decision Engine was written to determine the optimal availability zone and instance type to run on, minimizing cost and job interruptions. We have deployed a scalable on-demand caching service to deliver code and database information to jobs running on the commercial cloud. It uses the frontiersquid server and CERN VM File System (CVMFS) clients on EC2 instances and utilizes various services provided by AWS to build the infrastructure (stack). We discuss the architecture and load testing benchmarks on the squid servers. We also describe various approaches that were evaluated to transport experimental data to and from the cloud, and the optimal solutions that were used for the bulk of the data transport. Finally, we summarize lessons learned from this scale test, and our future plans to expand and improve the Fermilab HEP Cloud Facility. © Published under licence by IOP Publishing Ltd.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Techniques for specifying bug patterns

Techniques for specifying bug patterns

引用

2007 ACM International Symposium on Software Testing and Analysis, ISSTA'07 and PADTAD-V Workshop

作者： Quinlan, Daniel J. Vuduc, Richard W. Misherghi, Ghassan Center for Applied Scientific Computing Lawrence Livermore National Laboratory 7000 East Avenue Livermore CA United States Department of Computer Science University of California Davis Davis CA United States

ISBN: (纸本)159593748X

We present our on-going work to develop techniques for specifying source code signatures of bug patterns. Specifically, we discuss two approaches. The first approach directly analyzes a program in the intermediate representation (IR) of the ROSE compiler infrastructure using ROSE's API. The second analyzes the program using the bddbddb system of Lam, Whaley, et al.. In this approach, we store the IR produced by ROSE as a relational database, express patterns as declarative inference rules on relations in the language Datalog, and bddbddb implements the Datalog programs using binary decision diagram (BDD) techniques. Both approaches readily apply to large-scale applications, since ROSE provides full type analysis, control flow, and other available analysis information. In this paper, we primarily consider bug patterns expressed with respect to the structure of the source code or the control flow, or both. More complex techniques to specify patterns that are functions of data flow properties may be addressed by either of the above approaches, but are not directly treated here. Our Datalog-based work includes explicit support for expressing patterns on the use of the Message Passing Interface (MPI) in parallel distributed memory programs. We show examples of this on-going work as well. Copyright 2007 ACM.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

How to Steal CPU Idle Time When Synchronous I/O Mode Becomes Promising 24

How to Steal CPU Idle Time When Synchronous I/O Mode Becomes...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Wu, Chun-Feng Chang, Yuan-Hao Yang, Ming-Chang Kuo, Tei-Wei Department of Computer Science National Yang Ming Chiao Tung University Taiwan Institue of Information Science Academia Sinica Taiwan Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Department of Computer Science and Information Engineering National Taiwan University Taiwan High Performance and Scientific Computing Center National Taiwan University Taiwan Delta Electronics Taiwan

ISBN: (纸本)9798400706011

The advent of Ultra-Low-Latency storage devices has narrowed the performance gap between storage and CPU in computing platforms, facilitating synchronous I/O adoption. Yet, this approach introduces substantial busy waiting time and underutilizes computing units. To address this, we propose a light-weighted Idle-Time-Stealing (ITS) design. This involves a self-improving thread conducting prefetching for high-priority processes during synchronous I/O, and an I/O-waiting process continuing subsequent instruction executions when justifiable. Another thread, the self-sacrificing thread, proactively switches low-priority process I/O requests from synchronous to asynchronous mode, prioritizing high-priority executions. Experimental results demonstrate the effectiveness of our ITS design in reducing CPU idle time. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

Weighted locality-sensitive scheduling for mitigating noise on multi-core clusters

Weighted locality-sensitive scheduling for mitigating noise ...

引用

18th International Conference on High Performance computing, HiPC 2011

作者： Kale, Vivek Bhatele, Abhinav Gropp, William D. Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL 61801 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 United States

ISBN: (纸本)9781457719516

Recent studies have shown that operating system (OS) interference, popularly called OS noise can be a significant problem as we scale to a large number of processors. One solution for mitigating noise is to turn off certain OS services on the machine. However, this is typically infeasible because full-scale OS services may be required for some applications. Furthermore, it is not a choice that an end user can make. Thus, we need an application-level solution. Building upon previous work that demonstrated the utility of within-node light-weight load balancing, we discuss the technique of weighted micro-scheduling and provide insights based on experimentation for two different machines with very different noise signatures. Through careful enumeration of the search space of scheduler parameters, we allow our weighted micro-scheduler to be dynamic, adaptive and tunable for a specific application running on a specific architecture. By doing this, we show how we can enable running scientific applications efficiently on a very large number of processors, even in the presence of noise. © 2011 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：