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

32nd IEEE Conference on Virtual Reality and 3D User Interfaces, VR 2025

作者： Pavanatto, Leonardo Giovannelli, Alexander Giera, Brian Bremer, Timo Miao, Haichao Bowman, Doug A. Virginia Tech Center for Human-Computer Interaction Department of Computer Science United States Lawrence Livermore National Laboratory Center for Applied Scientific Computing United States

ISBN: (纸本)9798331536459

Locating small features in a large, dense object in virtual reality (VR) poses a significant interaction challenge. While existing multiscale techniques support transitions between various levels of scale, they are not focused on handling dense, homogeneous objects with hidden features. We propose a novel approach that applies the concept of progressive refinement to VR navigation, enabling focused inspections. We conducted a user study where we varied two independent variables in our design, navigation style (STRUCTURED vs. UNSTRUCTURED) and display mode (SELECTION vs. EVERYTHING), to better understand their effects on efficiency and awareness during multiscale navigation. Our results showed that unstructured navigation can be faster than structured and that displaying only the selection can be faster than displaying the entire object. However, using an everything display mode can support better location awareness and object understanding. © 2025 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Testing the Unknown: A Framework for OpenMP Testing via Random Program Generation

Testing the Unknown: A Framework for OpenMP Testing via Rand...

引用

2024 Workshops of the International Conference for High Performance computing, Networking, Storage and Analysis, SC Workshops 2024

作者： Laguna, Ignacio Chapman, Patrick Parasyris, Konstantinos Georgakoudis, Giorgis Rubio-Gonzalez, Cindy Lawrence Livermore National Laboratory Center for Applied Scientific Computing United States University of California Department of Computer Science Davis United States

ISBN: (纸本)9798350355543

We present a randomized differential testing approach to test OpenMP implementations. In contrast to previous work that manually creates dozens of verification and validation tests, our approach is able to randomly generate thousands of tests, exposing OpenMP implementations to a wide range of program behaviors. We represent the space of possible random OpenMP tests using a grammar and implement our method as an extension of the Varity program generator. By generating 1,800 OpenMP tests, we find various performance anomalies and correctness issues when we apply them to three OpenMP implementations: GCC, Clang, and Intel. We also present several case studies that analyze the anomalies and give more details about the classes of tests that our approach creates. © 2024 IEEE.

关键词： differential testing OpenMP random program generation software testing

来源：评论

学校读者我要写书评

暂无评论

On the Scalability of computing Genomic Diversity Using SparkLeBLAST: A Feasibility Study

On the Scalability of Computing Genomic Diversity Using Spar...

引用

2024 IEEE High Performance Extreme computing Conference, HPEC 2024

作者： Prabhu, Ritvik Moussad, Bernard Youssef, Karim Vatai, Emil Feng, Wu-Chun Virginia Tech Department of Computer Science United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States Riken Center for Computational Science Japan

ISBN: (纸本)9798350387131

Studying the genomic diversity of viruses can help us understand how viruses evolve and how that evolution can impact human health. Rather than use a laborious and tedious wet-lab approach to conduct a genomic diversity study, we take a computational approach, using the ubiquitous NCBI BLAST and our parallel and distributed SparkLeBLAST, across 53 patients (40,000,000 query sequences) on Fugaku, the world's fastest homogeneous supercomputer with 158,976 nodes, where each code contains a 48-core A64FX processor and 32 GB RAM. To project how long BLAST and SparkLeBLAST would take to complete a genomic diversity study of COVID-19, we first perform a feasibility study on a subset of 50 query sequences from a single COVID-19 patient to identify bottlenecks in sequence alignment processing. We then create a model using Amdahl's law to project the run times of NCBI BLAST and SparkLeBLAST on supercomputing systems like Fugaku. Based on the data from this 50-sequence feasibility study, our model predicts that NCBI BLAST, when running on all the cores of the Fugaku supercomputer, would take approximately 26.7 years to complete the full-scale study. In contrast, SparkLeBLAST, using both our query and database segmentation, would reduce the execution time to 0.026 years (i.e., 22.9 hours) - resulting in more than a 10,000× speedup over using the ubiquitous NCBI BLAST. © 2024 IEEE.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Testing GPU Numerics: Finding Numerical Differences Between NVIDIA and AMD GPUs

Testing GPU Numerics: Finding Numerical Differences Between ...

引用

2024 Workshops of the International Conference for High Performance computing, Networking, Storage and Analysis, SC Workshops 2024

作者： Zahid, Anwar Hossain Laguna, Ignacio Le, Wei Iowa State University Department of Computer Science AmesIA United States Lawrence Livermore National Laboratory Center for Applied Scientific Computing LivermoreCA United States

ISBN: (纸本)9798350355543

