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

IEEE International Conference on Cluster Computing (Cluster)

作者： Neuwirth, Sarah Goethe Univ Frankfurt Inst Comp Sci Frankfurt Germany

ISBN: (纸本)9781728196664

With the forthcoming age of exascale computing, the efficient support of different programming models has become a crucial performance factor for high-performance computing systems. When adopting novel programming paradigms, the performance assessment through standardized and comparable benchmarks plays an essential role in both the effective use of the heterogeneous system hardware and the application performance tuning. Alternatives to MPI such as the partitioned global address space (PGAS) model have become increasingly popular. One such PGAS API is the Global Address Space programming Interface (GASPI). This paper introduces the GASPI Benchmark Suite (GBS), which combines a comprehensive, standardized set of microbenchmarks with application kernels. The microbenchmarks target common GASPI communication patterns, including one-sided, collective, passive, and global atomics, while the application kernels stress communication schemes commonly found in real HPC applications. The effectiveness of GBS is demonstrated by evaluating the GASPI communication performance for the two networking communication standards Ethernet and InfiniBand.

关键词： PGAS programming models Performance Characterization GASPI Benchmark Suite HPC

来源：评论

学校读者我要写书评

暂无评论

Towards High Performance Resilience Using Performance Portable Abstractions 27th

Towards High Performance Resilience Using Performance Portab...

引用

27th International European Conference on Parallel and Distributed Computing (Euro-Par)

作者： Morales, Nicolas Teranishi, Keita Nicolae, Bogdan Trott, Christian Cappello, Franck Sandia Natl Labs Livermore CA 94550 USA Sandia Natl Labs POB 5800 Albuquerque NM 87185 USA Argonne Natl Lab Chicago IL USA

ISBN: (纸本)9783030856656;9783030856649

In the drive towards Exascale, the extreme heterogeneity of supercomputers at all levels places a major development burden on HPC applications. To this end, performance portable abstractions such as those advocated by Kokkos, RAJA and HPX are becoming increasingly popular. At the same time, the unprecedented scalability requirements of such heterogeneous components means higher failure rates, motivating the need for resilience in systems and applications. Unfortunately, state-of-art resilience techniques based on checkpoint/restart are lagging behind performance portability efforts: users still need to capture consistent states manually, which introduces the need for fine-tuning and customization. In this paper we aim to close this gap by introducing a set of abstractions that make it easier for the application developers to reason about resilience. To this end, we extend the existing abstractions proposed by performance portability efforts towards resilience. By marking critical data structures that need to be checkpointed, one can enable an optimized runtime to automate checkpoint-restart using high performance and scalable asynchronously techniques. We illustrate the feasibility of our proposal using a prototype that combines the Kokkos runtime (HPC performance portability), with the VELOC runtime (large-scale low overhead checkpoint-restart). Our experimental results show negligible performance overhead compared with a manually tuned implementation of checkpoint-restart while requiring minimal changes in the application code.

关键词： Performance portability Resilience Fault tolerance Checkpointing programming models

来源：评论

学校读者我要写书评

暂无评论

Handling Iterations in Distributed Dataflow Systems

引用

ACM COMPUTING SURVEYS 2022年第9期54卷 199-199页

作者： Gevay, Gabor E. Soto, Juan Markl, Volker Tech Univ Berlin Database Syst & Informat Management DIMA Grp Einsteinufer 17 D-10587 Berlin Germany German Res Ctr Artificial Intelligence DFKI Alt Moabit 91c D-10559 Berlin Germany

Over the past decade, distributed dataflow systems (DDS) have become a standard technology. In these systems, users write programs in restricted dataflow programming models, such as MapReduce, which enable them to scale out program execution to a shared-nothing cluster of machines. Yet, there is no established consensus that prescribes how to extend these programming models to support iterative algorithms. In this survey, we review the research literature and identify how DDS handle control flow, such as iteration, from both the programming model and execution level perspectives. This survey will be of interest for both users and designers of DDS.

