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

Proceedings of the 27th acm SIGPLAN symposium on principles and practice of parallel programming

作者： Srđan Milaković Oguz Selvitopi Israt Nisa Zoran Budimlić Aydin Buluç Rice University Lawrence Berkeley Nat. Laboratory AWS AI

ISBN: (纸本)9781450392044

Computing the product of two sparse matrices (SpGEMM) is a fundamental operation in various combinatorial and graph algorithms as well as various bioinformatics and data analytics applications for computing inner-product similarities. For an important class of algorithms, only a subset of the output entries are needed, and the resulting operation is known as Masked SpGEMM since a subset of the output entries is considered to be "masked out". In this work, we investigate various novel algorithms and data structures for this rather challenging and important computation, and provide guidelines on how to design a fast Masked-SpGEMM for shared-memory architectures.

关键词： GraphBLAS

来源：评论

学校读者我要写书评

暂无评论

Automatic synthesis of parallel unix commands and pipelines with KumQuat 22

Automatic synthesis of parallel unix commands and pipelines ...

引用

Proceedings of the 27th acm SIGPLAN symposium on principles and practice of parallel programming

作者： Jiasi Shen Martin Rinard Nikos Vasilakis MIT

ISBN: (纸本)9781450392044

We present KumQuat, a system for automatically generating data-parallel implementations of Unix shell commands and pipelines. the generated parallel versions split input streams, execute multiple instantiations of the original pipeline commands to process the splits in parallel, then combine the resulting parallel outputs to produce the final output stream. KumQuat automatically synthesizes the combine operators, with a domain-specific combiner language acting as a strong regularizer that promotes efficient inference of correct combiners. We present experimental results that show that these combiners enable the effective parallelization of our benchmark scripts.

关键词： automatic parallelization program synthesis

来源：评论

学校读者我要写书评

暂无评论

A parallel branch-and-bound algorithm with history-based domination 22

A parallel branch-and-bound algorithm with history-based dom...

引用

Proceedings of the 27th acm SIGPLAN symposium on principles and practice of parallel programming

作者： Taspon Gonggiatgul Ghassan Shobaki Pinar Muyan-Özçelik California State University

ISBN: (纸本)9781450392044

In this paper, we describe a parallel Branch-and-Bound (B&B) algorithm with a history-based domination technique, and we apply it to the Sequential Ordering Problem (SOP). To the best of our knowledge, the proposed algorithm is the first parallel B&B algorithm that includes a history-based domination technique and is the first parallel B&B algorithm for solving the SOP using a pure B&B approach. the proposed algorithm takes a pool-based approach and employs a collection of novel techniques that we have developed to achieve effective parallel exploration of the solution space, including parallel history domination, history table memory management, and a thread restart technique. the proposed algorithm was experimentally evaluated using the SOPLIB and TSPLIB benchmarks. the results show that using ten threads with a time limit of one hour on the medium-difficulty instances, the proposed algorithm gives a geometric-mean speedup of 19.9 on SOPLIB and 10.23 on TSPLIB, with super-linear speedups up to 65x seen on 17 instances.

关键词： NP-complete problems

来源：评论

学校读者我要写书评

暂无评论

Impala: a middleware system for managing autonomic, parallel sensor systems

引用

acm SIGPLAN NOTICES 2003年第10期38卷 107-118页

作者： Liu, T Martonosi, M Princeton Univ Dept Comp Sci Princeton NJ 08544 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

