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

2006 acm sigplan symposium on principles and practice of parallel programming, PPOPP'06

作者： Joiner, David A. Gray, Paul Murphy, thomas Peck, Charles Kean University 1000 Morris Ave Union NJ 07083 University of Northern Iowa 1227 West 27th St Cedar Falls IA 50614 Contra Costa College 2600 Mission Bell Dr San Pablo CA 94806 Earlham College 801 National Rd West Richmond IN 47374

ISBN: (纸本)1595931899

In 2002, we first brought High Performance Computing (HPC) methods to the college classroom as a way to enrich Computational Science education. through the years, we have continued to facilitate college faculty in science, technology, engineering, and mathematics (STEM) disciplines to stay current with HPC methodologies. We have accomplished this by designing and delivering faculty workshops, hosted in a variety of lab settings, as well as by developing tools supporting the technical infrastructure necessary for HPC education, all this without requiring access to traditional HPC computing platforms. In all, we have so far presented 16 professional development workshops for close to 400 predominantly undergraduate STEM faculty. this paper presents the result of internal formative evaluation by workshop instructors and the materials and tools developed during that process. We did this work as part of the National Computational Science Institute (NCSI) and in collaboration with the following groups: the Minority Serving Institutions - High Performance Computing (MSI-HPC) program of the National Computational Science Alliance the Consortium for Computing Sciences in Colleges (CCSC) the Center for Excellence in High Performance Computing the Oklahoma University Supercomputing symposium series the Super Computing (SC) conference series education program We presented learners with a sequence of interactive, "run it, modify it, build it" open-ended lab exercises drawn from a variety of disciplines. Interactivity means having the ability to change parallel and algorithmic parameters, e.g. running software on more than one machine, using different models, refining the model, changing the problem scale, using different parallel algorithms. there is a lack of scientific parallel curricula suitable for illustrating Computational Science principles in the classroom. We addressed this need by locating, and where necessary creating, suitable open source software, data-sets, and cur

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

the design and implementation of a parallel array operator for the arbitrary remapping of data

引用

acm sigplan NOTICES 2003年第10期38卷 154-165页

作者： Deitz, SJ Chamberlain, BL Choi, SE Snyder, L Univ Washington Seattle WA 98195 USA Cray Inc Seattle WA 98104 USA Los Alamos Natl Lab Los Alamos NM 87545 USA

Gather and scatter are data redistribution functions of long-standing importance to high performance computing. In this paper, we present a highly-general array operator with powerful gather and scatter capabilities unmatched by other array languages. We discuss an efficient parallel implementation, introducing three new optimizations-schedule compression, dead array reuse, and direct communication-that reduce the costs associated with the operator's wide applicability. In our implementation of this operator in ZPL, we demonstrate performance comparable to the hand-coded Fortran + MPI versions of the NAS FT and CC benchmarks.

关键词： languages parallel programming gather scatter array languages ZPL

来源：评论

学校读者我要写书评

暂无评论

A programming Model for GPU Load Balancing 23

A Programming Model for GPU Load Balancing

引用

28th acm sigplan Annual symposium on principles and practice of parallel programming, PPoPP 2023

作者： Osama, Muhammad Porumbescu, Serban D. Owens, John D. University of California DavisCA United States

ISBN: (纸本)9798400700156

We propose a GPU fine-grained load-balancing abstraction that decouples load balancing from work processing and aims to support both static and dynamic schedules with a programmable interface to implement new load-balancing schedules. Prior to our work, the only way to unleash the GPU's potential on irregular problems has been to workload-balance through application-specific, tightly coupled load-balancing techniques. With our open-source framework for load-balancing, we hope to improve programmers' productivity when developing irregular-parallel algorithms on the GPU, and also improve the overall performance characteristics for such applications by allowing a quick path to experimentation with a variety of existing load-balancing techniques. Consequently, we also hope that by separating the concerns of load-balancing from work processing within our abstraction, managing and extending existing code to future architectures becomes easier. © 2023 Owner/Author.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Reaching bandwidth saturation using transparent injection parallelization

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2017年第5期31卷 405-421页

作者： Chaimov, Nicholas Ibrahim, Khaled Z. Williams, Samuel Iancu, Costin Univ Oregon Eugene OR 97403 USA Lawrence Berkeley Natl Lab Computat Res Div Berkeley CA USA Lawrence Berkeley Natl Lab Performance & Algorithms Res Grp Berkeley CA USA