关键词： Control flow iteration Distributed dataflows programming models Higher-order functions

来源：评论

学校读者我要写书评

暂无评论

A programming model for Hybrid Workflows: Combining task-based workflows and dataflows all-in-one

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2020年 113卷 281-297页

作者： Ramon-Cortes, Cristian Lordan, Francesc Ejarque, Jorge Badia, Rosa M. Barcelona Supercomp Ctr BSC Barcelona Spain

In the past years, e-Science applications have evolved from large-scale simulations executed in a single cluster to more complex workflows where these simulations are combined with High-Performance Data Analytics (HPDA). To implement these workflows, developers are currently using different patterns;mainly task-based and dataflow. However, since these patterns are usually managed by separated frameworks, the implementation of these applications requires to combine them;considerably increasing the effort for learning, deploying, and integrating applications in the different frameworks. This paper tries to reduce this effort by proposing a way to extend task-based management systems to support continuous input and output data to enable the combination of task-based workflows and dataflows (Hybrid Workflows from now on) using a single programming model. Hence, developers can build complex Data Science workflows with different approaches depending on the requirements. To illustrate the capabilities of Hybrid Workflows, we have built a Distributed Stream Library and a fully functional prototype extending COMPSs, a mature, general-purpose, task-based, parallel programming model. The library can be easily integrated with existing task-based frameworks to provide support for dataflows. Also, it provides a homogeneous, generic, and simple representation of object and file streams in both Java and Python;enabling complex workflows to handle any data type without dealing directly with the streaming back-end. During the evaluation, we introduce four use cases to illustrate the new capabilities of Hybrid Workflows;measuring the performance benefits when processing data continuously as it is generated, when removing synchronisation points, when processing external real-time data, and when combining task-based workflows and dataflows at different levels. The users identifying these patterns in their workflows may use the presented uses cases (and their performance improvements) as

关键词： Task-based Workflows Dataflows Streaming Convergence HPC - Big Data Distributed Computing programming models

来源：评论

学校读者我要写书评

暂无评论

Analysis of Threading Libraries for High Performance Computing

引用

IEEE TRANSACTIONS ON COMPUTERS 2020年第9期69卷 1279-1292页

作者： Castello, Adrian Gual, Rafael Mayo Seo, Sangmin Balaji, Pavan Quintana-Orti, Enrique S. Pena, Antonio J. Univ Jaume 1 Castellon De La Plana 12071 Spain Univ Jaume 1 Dept Comp Sci & Engn Castellon De La Plana 12071 Spain Ground X Seoul 135732 South Korea Argonne Natl Lab Lemmont IL 60439 USA Univ Politecn Valencia Comp Architecture Valencia 46022 Spain Barcelona Supercomp Ctr BSC Comp Sci Dept Barcelona 08034 Spain

With the appearance of multi-/many core machines, applications and runtime systems have evolved in order to exploit the new on-node concurrency brought by new software paradigms. POSIX threads (Pthreads) was widely-adopted for that purpose and it remains as the most used threading solution in current hardware. Lightweight thread (LWT) libraries emerged as an alternative offering lighter mechanisms to tackle the massive concurrency of current hardware. In this article, we analyze in detail the most representative threading libraries including Pthread- and LWT-based solutions. In addition, to examine the suitability of LWTs for different use cases, we develop a set of microbenchmarks consisting of OpenMP patterns commonly found in current parallel codes, and we compare the results using threading libraries and OpenMP implementations. Moreover, we study the semantics offered by threading libraries in order to expose the similarities among different LWT application programming interfaces and their advantages over Pthreads. This article exposes that LWT libraries outperform solutions based on operating system threads when tasks and nested parallelism are required.

关键词： Message systems Libraries Instruction sets Task analysis Hardware Parallel processing Concurrent computing Lightweight threads OpenMP GLT POSIX threads programming models