Sensor networks are long-running computer systems with many sensing/compute nodes working to gather information about their environment, process and fuse that information, and in some cases, actuate control mechanisms in response. Like traditional parallel systems, communication between nodes is of fundamental importance, but is typically accomplished via wireless transceivers. One further key attribute of sensor networks is that they are almost always long-running systems, intended to operate in situ, with minimal direct human intervention, for months or years. this requirement for long-running autonomy mandates careful design of the runtime system that manages applications on each node, to ensure reliability and ease of upgrades over the life of the system. this paper describes Impala, a middleware architecture that enables application modularity, adaptivity, and repair-ability in wireless sensor networks. Impala allows software updates to be received via the node's wireless transceiver and to be applied to the running system dynamically. In addition, Impala also provides an interface for on-the-fly application adaptation in order to improve the performance, energy-efficiency, and reliability of the software system. Impala has been designed to be a part of the ZebraNet mobile sensor network, but we are also prototyping it within HP/Compaq iPAQ Pocket PC handhelds. We present performance data for both real system measurements of the Pocket PC version as well as simulations of a full mobile sensor system deployment. Overall, Impala is a lightweight runtime system that can greatly improve system reliability, performance, and energy-efficiency. the ideas introduced here for sensor networks have applicability more broadly in other long-running autonomous parallel systems as well.

关键词： design experimentation performance sensor networks middleware system software adaptation software update

来源：评论

学校读者我要写书评

暂无评论

Formal Verification of Practical MPI Programs

引用

acm SIGPLAN NOTICES 2009年第4期44卷 261-269页

作者： Vo, Anh Vakkalanka, Sarvani DeLisi, Michael Gopalakrishnan, Ganesh Kirby, Robert M. thakur, Rajeev Univ Utah Sch Comp Salt Lake City UT 84112 USA Argonne Natl Lab Div Math & Comp Sci Argonne IL 60439 USA

this paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our approach, we directly model-check the MPI/C source code, executing its interleavings with the help of a verification scheduler. Unfortunately, the total feasible number of interleavings is exponential, and impractical to examine even for our modest goals. Our earlier publications formalized and implemented a partial order reduction approach that avoided exploring equivalent interleavings, and presented a verification tool called ISP. this paper presents algorithmic and engineering innovations to ISP, including the use of OpenMP parallelization, that now enables it to handle practical MPI programs, including: (i) ParMETIS - a widely used hypergraph partitioner, and (ii) MADRE - a Memory Aware Data Re-distribution Engine, both developed outside our group. Over these benchmarks, ISP has automatically verified up to 14K lines of MPI/C code, producing error traces of deadlocks and assertion violations within seconds.

关键词： Verification MPI Message Passing Interface distributed programming model checking dynamic partial order reduction

来源：评论

学校读者我要写书评

暂无评论

An Imperialistic Strategy Approach to Continuous Global Optimization Problem

An Imperialistic Strategy Approach to Continuous Global Opti...

引用

International symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： George Anescu Power Plant Engineering Faculty Polytechnic University of Bucharest Bucharest Romania

the paper is introducing the principles of a new global optimization strategy, Imperialistic Strategy (IS), applied to the Continuous Global Optimization Problem (CGOP). Inspired from existing multi-population strategies, like the Island Model (IM) approaches to parallel Evolutionary Algorithms (EA) and the Imperialistic Competitive Algorithm (ICA), the proposed IS method is considered an optimization strategy for the reason that it can integrate other well-known optimization methods, which in the context are regarded as sub-methods (although in other contexts they are prominent global optimization methods). Four optimization methods were implemented and tested in the roles of sub-methods: Genetic Algorithm (GA) (a floating-point representation variant), Differential Evolution (DE), Quantum Particle Swarm Optimization (QPSO) and Artificial Bee Colony (ABC). the optimization performances of the proposed optimization methods were compared on a test bed of 9 known multimodal optimization problems by applying an appropriate testing methodology. the obtained increased success rates of IS multi-population variants compared to the success rates of the optimization sub-methods run separately, combined with the increased computing efficiencies possible to be perceived for parallel and distributed implementations, demonstrated that IS is a promising approach to CGOP.

关键词： Optimization Sociology Statistics Vectors Biological cells Linear programming Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

LB-HM: load balance-aware data placement on heterogeneous memory for task-parallel HPC applications 22

LB-HM: load balance-aware data placement on heterogeneous me...

引用

Proceedings of the 27th acm SIGPLAN symposium on principles and practice of parallel programming

作者： Zhen Xie Jie Liu Sam Ma Jiajia Li Dong Li University of California College of William & Mary

ISBN: (纸本)9781450392044

