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

proceedings of the 2023 acm/SPEC International Conference on Performance Engineering

作者： Georg Hager FAU Erlangen-Nürnberg Erlangen Germany

ISBN: (纸本)9798400700682

In High Performance computing, resource efficiency is paramount. Expensive systems need to be utilized to the maximum of their capabilities, but deep insight into the bottlenecks of a particular hardware-software combination is often lacking on the users' side. Analytic, first-principles performance models can provide such insight. They are built on simplified descriptions of the machine, the software, and how they interact. This goes, to some extent, against the general trend towards automation in computer science; the individual conducting the analysis does require some knowledge of the application and the hardware in order to make performance engineering a scientific process instead of blindly generating data with tools that are poorly understood. This talk uses examples from parallel high-performance computing to demonstrate how analytic performance models can support scientific thinking in performance engineering: Sparse matrix-vector multiplication, the HPCG benchmark, the CloverLeaf proxy app, and a lattice-Boltzmann solver. Interestingly, the most intriguing insights emerge from the failure of analytic models to accurately predict performance measurements.

关键词： performance modeling high performance computing first-principles models performance engineering

来源：评论

学校读者我要写书评

暂无评论

Stationary Behavior of Constant Stepsize SGD Type Algorithms: An Asymptotic Characterization

引用

proceedings of the acm on measurement and analysis of computing systems 2022年第1期6卷 1–24页

作者： Chen, Zaiwei Mou, Shancong Maguluri, Siva Theja Georgia Inst Technol 755 Ferst Dr NW Atlanta GA 30332 USA

Stochastic approximation (SA) and stochastic gradient descent (SGD) algorithms are work-horses for modern machine learning algorithms. Their constant stepsize variants are preferred in practice due to fast convergence behavior. However, constant stepsize SA algorithms do not converge to the optimal solution, but instead have a stationary distribution, which in general cannot be analytically characterized. In this work, we study the asymptotic behavior of the appropriately scaled stationary distribution, in the limit when the constant stepsize goes to zero. Specifically, we consider the following three settings: (1) SGD algorithm with a smooth and strongly convex objective, (2) linear SA algorithm involving a Hurwitz matrix, and (3) nonlinear SA algorithm involving a contractive operator. When the iterate is scaled by 1/root alpha, where alpha is the constant stepsize, we show that the limiting scaled stationary distribution is a solution of an implicit equation. Under a uniqueness assumption (which can be removed in certain settings) on this equation, we further characterize the limiting distribution as a Gaussian distribution whose covariance matrix is the unique solution of a suitable Lyapunov equation. For SA algorithms beyond these cases, our numerical experiments suggest that unlike central limit theorem type results: (1) the scaling factor need not be 1/root alpha, and (2) the limiting distribution need not be Gaussian. Based on the numerical study, we come up with a heuristic formula to determine the right scaling factor, and make insightful connection to the Euler-Maruyama discretization scheme for approximating stochastic differential equations.

关键词： stochastic gradient descent stochastic approximation asymptotic analysis stationary distribution

来源：评论

学校读者我要写书评

暂无评论

A Scalable Real-Time Data Assimilation Framework for Predicting Turbulent Atmosphere Dynamics 24

A Scalable Real-Time Data Assimilation Framework for Predict...

引用

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

作者： Junqi Yin Siming Liang Siyan Liu Feng Bao Hristo G. Chipilski Dan Lu Guannan Zhang National Center for Computational Science Oak Ridge National Laboratory Oak Ridge TN USA Department of Mathematics Florida State University Tallahassee FL USA Computational Science and Engineering Division Oak Ridge National Laboratory Oak Ridge TN USA Department of Scientific Computing Florida State University Tallahassee FL USA Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN USA

ISBN: (纸本)9798350355543

