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

IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC (P3HPC)

作者： Deakin, Tom McIntosh-Smith, Simon Price, James Poenaru, Andrei Atkinson, Patrick Popa, Codrin Salmon, Justin Univ Bristol High Performance Comp Res Grp Bristol Avon England

ISBN: (纸本)9781728160030

Previous studies into performance portability have typically analysed a single application (and its various implementations) in isolation. In this study we explore the wider landscape of performance portability by considering a number of applications from across the space of dwarfs, written in multiple parallel programming models, and across a diverse set of architectures. We apply rigorous performance portability metrics, as defined by Pennycook et al [1]. We believe this is the broadest and most rigorous performance portability study to date, representing a far reaching exploration of the state of performance portability that is achievable today. We will present a summary of the performance portability of each application and programming model across our diverge range of twelve computer architectures, including six different server CPUs from five different vendors, five different GPUs from two different vendors, and one vector architecture. We will conclude with an analysis of the performance portability of key programming models in general, across different application spaces as well across differing architectures, allowing us to comment on more general performance portability principles.

关键词： performance portability productivity mini-app programming models

来源：评论

学校读者我要写书评

暂无评论

GLTO: On the Adequacy of Lightweight Thread Approaches for OpenMP Implementations 46

GLTO: On the Adequacy of Lightweight Thread Approaches for O...

引用

46th International Conference on Parallel Processing Workshops (ICPPW)

作者： Castello, Adrian Mayo, Rafael Quintana-Orti, Enrique S. Seo, Sangmin Balaji, Pavan Pena, Antonio J. Univ Jaume I Castello Castellon de La Plana Spain Argonne Natl Lab Lemont IL USA BSC Barcelona Spain

ISBN: (纸本)9781538610428

OpenMP is the de facto standard application programming interface (API) for on-node parallelism. The most popular OpenMP runtimes rely on POSIX threads (pthreads) implementations that offer an excellent performance for coarse-grained parallelism and match perfectly with the current hardware. However, a recent trend in runtimes/applications points in the direction of leveraging massive on-node parallelism in conjunction with fine-grained and dynamic scheduling paradigms. It has been demonstrated that lightweight thread (LWT) solutions are more appropriate for these new parallel paradigms. We have developed GLTO, an OpenMP implementation over the recently-emerged Generic Lightweight Threads (GLT) API. GLT exports a common API for LWT libraries that offers the possibility of running the same application over different native LWT solutions. In this paper we use GLTO to analyze different scenarios where OpenMP implementations may benefit from the use of either LWT or pthreads. Our study reveals that none of the threading approaches obtains the best performance in all the scenarios, but that there are important gaps among them.

关键词： GLT Lightweight Threads OpenMP POSIX Threads programming models

来源：评论

学校读者我要写书评

暂无评论

Loop Level Speculation in a Task Based programming Model

Loop Level Speculation in a Task Based Programming Model

引用

20th International Conference on High Performance Computing (HiPC)

作者： Gayatri, Rahulkumar Badia, Rosa. M. Aygaude, Eduard Barcelona Supercomp Ctr Barcelona Spain CSIC Artificial Intelligence Res Inst IIIA Madrid Spain Univ Politecn Cataluna E-08028 Barcelona Spain

ISBN: (纸本)9781479907298

Uncountable loops (such as while loops in C) and if-conditions are some of the most common constructs in programming. While-loops are widely used to determine the convergence in linear algebra algorithms or goal finding problems from graph algorithms, to name a few. In general whileloops are used whenever the loop iteration space, the number of iterations a loop executes is unknown. Usually in while-loops, the execution of the next iteration is decided inside the current loop iteration (i.e. the execution of iteration i depends on the values computed in iteration i-1). This precludes their parallel execution in today's ubiquitous multi-core architectures. In this paper a technique to speculatively create parallel tasks from the next iterations before the current one completes is proposed. If consecutive loop-iterations are only control dependent, then multiple iterations can be executed simultaneously;later in the execution path, the runtime system will decide to either commit the results of such speculatively executed iterations or undo the changes made by them. Data dependences within or between non-speculative and speculative work are honored to guarantee correctness. The proposed technique is implemented in SMPSs, a task-based dataflow programming model for shared-memory multiprocessor architectures. The approach is evaluated on a set of applications from graph algorithms and linear algebra. Results are promising with an average increase in the speedup of 1.2x with 16 threads when compared to non speculative execution of the applications. The increase in the speedup is significant, since the performance gain is achieved over an already parallelized version of the benchmarks.