the emergence of heterogeneous memory (HM) provides a cost-effective and high-performance solution to memory-consuming HPC applications. However, using HM, wisely migrating data objects on it is critical for high performance. In this work, we introduce a load balance-aware page management system, named LB-HM. LB-HM introduces task semantics during memory profiling, rather than being application-agnostic. Evaluating with a set of memory-consuming HPC applications, we show that we show that LB-HM reduces existing load imbalance and leads to an average of 17.1% and 15.4% (up to 26.0% and 23.2%) performance improvement, compared with a hardware-based solution and an industry-quality software-based solution on Optane-based HM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stream-K: Work-Centric parallel Decomposition for Dense Matrix-Matrix Multiplication on the GPU 23

Stream-K: Work-Centric Parallel Decomposition for Dense Matr...

引用

Proceedings of the 28th acm SIGPLAN Annual symposium on principles and practice of parallel programming

作者： Muhammad Osama Duane Merrill Cris Cecka Michael Garland John D. Owens University of California Davis NVIDIA Corporation

ISBN: (纸本)9798400700156

We introduce Stream-K, a work-centric parallelization of matrix multiplication (GEMM) and related computations in dense linear algebra. Whereas contemporary decompositions are primarily tile-based, our method operates by partitioning an even share of the aggregate inner loop iterations among physical processing elements. this provides a near-perfect utilization of computing resources, regardless of how efficiently the output tiling for any given problem quantizes across the underlying processing elements.

关键词： GPU matrix-multiplication load-balancing

来源：评论

学校读者我要写书评

暂无评论

Beyond parallel programming with domain specific languages 14

Beyond parallel programming with domain specific languages

引用

Proceedings of the 19th acm SIGPLAN symposium on principles and practice of parallel programming

作者： Kunle Olukotun Stanford University Stanford CA USA

ISBN: (纸本)9781450326568

Today, almost all computer architectures are parallel and heterogeneous; a combination of multiple CPUs, GPUs and specialized processors. this creates a challenging problem for application developers who want to develop high performance programs without the effort required to use low-level, architecture specific parallel programming models (e.g. OpenMP for CMPs, CUDA for GPUs, MPI for clusters). Domain-specific languages (DSLs) are a promising solution to this problem because they can provide an avenue for high-level application-specific abstractions with implicit parallelism to be mapped directly to low level architecture-specific programming models; providing both high programmer productivity and high execution *** this talk I will describe an approach to building high performance DSLs, which is based on DSL embedding in a general purpose programming language, metaprogramming and a DSL infrastructure called Delite. I will describe how we transform DSL programs into efficient first-order low-level code using domain specific optimization, parallelism and locality optimization with parallel patterns, and architecture-specific code generation. All optimizations and transformations are implemented in Delite: an extensible DSL compiler infrastucture that significantly reduces the effort required to develop new DSLs. Delite DSLs for machine learning, data querying, graph analysis, and scientific computing all achieve performance competitive with manually parallelized C++ code.

关键词： domain specific languages

来源：评论

学校读者我要写书评

暂无评论

Fast parallel Exact Inference on Bayesian Networks 23

Fast Parallel Exact Inference on Bayesian Networks

引用

Proceedings of the 28th acm SIGPLAN Annual symposium on principles and practice of parallel programming

作者： Jiantong Jiang Zeyi Wen Atif Mansoor Ajmal Mian The University of Western Australia Hong Kong University of Science and Technology (Guangzhou)

ISBN: (纸本)9798400700156

Bayesian networks (BNs) are attractive, because they are graphical and interpretable machine learning models. However, exact inference on BNs is time-consuming, especially for complex problems. To improve the efficiency, we propose a fast BN exact inference solution named Fast-BNI on multi-core CPUs. Fast-BNI enhances the efficiency of exact inference through hybrid parallelism that tightly integrates coarse- and fine-grained parallelism. We also propose techniques to further simplify the bottleneck operations of BN exact inference. Fast-BNI source code is freely available at https://***/jjiantong/FastBN.

关键词： junction tree inference bayesian networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：