Although logically available, applications may not exploit enough instantaneous communication concurrency to maximize network utilization on HPC systems. this is exacerbated in hybrid programming models that combine single program multiple data with OpenMP or CUDA. We present the design of a multi-threaded runtime able to transparently increase the instantaneous network concurrency and to provide near saturation bandwidth, independent of the application configuration and dynamic behavior. the runtime offloads communication requests from application level tasks to multiple communication servers. the servers use system specific performance models to attain network saturation. Our techniques alleviate the need for spatial and temporal application level message concurrency optimizations. Experimental results show improved message throughput and bandwidth by as much as 150% for 4 KB messages on InfiniBand and by as much as 120% for 4 KB messages on Cray Aries. For more complex operations such as all-to-all collectives, we observe as much as 30% speedup. this translates into 23% speedup on 12,288 cores for a NAS FT implemented using FFTW. We observe as much as 76% speedup on 1500 cores for an already optimized UPC+OpenMP geometric multigrid application using hybrid parallelism. For the geometric multigrid GPU implementation, we observe as much as 44% speedup on 512 GPUs.

关键词： Communication concurrency multi-threaded runtime one sided communication parallel injection UPC

来源：评论

学校读者我要写书评

暂无评论

Certified Compilation of Financial Contracts 18

Certified Compilation of Financial Contracts

引用

20th International symposium on principles and practice of Declarative programming (PPDP)

作者： Annenkov, Danil Elsman, Martin INRIA GALLINETTE Res Ream Nantes France Univ Copenhagen Dept Comp Sci DIKU Copenhagen Denmark

ISBN: (纸本)9781450364416

We present an extension to a certified financial contract management system that allows for templated declarative financial contracts and for integration with financial stochastic models through verified compilation into so-called payoff-expressions. Such expressions readily allow for determining the value of a contract in a given evaluation context, such as contexts created for stochastic simulations. the templating mechanism is useful both at the contract specification level, for writing generic reusable contracts, and for reuse of code that, without the templating mechanism, needs to be recompiled for different evaluation contexts. We report on the effect of using the certified system in the context of a GPGPU-based Monte Carlo simulation engine for pricing various over-the-counter (OTC) financial contracts. the full contract-management system, including the payoff-language compilation, is verified in the Coq proof assistant and certified Haskell code is extracted from our Coq development along with Futhark code for use in a data-parallel pricing engine.

关键词： financial contracts contract languages domain-specific languages certified programming software correctness Coq

来源：评论

学校读者我要写书评

暂无评论

Decentralized execution of constraint handling rules for ensembles 13

Decentralized execution of constraint handling rules for ens...

引用

15th symposium on principles and practice of Declarative programming, PPDP 2013

作者： Lam, Edmund S. L. Cervesato, Iliano Carnegie Mellon University United States

ISBN: (纸本)9781450321549

CHR is a declarative, concurrent and committed choice rule-based constraint programming language. In this paper, we adapt CHR to provide a decentralized execution model for parallel and distributed programs. Specifically, we consider an execution model consisting of an ensemble of computing entities, each with its own constraint store and each capable of communicating with its neighbors. We extend CHR into CHRe, in which rules are executed at a location and are allowed to access the constraint store of its immediate neighbors. We give an operational semantics for CHRe, denoted ω 0e, that defines incremental and asynchronous decentralized rewriting for the class of CHRe rules characterized by purely local matching (0-neighbor restricted rules). We show the soundness of the ω0e semantics with respect to the abstract CHR semantics. We then give a safe encoding of the more general 1-neighbor restricted rules as 0-neighbor restricted rules, and discuss how this encoding can be generalized to all CHRe programs. © 2013 acm.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Prolog programming with a map-reduce parallel construct 13

Prolog programming with a map-reduce parallel construct

引用

15th symposium on principles and practice of Declarative programming, PPDP 2013

作者： Côrte-Real, Joana Dutra, Inês Rocha, Ricardo CRACS INESC TEC University of Porto Rua Campo Alegre 1021/1055 4169-007 Porto Portugal

ISBN: (纸本)9781450321549

Map-Reduce is a programming model that has its roots in early functional programming. In addition to producing short and elegant code for problems involving lists or collections, this model has proven very useful for large-scale highly parallel data processing. In this work, we present the design and implementation of a high-level parallel construct that makes the Map-Reduce programming model available for Prolog programmers. To the best of our knowledge, there is no Map-Reduce framework native to Prolog, and so the aim of this work is to offer data processing features from which several applications can greatly benefit;the Inductive Logic programming field, for instance, can take advantage of a Map-Reduce predicate when proving newly created rules against sets of examples. Our Map-Reduce model was comprehensively tested with different applications. Our experiments, using the Yap Prolog system, show that: (i) the model scales linearly up to 24 processors;(ii) a dynamic distributed scheduling strategy performs better than centralized or static scheduling strategies;and (iii) the performance varies significantly with the number of items being sent to each processor at a time. Overall, our Map-Reduce framework presents as a good alternative for both taking advantage of the currently available low cost multi-core architectures and developing scalable data processing applications, native to the Prolog programming language. © 2013 acm.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Exploring the Use of WebAssembly in HPC 23

