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

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

来源：评论

学校读者我要写书评

暂无评论

Impacts of oxytactic microorganisms and viscous dissipation in Carreau nanoliquid featuring ferromagnetic nanoparticles

引用

Partial Differential Equations in applied Mathematics 2025年 13卷

作者： Tabrez, Muhammad Hussain, I. Khan, W.A. Khan, S.U. Waqas, M. Rashid, Rzgar Farooq Anwar, M.I. Ammar, Mohamed Ben Zamri, Nurnadiah Abiyev, Ruzimurod Garalleh, Hakim AL Department of Mathematics Mohi-ud-Din Islamic University Nerian Sharif Azad Jammu and Kashmir 12010 Pakistan Department of Mathematics Namal University Mianwali 42250 Pakistan NUTECH School of Applied Sciences and Humanities National University of Technology Islamabad 44000 Pakistan Department of Computer Science and Mathematics Lebanese American University Beirut Lebanon Faculty of Informatics and Computing Universiti Sultan Zainal Abidin Besut Campus Terengganu Besut 22200 Malaysia Department of Medical Laboratory Science College of Science Knowledge University Erbil 44001 Iraq Department of Medical Laboratory Technique College of Medical Technology AL-Kitab University Kirkuk Iraq Department of Mathematics School of Sciences and Humanities Nazarbayev University Astana Kazakhstan Center for Scientific Research and Entrepreneurship Northern Border University Arar 73213 Saudi Arabia Department of Mathematics and its Teaching Methods in Primary Education Tashkent State Pedagogical University Tashkent Uzbekistan Department of Mathematical Science College of Engineering University of Business and Technology Jeddah 21361 Saudi Arabia

Owing to rapid progress in field of nanotechnology, various mathematical model has been proposed regarding the flow of nanofluids. Based on boosted thermal properties, multidisciplinary applications of such materials has been claimed in various engineering and industrial processes. In current work, a theoretical analysis is performed for bioconvective flow of Carreau fluid with applications of magnetic dipole. The significance of magnetic dipole are presented with interaction of ferrofluid. The applications of viscous dissipation have also been entertained. The flow is subject to applications of stretched surface. Similarity variables are used for making transformation to obtain set of nonlinear ODEs from set of PDEs. The numerical computation is also made by using of well-known numerical method termed as bvp4c. Influences of various non dimensional fluid parameters like Brownian motion, viscous dissipation, Curie temperature, Weissenberg number, motile difference parameter and bioconvection Paclet number are examined and expressed graphically. It is perceived that ferrofluid's concentration declines when Brownian diffusive variable is augmented while opposite characteristics are reported for Schmidt number. Current results conveying applications in the biofuels, better heat transport medium, fertilizers, catalysts, electronics, paints, semiconductors, speakers, drug delivery, fertilizers etc. © 2024 The Author(s)

关键词： Bioconvection Carreau fluid Ferromagnetic flow Magnetic dipole Viscous dissipation

来源：评论

学校读者我要写书评

暂无评论

HPC Application Parameter Autotuning on Edge Devices: A Bandit Learning Approach 31

HPC Application Parameter Autotuning on Edge Devices: A Band...

引用

31st Annual IEEE International Conference on High Performance computing, Data, and Analytics, HiPC 2024

作者： Hossain, Abrar Badawy, Abdel-Hameed A. Islam, Mohammad A. Patki, Tapasya Ahmed, Kishwar Department of Electrical Engineering and Computer Science The University of Toledo United States Department of Electrical and Computer Engineering New Mexico State University United States Department of Computer Science and Engineering The University of Texas Arlington United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)9798331509095

The growing necessity for enhanced processing capabilities in edge devices with limited resources has led us to develop effective methods for improving high-performance computing (HPC) applications. In this paper, we introduce LASP (Lightweight Autotuning of scientific Application Parameters), a novel strategy designed to address the parameter search space challenge in edge devices. Our strategy employs a multi-armed bandit (MAB) technique focused on online exploration and exploitation. Notably, LASP takes a dynamic approach, adapting seamlessly to changing environments. We tested LASP with four HPC applications: Lulesh, Kripke, Clomp, and Hypre. Its lightweight nature makes it particularly well-suited for resource-constrained edge devices. By employing the MAB framework to efficiently navigate the search space, we achieved significant performance improvements while adhering to the stringent computational limits of edge devices. Our experimental results demonstrate the effectiveness of LASP in optimizing parameter search on edge devices. © 2024 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Improving communication performance in dense linear algebra via topology aware collectives