AI-based foundation models like FourCastNet, GraphCast, ClimaX, and Pangu-Weather are revolutionizing weather and climate predictions but are not yet ready for operational use. Their limitation lies in the absence of a data assimilation system to incorporate real-time Earth system observations, crucial for accurately forecasting events like tropical cyclones and atmospheric rivers. To overcome these obstacles, we introduce a generic real-time data assimilation framework and demonstrate its end-to-end performance on the Frontier supercomputer. This framework comprises two primary modules: an ensemble score filter (EnSF), which significantly outperforms the state-of-the-art data assimilation method, e.g., the Local Ensemble Transform Kalman Filter (LETKF); and a vision transformer-based surrogate capable of real-time adaptation through the integration of observational data. We demonstrate both the strong and weak scaling of our framework up to 1024 GPUs on the Exascale supercomputer, Frontier. Our results not only illustrate the framework's exceptional scalability on high-performance computing systems, but also demonstrate the importance of supercomputers in real-time data assimilation for weather and climate predictions. Even though the proposed framework is tested only on a benchmark surface quasi-geostrophic (SQG) turbulence system, it has the potential to be combined with existing AI-based foundation models, making it suitable for future operational implementations.

关键词： Diffusion models

来源：评论

学校读者我要写书评

暂无评论

Diagnosing Bias in the Gender Representation of HCI Research Participants: How it Happens and Where We Are 21

Diagnosing Bias in the Gender Representation of HCI Research...

引用

CHI Conference on Human Factors in computing systems

作者： Offenwanger, Anna Milligan, Alan John Chang, Minsuk Bullard, Julia Yoon, Dongwook Univ British Columbia Vancouver BC Canada Korea Adv Inst Sci & Technol Sch Comp Daejeon South Korea Naver AI Lab Seongnam South Korea

ISBN: (纸本)9781450380966

In human-computer interaction (HCI) studies, bias in the gender representation of participants can jeopardize the generalizability of findings, perpetuate bias in data driven practices, and make new technologies dangerous for underrepresented groups. Key to progress towards inclusive and equitable gender practices is diagnosing the current status of bias and identifying where it comes from. In this mixed-methods study, we interviewed 13 HCI researchers to identify the potential bias factors, defined a systematic data collection procedure for meta-analysis of participant gender data, and created a participant gender dataset from 1,147 CHI papers. Our analysis provided empirical evidence for the underrepresentation of women, the invisibility of non-binary participants, deteriorating representation of women in MTurk studies, and characteristics of research topics prone to bias. Based on these findings, we make concrete suggestions for promoting inclusive community culture and equitable research practices in HCI.

关键词： gender gender bias user studies participants human subjects HCI CHI human-computer interaction research data schema dataset meta-analysis

来源：评论

学校读者我要写书评

暂无评论

VarSaw: Application-tailored measurement Error Mitigation for Variational Quantum Algorithms 23

VarSaw: Application-tailored Measurement Error Mitigation fo...

引用

proceedings of the 28th acm International Conference on Architectural Support for Programming Languages and Operating systems, Volume 4

作者： Siddharth Dangwal Gokul Subramanian Ravi Poulami Das Kaitlin N. Smith Jonathan Mark Baker Frederic T. Chong University of Chicago Chicago USA University of Michigan Ann Arbor United States University of Texas at Austin Austin USA Infleqtion Chicago United States University of Texas at Austin Austin United States of America University of Chicago Chicago United States

ISBN: (纸本)9798400703942