关键词： SMPSs Iteration space Speculation programming models

来源：评论

学校读者我要写书评

暂无评论

Comparing Runtime Systems with Exascale Ambitions Using the Parallel Research Kernels 31st

Comparing Runtime Systems with Exascale Ambitions Using the ...

引用

31st International Conference on ISC High Performance

作者： Van der Wijngaart, Rob F. Kayi, Abdullah Hammond, Jeff R. Jost, Gabriele St John, Tom Sridharan, Srinivas Mattson, Timothy G. Abercrombie, John Nelson, Jacob Intel Corp Hillsboro OR 97124 USA Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9783319413211;9783319413204

We use three Parallel Research Kernels to compare performance of a set of programming models(We employ the term programming model as it is commonly used in the application community. A more accurate term is programming environment, which is the collective of abstract programming model, embodiment of the model in an Application Programmer Interface (API), and the runtime that implements it.): MPI1 (MPI two-sided communication), MPIOPENMP (MPI+OpenMP), MPISHM (MPI1 with MPI-3 interprocess shared memory), MPIRMA (MPI one-sided communication), SHMEM, UPC, Charm++ and Grappa. The kernels in our study -Stencil, Synch p2p and Transpose underlie a wide range of computational science applications. They enable direct probing of properties of programming models, especially communication and synchronization. In contrast to mini-or proxy applications, the PRK allow for rapid implementation, measurement and verification. Our experimental results show MPISHM the overall winner, with MPI1, MPIOPENMP and SHMEM performing well. MPISHM and MPIOPENMP outperform the other models in the strong-scaling limit due to their effective use of shared memory and good granularity control. The non-evolutionary models Grappa and Charm++ are not competitive with traditional models (MPI and PGAS) for two of the kernels;these models favor irregular algorithms, while the PRK considered here are regular.

关键词： programming models MPI PGAS Charm plus

来源：评论

学校读者我要写书评

暂无评论

Dynamic Data-Driven Avionics Systems: Inferring Failure Modes from Data Streams

Dynamic Data-Driven Avionics Systems: Inferring Failure Mode...

引用

15th Annual International Conference on Computational Science (ICCS)

作者： Imai, Shigeru Galli, Alessandro Varela, Carlos A. Rensselaer Polytech Inst Troy NY 12180 USA

Dynamic Data-Driven Avionics Systems (DDDAS) embody ideas from the Dynamic Data-Driven Application Systems paradigm by creating a data-driven feedback loop that analyzes spatio-temporal data streams coming from aircraft sensors and instruments, looks for errors in the data signaling potential failure modes, and corrects for erroneous data when possible. In case of emergency, DDDAS need to provide enough information about the failure to pilots to support their decision making in real-time. We have developed the PILOTS system, which supports data-error tolerant spatio-temporal stream processing, as an initial step to realize the concept of DDDAS. In this paper, we apply the PILOTS system to actual data from the Tuninter 1153 (TU1153) flight accident in August 2005, where the installation of an incorrect fuel sensor led to a fatal accident. The underweight condition suggesting an incorrect fuel indication for TU1153 is successfully detected with 100% accuracy during cruise flight phases. Adding logical redundancy to avionics through a dynamic data-driven approach can significantly improve the safety of flight.

关键词： programming models spatio-temporal data data streaming

来源：评论

学校读者我要写书评

暂无评论

Scalable Collectives for Distributed Asynchronous Many-Task Runtimes 32