Improving communication performance in dense linear algebra ...

引用

2011 International Conference for High Performance computing, Networking, Storage and Analysis, SC11

作者： Solomonik, Edgar Bhatele, Abhinav Demmel, James Dept. of Electric Engineering and Computer Science University of California at Berkeley Berkeley CA 94720 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 United States

ISBN: (纸本)9781450307710

Recent results have shown that topology aware mapping reduces network contention in communication-intensive kernels on massively parallel machines. We demonstrate that on mesh interconnects, topology aware mapping also allows for the utilization of highly-efficient topology aware collectives. We map novel 2.5D dense linear algebra algorithms to exploit rectangular collectives on cuboid partitions allocated by a Blue Gene/P supercomputer. Our mappings allow the algorithms to exploit optimized line multicasts and reductions. Commonly used 2D algorithms cannot be mapped in this fashion. On 16,384 nodes (65,536 cores) of Blue Gene/P, 2.5D algorithms that exploit rectangular collectives are sig- nificantly faster than 2D matrix multiplication (MM) and LU factorization, up to 8.7x and 2.1x, respectively. These speed-ups are due to communication reduction (up to 95.6% for 2.5D MM with respect to 2D MM). We also derive LogP- based novel performance models for rectangular broadcasts and reductions. Using those, we model the performance of matrix multiplication and LU factorization on a hypothetical exascale architecture. Copyright 2011 ACM.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Direct GPU Compilation and Execution for Host Applications with OpenMP Parallelism 8

Direct GPU Compilation and Execution for Host Applications w...

引用

8th IEEE/ACM Annual Workshop on the LLVM Compiler Infrastructure in HPC, LLVM-HPC 2022

作者： Tian, Shilei Huber, Joseph Parasyris, Konstantinos Chapman, Barbara Doerfert, Johannes Stony Brook University Department of Computer Science Stony Brook United States Advanced Micro Devices Austin United States Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore United States

ISBN: (纸本)9781665475587

Currently, offloading to accelerators requires users to identify which regions are to be executed on the device, what memory needs to be transferred, and how synchronization is to be resolved. On top of these manual tasks, many standard (C/C++ library) functions, such as file I/O or memory manipulation, cannot be directly executed on the device and need to be worked around by the user explicitly. This makes it challenging to port programs in the first place and hinders developers from testing features on the GPU and within the GPU compilation pipeline. Existing tests and test suites for the host are effectively unusable for accelerators and need to be manually ported to provide the same benefits for the devices as they do on the host. In this paper, we propose a direct GPU compilation scheme that leverages the portable target offloading interface provided by LLVM/OpenMP. Utilizing this infrastructure allows us to compile an existing host application for the GPU and execute it there with only a minimal wrapper layer for the user code, command line arguments, and a compiler provided GPU implementation of C/C++ standard library functions. The C/C++ library functions are partially implemented for direct device execution and otherwise fallback to remote procedure call (RPC) to call host functions transparently. Our proposed prototype will allow users to quickly compile for, and test on, the GPU without explicitly handling kernel launches, data mapping, or host-device synchronization. We evaluate our implementation using three proxy applications with host OpenMP parallelism and three microbenchmarks to test the correctness of our prototype GPU compilation. © 2022 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

ML-based Modeling to Predict I/O Performance on Different Storage Sub-systems 31

ML-based Modeling to Predict I/O Performance on Different St...

引用

31st Annual IEEE International Conference on High Performance computing, Data, and Analytics, HiPC 2024

作者： Xu, Yiheng Sivaraman, Pranav Devarajan, Hariharan Mohror, Kathryn Bhatele, Abhinav Palantir Technologies Inc. Denver United States Department of Computer Science University of Maryland College Park United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore United States

ISBN: (纸本)9798331509095

Parallel applications can spend a significant amount of time performing I/O on large-scale supercomputers. Fast near-compute storage accelerators called burst buffers can reduce the time a processor spends performing I/O and mitigate I/O bottlenecks. However, determining if a given application could be accelerated using burst buffers is not straightforward even for storage experts. The relationship between an application’s I/O characteristics (such as I/O volume, processes involved, etc.) and the best storage sub-system for it can be complicated. As a result, adapting parallel applications to use burst buffers efficiently is a trial-and-error process. In this work, we present a Python-based tool called PrismIO that enables programmatic analysis of I/O traces. Using PrismIO, we identify performance bottlenecks when using burst buffers and parallel file systems, and explain why certain I/O patterns perform poorly. Further, we use machine learning to model the relationship between I/O characteristics and file system selections. We use IOR, an I/O benchmark to gather performance data for training the machine learning model. Our model can predict the better performing storage system for unseen IOR scenarios with an accuracy of 94.47% and for four real applications with an accuracy of 95.86%. © 2024 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Ensuring numerical quality in grid computing