Exploring the Use of WebAssembly in HPC

引用

28th acm sigplan Annual symposium on principles and practice of parallel programming, PPoPP 2023

作者： Chadha, Mohak Krueger, Nils John, Jophin Jindal, Anshul Gerndt, Michael Benedict, Shajulin Computer Architecture and Parallel Systems Technische Universität München Germany Department of Computer Science and Engg. Indian and Institute of Information Technology Kottayam Kerala India

ISBN: (纸本)9798400700156

Containerization approaches based on namespaces offered by the Linux kernel have seen an increasing popularity in the HPC community both as a means to isolate applications and as a format to package and distribute them. However, their adoption and usage in HPC systems faces several challenges. these include difficulties in unprivileged running and building of scientific application container images directly on HPC resources, increasing heterogeneity of HPC architectures, and access to specialized networking libraries available only on HPC systems. these challenges of container-based HPC application development closely align with the several advantages that a new universal intermediate binary format called WebAssembly (Wasm) has to offer. these include a lightweight userspace isolation mechanism and portability across operating systems and processor architectures. In this paper, we explore the usage of Wasm as a distribution format for MPI-based HPC applications. To this end, we present MPIWasm, a novel Wasm embedder for MPI-based HPC applications that enables high-performance execution of Wasm code, has low-overhead for MPI calls, and supports high-performance networking interconnects present on HPC systems. We evaluate the performance and overhead of MPIWasm on a production HPC system and AWS Graviton2 nodes using standardized HPC benchmarks. Results from our experiments demonstrate that MPIWasm delivers competitive native application performance across all scenarios. Moreover, we observe that Wasm binaries are 139.5x smaller on average as compared to the statically-linked binaries for the different standardized benchmarks. © 2023 acm.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Task-oriented programming in a pure functional language 12

Task-oriented programming in a pure functional language

引用

14th symposium on principles and practice of Declarative programming, PPDP 2012

作者： Plasmeijer, Rinus Lijnse, Bas Michels, Steffen Achten, Peter Koopman, Pieter Institute for Computing and Information Sciences Radboud University P.O. Box 9010 6500 GL Nijmegen Netherlands Faculty of Military Sciences Netherlands Defense Academy P.O. Box 10000 1780 CA Den Helder Netherlands

ISBN: (纸本)9781450315227

Task-Oriented programming (TOP) is a novel programming paradigm for the construction of distributed systems where users work together on the *** multiple users collaborate, they need to interact with each other frequently. TOP supports the definition of tasks that react to the progress made by others. With TOP, complex multi-user interactions can be programmed in a declarative style just by defining the tasks that have to be accomplished, thus eliminating the need to worry about the implementation detail that commonly frustrates the development of applications for this domain. TOP builds on four core concepts: tasks that represent computations or work to do which have an observable value that may change over time, data sharing enabling tasks to observe each other while the work is in progress, generic type driven generation of user interaction, and special combinators for sequential and parallel task composition. the semantics of these core concepts is defined in this paper. As an example we present the iTask3 framework, which embeds TOP in the functional programming language Clean. Copyright © 2012 acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Scalable parallel Minimum Spanning Forest Computation

Scalable Parallel Minimum Spanning Forest Computation

引用

17th acm sigplan symposium on principles and practice of parallel programming

作者： Nobari, Sadegh Cao, thanh-Tung Karras, Panagiotis Bressan, Stephane Natl Univ Singapore Singapore Singapore Rutgers State Univ Piscataway NJ 08855 USA

the proliferation of data in graph form calls for the development of scalable graph algorithms that exploit parallel processing environments. One such problem is the computation of a graph's minimum spanning forest (MSF). Past research has proposed several parallel algorithms for this problem, yet none of them scales to large, high-density graphs. In this paper we propose a novel, scalable, parallel MSF algorithm for undirected weighted graphs. Our algorithm leverages Prim's algorithm in a parallel fashion, concurrently expanding several subsets of the computed MSF. Our effort focuses on minimizing the communication among different processors without constraining the local growth of a processor's computed subtree. In effect, we achieve a scalability that previous approaches lacked. We implement our algorithm in CUDA, running on a GPU and study its performance using real and synthetic, sparse as well as dense, structured and unstructured graph data. Our experimental study demonstrates that our algorithm outperforms the previous state-of-the-art GPU-based MSF algorithm, while being several order of magnitude faster than sequential CPU-based algorithms.

关键词： Algorithms Experimentation Performance parallel Graph Algorithms Minimum Spanning Forest GPU

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：