来源：评论

学校读者我要写书评

暂无评论

XACC: a system-level software infrastructure for heterogeneous quantum-classical computing*

引用

QUANTUM SCIENCE AND TECHNOLOGY 2020年第2期5卷

作者： McCaskey, Alexander J. Lyakh, Dmitry, I Dumitrescu, Eugene F. Powers, Sarah S. Humble, Travis S. Oak Ridge Natl Lab Quantum Comp Inst Oak Ridge TN 37831 USA Oak Ridge Natl Lab Comp Sci & Math Div Oak Ridge TN 37831 USA Oak Ridge Natl Lab Natl Ctr Computat Sci Oak Ridge TN 37831 USA Oak Ridge Natl Lab Computat Sci & Engn Div Oak Ridge TN 37831 USA

Quantum programming techniques and software have advanced significantly over the past five years, with a majority focusing on high-level language frameworks targeting remote REST library APIs. As quantum computing architectures advance and become more widely available, lower-level, system software infrastructures will be needed to enable tighter, co-processor programming and access models. Here we present XACC, a system-level software infrastructure for quantum-classical computing that promotes a service-oriented architecture to expose interfaces for core quantum programming, compilation, and execution tasks. We detail XACC's interfaces, their interactions, and its implementation as a hardware-agnostic framework for both near-term and future quantum-classical architectures. We provide concrete examples demonstrating the utility of this framework with paradigmatic tasks. Our approach lays the foundation for the development of compilers, associated runtimes, and low-level system tools tightly integrating quantum and classical workflows.

关键词： quantum computing quantum software programming models

来源：评论

学校读者我要写书评

暂无评论

MAGMA templates for scalable linear algebra on emerging architectures

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2020年第6期34卷 645-658页

作者： Al Farhan, Mohammed Abdelfattah, Ahmad Tomov, Stanimire Gates, Mark Sukkari, Dalal Haidar, Azzam Rosenberg, Robert Dongarra, Jack Univ Tennessee Innovat Comp Lab ICL Knoxville TN 37996 USA Univ Tennessee Innovat Comp Lab Knoxville TN 37996 USA Univ Tennessee Elect Engn & Comp Sci Dept Comp Sci Knoxville TN 37996 USA Nvidia Corp Santa Clara CA USA Naval Res Lab Ctr Computat Sci CCS Washington DC 20375 USA Oak Ridge Natl Lab Comp Sci & Math Div Oak Ridge TN USA Univ Manchester Manchester Lancs England

With the acquisition and widespread use of more resources that rely on accelerator/wide vector-based computing, there has been a strong demand for science and engineering applications to take advantage of these latest assets. This, however, has been extremely challenging due to the diversity of systems to support their extreme concurrency, complex memory hierarchies, costly data movement, and heterogeneous node architectures. To address these challenges, we design a programming model and describe its ease of use in the development of a newMAGMA Templateslibrary that delivers high-performance scalable linear algebra portable on current and emerging architectures. MAGMA Templates derives its performance and portability by (1) building on existing state-of-the-art linear algebra libraries, like MAGMA, SLATE, Trilinos, and vendor-optimized math libraries, and (2) providing access (seamlessly to the users) to the latest algorithms and architecture-specific optimizations through a single, easy-to-use C++-based API.

关键词： Accelerator-driven computing HPC linear algebra performance portability polymorphism programming models

来源：评论

学校读者我要写书评

暂无评论

AutoParallel: Automatic parallelisation and distributed execution of affine loop nests in Python

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2020年第6期34卷 659-675页

作者： Ramon-Cortes, Cristian Amela, Ramon Ejarque, Jorge Clauss, Philippe Badia, Rosa M. Barcelona Supercomp Ctr BSC Carrer Jordi Girona 29 Barcelona 08034 Spain Univ Strasbourg ICube Lab INRIA Strasbourg France