Ensuring numerical quality in grid computing

引用

International Symposium on High Performance Distributed computing

作者： A. Frommer M. Husken Applied Computer Science and Scientific Computing Bergische Universität Gesamthochschule Wuppertal Wuppertal Germany

We propose an approach which gives the user valuable information on the various platforms avail able in a grid in order to assess the numerical quality of an algorithm run on each of these platforms. In this manner, the user is provided with at least very strong hints whether a program performs reliably in a grid before actually executing it. Our approach extends IeeeCC754 by two "grid-enabled" modes: The first mode calculates a "numerical checksum" on a specific grid host and executes the job only if the check sum is identical to a locally generated one. The second mode provides the user with information on the reliability and IEEE 754-conformity of the underlying floating-point implementation of various platforms. In addition, it can help to find a set of compiler options to optimize the application's performance while retaining numerical stability

关键词： Grid computing Testing Application software Floating-point arithmetic Hardware Software libraries computer science scientific computing Programming Software standards

来源：评论

学校读者我要写书评

暂无评论

An abstract data type for parallel simulations based on sparse grids 3rd

引用

3rd European Conference on Parallel Virtual Machine, EuroPVM 1996

作者： May, Michael Schiekofer, Thomas Institute of Computer Science Department of Computer Architecture and Computer Organization Technical University of Munich Arcisstr. 21 MunichD-80290 Germany Institute of Applied Mathematics Department of Scientific Computing and Numerical Simulation University of Bonn Wegelerstr. 6 BonnD-53115 Germany

ISBN: (纸本)3540617795

In this paper we introduce an abstract data type for the distributed representation and efficient handling of sparse grids on parallel architectures. The new data layout, implemented by means of the PVM message passing library, provides partitioning and dynamic load balancing transparent to the application making use of it. This enables parallelization of sequential partial differential equations (PDE) solvers based on sparse grids with hardly any source code modifications. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Asserting performance expectations

Asserting performance expectations

引用

2002 IEEE/ACM Conference on Supercomputing, SC 2002

作者： Vetter, Jeffrey S. Worley, Patrick H. Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA94551 United States Computer Science and Mathematics Division Oak Ridge National Laboratory Oak RidgeTN37831-6367 United States

ISBN: (纸本)076951524X

Traditional techniques for performance analysis provide a means for extracting and analyzing raw performance information from applications. Users then compare this raw data to their performance expectations for application constructs. This comparison can be tedious for the scale of today's architectures and software systems. To address this situation, we present a methodology and prototype that allows users to assert performance expectations explicitly in their source code using performance assertions. As the application executes, each performance assertion in the application collects data implicitly to verify the assertion. By allowing the user to specify a performance expectation with individual code segments, the runtime system can jettison raw data for measurements that pass their expectation, while reacting to failures with a variety of responses. We present several compelling uses of performance assertions with our operational prototype, including raising a performance exception, validating a performance model, and adapting an algorithm empirically at runtime. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Threads in an undergraduate course: A java example illuminating different multithreading approaches

引用

International Conference on Computational science and its Applications, ICCSA 2004

作者： Bücker, H. Martin Lang, Bruno Pflug, Hans-Joachim Vehreschild, Andre Institute for Scientific Computing RWTH Aachen University AachenD-52056 Germany Applied Computer Science Group University of Wuppertal WuppertalD-42097 Germany Center for Computing and Communication RWTH Aachen University AachenD-52056 Germany

ISBN: (纸本)3540220569

Multithreading is a fundamental approach to expressing parallelism in programs. Since Java is emerging as the de facto standard language for platform independent software development in higher education, there is need for teaching multithreading in the context of Java. We use a simple problem from scientific computing to explain two different multithreading approaches to second-year students. More precisely, a simple boundary value problem is considered, which makes visible the differences between native Java threads and the OpenMP interface. So, the students are able to appreciate the respective merits and drawbacks of a thread package that is integrated into the Java programming language and an approach combining compiler support with library calls. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：