As scientific codes are ported between GPU platforms, continuous testing is required to ensure numerical robustness and identify potential numerical differences between platforms. Compiler-induced numerical differences can occur when a program is compiled and run on different GPUs and compilers, and the numerical outcomes are different for the same input. We present a study of compiler-induced numerical differences between NVIDIA and AMD GPUs, two widely used GPUs in HPC clusters. Our approach uses a random program generator (Varity) to generate thousands of short numerical tests in CUDA and HIP, and their inputs;then, we use differential testing to check if the program produced a numerical inconsistency when run on NVIDIA and AMD GPUs, using the same compiler optimization level. We also use the AMD's HIPIFY tool to convert CUDA tests into HIP tests and test if there are numerical inconsistencies induced by HIPIFY. In our study, we generated more than 600,000 tests and found subtle numerical differences occurring between the two classes of GPUs. We found that some of the differences come from (1) math library calls, (2) differences in floating-point precision (FP64 versus FP32), and (3) converting code to HIP with HIPIFY. © 2024 IEEE.

关键词： CUDA Differential testing floating-point HIP random program generation

来源：评论

学校读者我要写书评

暂无评论

Web service location-allocation using discrete NSGA-II with matrix based genetic operations and a repair mechanism

引用

Journal of Ambient Intelligence and Humanized computing 2023年第10期14卷 14163-14187页

作者： Verma, Shanu Pant, Millie Snasel, Vaclav Department of Applied Mathematics and Scientific Computing Indian Institute of Technology Roorkee Roorkee247667 India Centre for Artificial Intelligence and Data Science Indian Institute of Technology Roorkee Roorkee247667 India Department of Computer Science VSB-Technical University of Ostrava Ostrava70800 Czech Republic

Web Service Location-Allocation Problem (WSLAP) is an important and challenging NP-hard combinatorial optimization problem where multiple objectives affecting the quality of service (QoS) are to be optimized simultaneously. Most of the existing research articles mainly focus on selecting web service locations that minimize two QoS: total cost and total response time. However, another QoS factor throughput also needs attention when selecting sites for allocating web services. Therefore, we have constructed a new WSLAP model that minimizes the total cost and the total negative quality factor. This negative quality factor considers throughput along with latency to strengthen the QoS of the located web services. Further, three NSGA-II variants, NSGA-II.V1, NSGA-II.V2, and NSGA-II.V3, with a novel matrix-based chromosome representation, are developed to deal with the proposed bi-objective WSLAP model. These algorithms involve matrix-based genetic operations for better exploration and a repair mechanism for tackling infeasibility. The proposed model and algorithms are validated on 24 test instances, out of which 14 are existing, and 10 are newly created with increased web services, user centres and service locations. The experimental results claim that the proposed WSLAP model succeeded in improving the throughput with a comparatively lower total cost. Further, the proposed algorithms outperformed the compared algorithms in terms of hypervolume, inverted generational distance and computational time on 89% of instances. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Testing the Unknown: A Framework for OpenMP Testing via Random Program Generation 24

Testing the Unknown: A Framework for OpenMP Testing via Rand...

引用

Proceedings of the SC '24 Workshops of the International Conference on High Performance computing, Network, Storage, and Analysis

作者： Ignacio Laguna Patrick Chapman Konstantinos Parasyris Giorgis Georgakoudis Cindy Rubio-González Center for Applied Scientific Computing Lawrence Livermore National Laboratory Department of Computer Science University of California Davis

ISBN: (纸本)9798350355543

关键词： OpenMP

来源：评论

学校读者我要写书评

暂无评论

Adaptive energy-preserving algorithms for guiding center system

引用

Plasma science and Technology 2023年第4期25卷 11-22页

作者：朱贝贝刘健张嘉炜祝爱卿唐贻发 Department of Applied Mathematics School of Mathematics and PhysicsUniversity of Science and Technology BeijingBeijing 100083Peopleʼs Republic of China School of Nuclear Science and Technology University of Science and Technology of ChinaHefei 230026Peopleʼs Republic of China Advanced algorithm Joint Lab Shandong Computer Science CenterQilu University of TechnologyJinan 250014Peopleʼs Republic of China The State Key Laboratory of Scientific and Engineering Computing The Institute of Computational Mathematics and Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190Peopleʼs Republic of China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049Peopleʼs Republic of China

We develop two types of adaptive energy preserving algorithms based on the averaged vector field for the guiding center dynamics,which plays a key role in magnetized *** adaptive scheme is applied to the Gauss Legendre’s quadrature rules and time stepsize respectively to overcome the energy drift problem in traditional energy-preserving *** new adaptive algorithms are second order,and their algebraic order is carefully *** results show that the global energy errors are bounded to the machine precision over long time using these adaptive algorithms without massive extra computation cost.

关键词： guiding center system energy-preserving methods adaptive energy conservation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：