Scalable Collectives for Distributed Asynchronous Many-Task ...

引用

27th International Heterogeneity in Computing Workshop in conjunction with 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Whitlock, Matthew Kolla, Hemanth Treichler, Sean Pebay, Philippe Bennett, Janine C. Oklahoma State Univ Stillwater OK 74078 USA Sandia Natl Labs Livermore CA 94550 USA Stanford Univ Stanford CA 94305 USA NexGen Analyt Sheridan WY USA

ISBN: (纸本)9781538655559

Global collectives (reductions/aggregations) are ubiquitous and feature in nearly every application of distributed high-performance computing (HPC). While it is advisable to devise algorithms by placing collectives off the critical path of execution, they are sometimes unavoidable for correctness, numerical convergence and analyses purposes. Scalable algorithms for distributed collectives are well studied and have become an integral part of MPI, but new and emerging distributed computing frameworks and paradigms such as Asynchronous Many-Task (AMT) models lack the same sophistication for distributed collectives. Since the central promise of AMT runtimes is that they automatically discover, and expose, task dependencies in the underlying program and can schedule work optimally to minimize idle time and hide data movement, a naively designed collectives protocol can completely offset any gains made from asynchronous execution. In this study we demonstrate that scalable distributed collectives are indispensable for performance in AMT models. We design, implement and test the performance of a scalable collective algorithm in Legion, an exemplar data-centric AMT programming model. Our results show that AMT systems contain the necessary primitives that allow for fully scalable collectives without breaking the transparent data movement abstractions. Scalabiity tests of an integrated Legion 1D stencil mini-application show the clear benefit of implementing scalable collectives and the performance degradation when a naive collectives alternative is used instead.

关键词： programming models Asynchronous Many-Task Parallel Computing Distributed Collectives Computational Statistics

来源：评论

学校读者我要写书评

暂无评论

HPAC: Evaluating Approximate Computing Techniques on HPC OpenMP Applications 21

HPAC: Evaluating Approximate Computing Techniques on HPC Ope...

引用

International Conference for High Performance Computing, Networking, Storage and Analysis (SC21)

作者： Parasyris, Konstantinos Georgakoudis, Giorgis Menon, Harshitha Diffenderfer, James Laguna, Ignacio Osei-Kuffuor, Daniel Schordan, Markus Lawrence Livermore Natl Lab Livermore CA 94550 USA

ISBN: (纸本)9781450384421

As we approach the limits of Moore's law, researchers are exploring new paradigms for future high-performance computing (HPC) systems. Approximate computing has gained traction by promising to deliver substantial computing power. However, due to the stringent accuracy requirements of HPC scientific applications, the broad adoption of approximate computing methods in HPC requires an in-depth understanding of the application's amenability to approximations. We develop HPAC, a framework with compiler and runtime support for code annotation and transformation, and accuracy vs. performance trade-off analysis of OpenMP HPC applications. We use HPAC to perform an in-depth analysis of the effectiveness of approximate computing techniques when applied to HPC applications. The results reveal possible performance gains of approximation and its interplay with parallel execution. For instance, in the LULESH proxy application approximation provides substantial performance gains due to the reduction of memory accesses. However, in the leukocyte benchmark approximation induces load imbalance in the parallel execution and thus limiting the performance gains.

关键词： Approximate Computing programming models Runtime Systems OpenMP

来源：评论

学校读者我要写书评

暂无评论

Revet: A Language and Compiler for Dataflow Threads 30

Revet: A Language and Compiler for Dataflow Threads

引用

30th IEEE International Symposium on High-Performance Computer Architecture (HPCA)

作者： Rucker, Alexander C. Sundram, Shiv Smith, Coleman Vilim, Matthew Prabhakar, Raghu Kjolstad, Fredrik Olukotun, Kunle Stanford Univ Stanford CA 94305 USA SambaNova Syst Inc Palo Alto CA USA