The last improvements in programming languages and models have focused on simplicity and abstraction;leading Python to the top of the list of the programming languages. However, there is still room for improvement when preventing users from dealing directly with distributed and parallel computing issues. This paper proposes and evaluates AutoParallel, a Python module to automatically find an appropriate task-based parallelisation of affine loop nests and execute them in parallel in a distributed computing infrastructure. It is based on sequential programming and contains one single annotation (in the form of a Python decorator) so that anyone with intermediate-level programming skills can scale up an application to hundreds of cores. The evaluation demonstrates that AutoParallel goes one step further in easing the development of distributed applications. On the one hand, the programmability evaluation highlights the benefits of using a single Python decorator instead of manually annotating each task and its parameters or, even worse, having to develop the parallel code explicitly (e.g., using OpenMP, MPI). On the other hand, the performance evaluation demonstrates that AutoParallel is capable of automatically generating task-based workflows from sequential Python code while achieving the same performances than manually taskified versions of established state-of-the-art algorithms (i.e., Cholesky, LU, and QR decompositions). Finally, AutoParallel is also capable of automatically building data blocks to increase the tasks' granularity;freeing the user from creating the data chunks, and re-designing the algorithm. For advanced users, we believe that this feature can be useful as a baseline to design blocked algorithms.

关键词： Automatic parallelisation distributed computing programming models

来源：评论

学校读者我要写书评

暂无评论

STEEL-RT: combining single task-single executor model and expanded scheduling to ease heterogeneity exploitation

引用

JOURNAL OF SUPERCOMPUTING 2020年第6期76卷 4682-4700页

作者： Rey, Anton Igual, Francisco D. Prieto-Matias, Manuel Univ Complutense Madrid Dept Arquitectura Comp & Automat Madrid 28040 Spain

The ever-increasing complexity in terms of heterogeneity and available parallelism of modern architectures, together with the growing software ecosystem in terms of application libraries and runtime systems are posing a new challenge in terms of programmability on top of the already difficult task of extracting high parallel performance. With the goal of simplifying the programmability at the extreme, we first present the single task-single executor (STSE) model, in which the execution entry point consists solely on a single task assigned to an abstract execution context or executor, representing the whole system platform. As a second contribution, we introduce the expanded scheduling operations that endow executors with additional runtime task scheduling capabilities, and explain how executors can be composed to express and exploit different architectural features at run time under the framework of a single/multiple-task/executor taxonomy. As a result, we introduce STEEL, a novel programming model built on these concepts and STEEL-RT, a coupled high-performance runtime implementation for it. We illustrate the potential of STEEL by means of runtime experiments on a modern heterogeneous architecture, showing that complex and efficient heterogeneous executions are accessible from a STSE approach.

关键词： Heterogeneous computing programming models Data partitioning Thread parallelism Task parallelism

来源：评论

学校读者我要写书评

暂无评论

Combining hard and soft constraints in quantum constraint-satisfaction systems 22

Combining hard and soft constraints in quantum constraint-sa...

引用

Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

作者： Ellis Wilson Frank Mueller Scott Pakin North Carolina State University Los Alamos National Laboratory

This work presents a generalization of NchooseK, a constraint satisfaction system designed to target both quantum circuit devices and quantum annealing devices. Previously, NchooseK supported only hard constraints, which made it suitable for expressing problems in NP (e.g., 3-SAT) but not NP-hard problems (e.g., minimum vertex cover). In this paper we show how support for soft constraints can be added to the model and implementation, broadening the classes of problems that can be expressed elegantly in NchooseK without sacrificing portability across different quantum *** a set of examples, we argue that this enhanced version of NchooseK enables problems to be expressed in a more concise, less error-prone manner than if these problems were encoded manually for quantum execution. We include an empirical evaluation of performance, scalability, and fidelity on both a large IBM Q system and a large D-Wave system.

关键词： programming models quantum annealing circuit-model quantum computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：