For potential quantum advantage, Variational Quantum Algorithms (VQAs) need high accuracy beyond the capability of today's NISQ devices, and thus will benefit from error mitigation. In this work we are interested in mitigating measurement errors which occur during qubit measurements after circuit execution and tend to be the most error-prone operations, especially detrimental to VQAs. Prior work, JigSaw, has shown that measuring only small subsets of circuit qubits at a time and collecting results across all such `subset' circuits can reduce measurement errors. Then, running the entire (`global') original circuit and extracting the qubit-qubit measurement correlations can be used in conjunction with the subsets to construct a high-fidelity output distribution of the original circuit. Unfortunately, the execution cost of JigSaw scales polynomially in the number of qubits in the circuit, and when compounded by the number of circuits and iterations in VQAs, the resulting execution cost quickly turns *** combat this, we propose VarSaw, which improves JigSaw in an application-tailored manner, by identifying considerable redundancy in the JigSaw approach for VQAs: spatial redundancy across subsets from different VQA circuits and temporal redundancy across globals from different VQA iterations. VarSaw then eliminates these forms of redundancy by commuting the subset circuits and selectively executing the global circuits, reducing computational cost (in terms of the number of circuits executed) over naive JigSaw for VQA by 25x on average and up to 1000x, for the same VQA accuracy. Further, it can recover, on average, 45% of the infidelity from measurement errors in the noisy VQA baseline. Finally, it improves fidelity by 55%, on average, over JigSaw for a fixed computational budget. VarSaw can be accessed here: https://***/siddharthdangwal/VarSaw

关键词： quantum computing variational quantum algorithms error mitigation measurement errors noisy intermediate-scale quantum variational quantum eigensolver

来源：评论

学校读者我要写书评

暂无评论

Quality Assurance and Control of Steel Blade Production Using Full Non-Contact Frequency Response analysis and 3D Laser Doppler Scanning Vibrometry System 11

Quality Assurance and Control of Steel Blade Production Usin...

引用

11th IEEE International Conference on Intelligent Data Acquisition and Advanced computing systems - Technology and Applications (IDAACS)

作者： Scislo, Lukasz Cracow Univ Technol Fac Elect & Comp Engn Warszawska 24 PL-31155 Krakow Poland

ISBN: (纸本)9781665426053

Quality management is one of the crucial aspects of the Industry 4.0 concept of industrial production. The key matter is to limit the time for the quality system processes in the total production time. This paper presents the use of non-destructive, non-contact experimental modal analysis using the single or multipoint approach for measurement over the surface of the product. The example of such quality assurance measurements, with the use of a 3D Laser Doppler Vibrometry System, is a proposal of advanced instrumentation and data acquisition systems which is the perfect fit for Industry 4.0 factory quality management systems.

关键词： quality assurance quality control LDV Laser Doppler Vibrometer modal analysis EMA

来源：评论

学校读者我要写书评

暂无评论

On the analysis of a Multipartite Entanglement Distribution Switch

引用

proceedings of the acm on measurement and analysis of computing systems 2020年第2期4卷 1–39页

作者： Nain, Philippe Vardoyan, Gayane Guha, Saikat Towsley, Don INRIA Paris France Univ Massachusetts Amherst MA 01003 USA Univ Arizona Tucson AZ USA

We study a quantum switch that distributes maximally entangled multipartite states to sets of users. The entanglement switching process requires two steps: first, each user attempts to generate bipartite entanglement between itself and the switch;and second, the switch performs local operations and a measurement to create multipartite entanglement for a set of users. In this work, we study a simple variant of this system, wherein the switch has infinite memory and the links that connect the users to the switch are identical. Further, we assume that all quantum states, if generated successfully, have perfect fidelity and that decoherence is negligible. This problem formulation is of interest to several distributed quantum applications, while the technical aspects of this work result in new contributions within queueing theory. Via extensive use of Lyapunov functions, we derive necessary and sufficient conditions for the stability of the system and closed-form expressions for the switch capacity and the expected number of qubits in memory.

关键词： quantum switch entanglement distribution Markov chain

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Network Embedding in Apache Spark 21

Large-Scale Network Embedding in Apache Spark

引用

27th acm SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)

作者： Lin, Wenqing Tencent Interact Entertainment Grp Shenzhen Guangdong Peoples R China

ISBN: (纸本)9781450383325

Network embedding has been widely used in social recommendation and network analysis, such as recommendation systems and anomaly detection with graphs. However, most of previous approaches cannot handle large graphs efficiently, due to that (i) computation on graphs is often costly and (ii) the size of graph or the intermediate results of vectors could be prohibitively large, rendering it difficult to be processed on a single machine. In this paper, we propose an efficient and effective distributed algorithm for network embedding on large graphs using Apache Spark, which recursively partitions a graph into several small-sized subgraphs to capture the internal and external structural information of nodes, and then computes the network embedding for each subgraph in parallel. Finally, by aggregating the outputs on all subgraphs, we obtain the embeddings of nodes in a linear cost. After that, we demonstrate in various experiments that our proposed approach is able to handle graphs with billions of edges within a few hours and is at least 4 times faster than the state-of-the-art approaches. Besides, it achieves up to 4.25% and 4.27% improvements on link prediction and node classification tasks respectively. In the end, we deploy the proposed algorithms in two online games of Tencent with the applications of friend recommendation and item recommendation, which improve the competitors by up to 91.11% in running time and up to 12.80% in the corresponding evaluation metrics.

关键词： network embedding distributed computing graph partitioning

来源：评论

学校读者我要写书评

暂无评论

A Transferability Study of Interpolation-Based Hardware Model Checking for Software Verification

Proceedings of the ACM on Software Engineering

引用

proceedings of the acm on Software Engineering 2024年第FSE期1卷 2028-2050页

作者： Dirk Beyer Po-Chun Chien Marek Jankola Nian-Ze Lee LMU Munich Munich Germany

Assuring the correctness of computing systems is fundamental to our society and economy, and formal verification is a class of techniques approaching this issue with mathematical rigor. Researchers have invented numerous algorithms to automatically prove whether a computational model, e.g., a software program or a hardware digital circuit, satisfies its specification. In the past two decades, Craig interpolation has been widely used in both hardware and software verification. Despite the similarities in the theoretical foundation between hardware and software verification, previous works usually evaluate interpolation-based algorithms on only one type of verification tasks (e.g., either circuits or programs), so the conclusions of these studies do not necessarily transfer to different types of verification tasks. To investigate the transferability of research conclusions from hardware to software, we adopt two performant approaches of interpolation-based hardware model checking, (1) Interpolation-Sequence-Based Model Checking (Vizel and Grumberg, 2009) and (2) Intertwined Forward-Backward Reachability analysis Using Interpolants (Vizel, Grumberg, and Shoham, 2013), for software verification. We implement the algorithms proposed by the two publications in the software verifier CPAchecker because it has a software-verification adoption of the first interpolation-based algorithm for hardware model checking from 2003, which the two publications use as a comparison baseline. To assess whether the claims in the two publications transfer to software verification, we conduct an extensive experiment on the largest publicly available suite of safety-verification tasks for the programming language C. Our experimental results show that the important characteristics of the two approaches for hardware model checking are transferable to software verification, and that the cross-disciplinary algorithm adoption is beneficial, as the approaches adopted from hardware model checking we

关键词： CPAchecker Craig Interpolation Formal Verification Invariant Synthesis Model Checking Program analysis Replicability Reproducibility Software Verification Transferability

来源：评论

学校读者我要写书评

暂无评论

Lightweight and Modular Resource Leak Verification 2021

Lightweight and Modular Resource Leak Verification

引用

29th acm Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE)

作者： Kellogg, Martin Shadab, Narges Sridharan, Manu Ernst, Michael D. Univ Washington Seattle WA 98195 USA Univ Calif Riverside Riverside CA 92521 USA

ISBN: (纸本)9781450385626

A resource leak occurs when a program allocates a resource, such as a socket or file handle, but fails to deallocate it. Resource leaks cause resource starvation, slowdowns, and crashes. Previous techniques to prevent resource leaks are either unsound, imprecise, inapplicable to existing code, slow, or a combination of these. Static detection of resource leaks requires checking that deallocation methods are always invoked on relevant objects before they become unreachable. Our key insight is that leak detection can be reduced to an accumulation problem, a class of typestate problems amenable to sound and modular checking without the need for a heavyweight, whole-program alias analysis. The precision of an accumulation analysis can be improved by computing targeted aliasing information, and we augmented our baseline checker with three such novel techniques: a lightweight ownership transfer system;a specialized resource alias analysis;and a system to create a fresh obligation when a non-final resource field is updated. Our approach occupies a unique slice of the design space: it is sound and runs relatively quickly (taking minutes on programs that a state-of-the-art approach took hours to analyze). We implemented our techniques for Java in an open-source tool called the Resource Leak Checker. The Resource Leak Checker revealed 49 real resource leaks in widely-deployed software. It scales well, has a manageable false positive rate (comparable to the high-confidence resource leak analysis built into the Eclipse IDE), and imposes only a small annotation burden (1/1500 LoC) for developers.

关键词： Pluggable type systems accumulation analysis static analysis typestate analysis resource leaks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：