ISBN: (纸本)9798350393132;9798350393149

Spatial dataflow architectures such as reconfigurable dataflow accelerators (RDA) can provide much higher performance and efficiency than CPUs and GPUs. In particular, vectorized reconfigurable dataflow accelerators (vRDA) in recent literature represent a design point that enhances the efficiency of dataflow architectures with vectorization. Today, vRDAs can be exploited using either hard-coded kernels or MapReduce languages like Spatial, which cannot vectorize data-dependent control flow. In contrast, CPUs and GPUs can be programmed using general-purpose threaded abstractions. The ideal combination would be the generality of a threaded programming model coupled with the efficient execution model of a vRDA. We introduce Revet: a programming model, compiler, and execution model that lets threaded applications run efficiently on vRDAs. The Revet programming language uses threads to support a broader range of applications than prior parallel-patterns approaches, and our MLIR-based compiler lowers this language to a generic dataflow backend that operates on streaming tensors. Finally, we show that mapping threads to dataflow out-performs GPUs, the current state-of-the-art for threaded accelerators, by 3.8x.

关键词： CGRA Dataflow Dataflow Threads Languages programming models RDA Reconfigurable Architectures vRDA

来源：评论

学校读者我要写书评

暂无评论

An Extension of the StarSs programming Model for Platforms with Multiple GPUs

引用

15th International Euro-Par Conference on Parallel Computing

作者： Ayguade, Eduard Badia, Rosa M. Igual, Francisco D. Labarta, Jesus Mayo, Rafael Quintana-Orti, Enrique S. CNS BSC Nexus 2 BldgC Jordi Girona 29 Barcelona 08034 Spain CSIC Madrid Spain Univ Jaume 1 Dept Ingn Ciensia Comp Castellon de La Plana 12 Spain

ISBN: (纸本)9783642038686

While general-purpose homogeneous multi-core architectures are becoming ubiquitous, there are clear indications that, for a number of important applications, a better performance/power ratio can be attained using specialized hardware accelerators. These accelerators require specific SDK or programming languages which are not always easy to program. Thus, the impact of the new programming paradigms on the programmer's productivity will determine their success in the high-performance computing arena. In this paper we present CPU Superscalar (GPUSs), an extension of the Star Superscalar programming model that targets the parallelization of applications on platforms consisting of a general-purpose processor connected with multiple graphics processors. GPUSs deals with architecture heterogeneity and separate memory address spaces;while preserving simplicity and portability. Preliminary experimental results for a well-known operation in numerical linear algebra illustrate the correct;adaptation of the runtime to a multi-GPU system, attaining notable performance results.

关键词： Task-level parallelism graphics processors heterogeneous systems programming models

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL RESERVOIR MANAGEMENT AND CROP PLANNING UNDER DETERMINISTIC AND STOCHASTIC INFLOWS

引用

JAWRA Journal of the American Water Resources Association 1980年第3期16卷 438-443页

作者： Maji, C.C. Heady, Earl O. Division of Agricultural Economics Indian Agricultural Research Institute New Delhi India Center for Agricultural and Rural Development Iowa State University Ames Iowa 50011 United States

ABSTRACT: This study analyzes planning under deterministic and stochastic inflows for the Mayurakshi project in India. models are developed to indicate the optimal storage of reservoir water, the transfer of water to the producing regions, and the spillage of water from the reservoir, if needed. A deterministic programming model was first formulated to represent the existing situation. A chance‐constrained model then was constructed to evaluate potential violations of the deterministic model. Both models were quantified for the command area. Data were collected from surveys of the area and from government agencies. Both the deterministic and change‐constrained models suggest a more intensive cropping program in the region. Both emphasize more dependence on rabi and less on kharif crops. The chance‐constrained especially suggests use of more water in the rabi season. Important chances in cropping programs and labor use take place under the chance‐constrained model. Copyright © 1980, Wiley Blackwell. All rights reserved

关键词： deterministic and stochastic flows programming models reservoir management water allocation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：