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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

63 篇 会议

馆藏范围

63 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

56 篇 工学
- 54 篇 软件工程
- 37 篇 计算机科学与技术...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
9 篇 理学
- 8 篇 数学
- 2 篇 系统科学
- 1 篇 大气科学
1 篇 教育学
- 1 篇 教育学

主题

6 篇 parallel program...
4 篇 computer program...
4 篇 concurrency
4 篇 gpu
3 篇 performance anal...
3 篇 synchronization
2 篇 shared memory pa...
2 篇 performance
2 篇 parallelism
2 篇 optimization
2 篇 concurrent data ...
2 篇 fusion
2 篇 semantics
2 篇 machine learning
2 篇 parallel computi...
2 篇 cache-coherence
2 篇 sparse matrix
2 篇 functional progr...
2 篇 scheduling
2 篇 openmp

机构

3 篇 carnegie mellon ...
2 篇 tsinghua univ de...
2 篇 pacific northwes...
2 篇 inria rocquencou...
2 篇 tsinghua univ pe...
2 篇 purdue univ w la...
1 篇 ist austria klos...
1 篇 fudan univ sch c...
1 篇 nyu comp sci dep...
1 篇 department of co...
1 篇 department of co...
1 篇 jetbrains prague...
1 篇 tera computer co...
1 篇 bnrist peoples r...
1 篇 coll william & m...
1 篇 univ lisbon inst...
1 篇 univ of californ...
1 篇 uc riverside riv...
1 篇 coll william mar...
1 篇 argonne natl lab...

作者

3 篇 chen wenguang
3 篇 zhai jidong
3 篇 wang haojie
2 篇 blelloch guy e.
2 篇 li jiajia
2 篇 dhulipala laxman
2 篇 steele guy l. jr...
2 篇 chen haibo
2 篇 rainey mike
2 篇 anderson daniel
2 篇 krishnamoorthy s...
2 篇 jin yuyang
2 篇 tang xiongchao
1 篇 guan haibing
1 篇 nicol david m.
1 篇 viswanathan rame...
1 篇 ichiyoshi nobuyu...
1 篇 dhruva tirumala
1 篇 ichiyoshi n.
1 篇 tirumala dhruva

语言

63 篇 英文

检索条件"任意字段=Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"

共 63 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

An Architecture and programming Model for Accelerating parallel Commutative Computations via Privatization 22

An Architecture and Programming Model for Accelerating Paral...

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Balaji, Vignesh Tirumala, Dhruva Lucia, Brandon Carnegie Mellon Univ Pittsburgh PA 15213 USA

来源：评论

学校读者我要写书评

暂无评论

Recovering Performance for Vector-based Machine Learning on Managed Runtime 22

Recovering Performance for Vector-based Machine Learning on ...

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Wu, Mingyu Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Key Lab Scalable Comp & Syst Shanghai Peoples R China

ISBN: (纸本)9781450344937

The explosive growth of data and the demand for learning useful information from such data have stimulated a crossdisciplinary area named big learning, which leverages a cluster of commodity machines to run machine learning applications on large datasets. Those applications are usually implemented on high-level programming frameworks [1-4], which are running atop managed runtimes. Since the applications usually involve many iterations of computation over input data, the frameworks will cache them for performance consideration. In this work, we investigate a set of vectorbased machine learning applications in Spark MLlib [3] and find that cached datasets have a strong impact on overall efficiency. Copyright is held by the Owner/Author(s).

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Using Butterfly-Patterned Partial Sums to Draw from Discrete Distributions 17

Using Butterfly-Patterned Partial Sums to Draw from Discrete...

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Steele, Guy L., Jr. Tristan, Jean-Baptiste Oracle Labs Ludhiana Punjab India

ISBN: (纸本)9781450344937

We describe a SIMD technique for drawing values from multiple discrete distributions, such as sampling from the random variables of a mixture model, that avoids computing a complete table of partial sums of the relative probabilities. A table of alternate ("butterfly-patterned") form is faster to compute, making better use of coalesced memory accesses;from this table, complete partial sums are computed on the fly during a binary search. Measurements using CUBA 7.5 on an NVIDIA Titan Black GPU show that this technique makes an entire machine-learning application that uses a Latent Dirichlet Allocation topic model with 1024 topics about about 13% faster (when using single-precision floating-point data) or about 35% faster (when using double precision floating-point data) than doing a straightforward matrix transposition after using coalesced accesses.

关键词： butterfly coalesced memory access discrete distribution GPU latent Dirichlet allocation LDA machine learning multithreading memory bottleneck parallel computing random sampling SIMD transposed memory access

来源：评论

学校读者我要写书评

暂无评论

MAPA: An Automatic Memory Access Pattern Analyzer for GPU Applications 22

MAPA: An Automatic Memory Access Pattern Analyzer for GPU Ap...

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Jo, Gangwon Jung, Jaehoon Park, Jiyoung Lee, Jaejin Seoul Natl Univ Ctr Manycore Programming Dept Comp Sci & Engn Seoul 08826 South Korea

ISBN: (纸本)9781450344937

Various existing optimization and memory consistency management techniques for GPU applications rely on memory access patterns of kernels. However, they suffer from poor practicality because they require explicit user interventions to extract kernel memory access patterns. This paper proposes an automatic memory-access-pattern analysis framework called MAPA. MAPA is based on a source-level analysis technique derived from traditional symbolic analyses and a run-time pattern selection technique. The experimental results show that MAPA properly analyzes 116 real-world OpenCL kernels from Rodinia and Parboil.

关键词： Auto-tuning Compiler GPGPU Memory access pattern OpenCL Optimization Symbolic analysis

来源：评论

学校读者我要写书评

暂无评论

Synchronized-by-Default Concurrency for Shared-Memory Systems 17

Synchronized-by-Default Concurrency for Shared-Memory System...

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Battig, Martin Gross, Thomas R. Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

ISBN: (纸本)9781450344937

We explore a programming approach for concurrency that synchronizes all accesses to shared memory by default. Synchronization takes place by ensuring that all program code runs inside atomic sections even if the program code has external side effects. Threads are mapped to atomic sections that a programmer must explicitly split to increase concurrency. A naive implementation of this approach incurs a large amount of overhead. We show how to reduce this overhead to make the approach suitable for realistic application programs on existing hardware. We present an implementation technique based on a special-purpose software transactional memory system. To reduce the overhead, the technique exploits properties of managed, object-oriented programming languages as well as intraprocedural static analyses and uses field-level granularity locking in combination with transactional I/O to provide good scaling properties. We implemented the synchronized-by-default (SBD) approach for the Java language and evaluate its performance for six programs from the DaCapo benchmark suite. The evaluation shows that, compared to explicit synchronization, the SBD approach has an overhead between 0.4% and 102% depending on the benchmark and the number of threads, with a mean (geom.) of 23.9%.

关键词： Atomic blocks Concurrency parallel programming Synchronization Transactional memory

来源：评论

学校读者我要写书评

暂无评论

Groute: An Asynchronous Multi-GPU programming Model for Irregular Computations 17

Groute: An Asynchronous Multi-GPU Programming Model for Irre...

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Ben-Nun, Tal Sutton, Michael Pai, Sreepathi Pingali, Keshav Hebrew Univ Jerusalem Jerusalem Israel Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450344937

Nodes with multiple GPUs are becoming the platform of choice for high-performance computing. However, most applications are written using bulk-synchronous programming models, which may not be optimal for irregular algorithms that benefit from low-latency, asynchronous communication. This paper proposes constructs for asynchronous multi-GPU programming, and describes their implementation in a thin runtime environment called Groute. Groute also implements common collective operations and distributed work-lists, enabling the development of irregular applications without substantial programming effort. We demonstrate that this approach achieves state-of-the-art performance and exhibits strong scaling for a suite of irregular applications on 8-GPU and heterogeneous systems, yielding over 7x speedup for some algorithms.

关键词： Multi-GPU Asynchronous programming Irregular Algorithms

来源：评论

学校读者我要写书评

暂无评论

SC-Haskell: Sequential Consistency in Languages That Minimize Mutable Shared Heap 17

SC-Haskell: Sequential Consistency in Languages That Minimiz...

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Vollmer, Michael Scott, Ryan G. Musuvathi, Madanlal Newton, Ryan R. Indiana Univ Bloomington IN 47405 USA Microsoft Res New York NY USA

ISBN: (纸本)9781450344937

A core, but often neglected, aspect of a programming language design is its memory (consistency) model. Sequential consistency (SC) is the most intuitive memory model for programmers as it guarantees sequential composition of instructions and provides a simple abstraction of shared memory as a single global store with atomic read and writes. Unfortunately, SC is widely considered to be impractical due to its associated performance overheads. Perhaps contrary to popular opinion, this paper demonstrates that SC is achievable with acceptable performance overheads for mainstream languages that minimize mutable shared heap. In particular, we modify the Glasgow Haskell Compiler to insert fences on all writes to shared mutable memory accessed in nonfunctional parts of the program. For a benchmark suite containing 1,279 programs, SC adds a geomean overhead of less than 0.4% on an x86 machine. The efficiency of SC arises primarily due to the isolation provided by the Haskell type system between purely functional and thread-local imperative computations on the one hand, and imperative computations on the global heap on the other. We show how to use new programming idioms to further reduce the SC overhead;these create a virtuous cycle of less overhead and even stronger semantic guarantees (static data-race freedom).

关键词： memory models functional programming sequential consistency

来源：评论

学校读者我要写书评

暂无评论

proceedings of the acm sigplan symposium on principles and practice of parallel programming, PPOPP

Proceedings of the ACM SIGPLAN Symposium on Principles and P...

引用

22nd acm sigplan symposium on principles and practice of parallel programming, PPoPP 2017

ISBN: (纸本)9781450344937

The proceedings contain 46 papers. The topics discussed include: layout lock: a scalable locking paradigm for concurrent data layout modifications;understanding the GPU microarchitecture to achieve bare-metal performance tuning;an efficient abortable-locking protocol for multi-level NUMA systems;contention in structured concurrency: provably efficient dynamic non-zero indicators for nested parallelism;noise injection techniques to expose subtle and unintended message races;thread data sharing in cache: theory and measurement;exploiting vector and multicore parallelism for recursive, data- and task-parallel programs;isoefficiency in practice: configuring and understanding the performance of task-based applications;processor-oblivious record and replay;and groute: an asynchronous multi-GPU programming model for irregular computations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

POSTER: Provably Efficient Scheduling of Cache-Oblivious Wavefront Algorithms 17

POSTER: Provably Efficient Scheduling of Cache-Oblivious Wav...

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Chowdhury, Rezaul Ganapathi, Pramod Tang, Yuan Tithi, Jesmin Jahan SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Fudan Univ Sch Software Shanghai Key Lab Intelligent Informat Proc Shanghai Peoples R China Intel Corp Santa Clara CA USA

ISBN: (纸本)9781450344937

Standard cache-oblivious recursive divide-and-conquer algorithms for evaluating dynamic programming recurrences have optimal serial cache complexity but often have lower parallelism compared with iterative wavefront algorithms due to artificial dependencies among subtasks. Very recently cache-oblivious recursive wavefront (COW) algorithms have been introduced which do not have any artificial dependencies. Though COW algorithms are based on fork-join primitives, they extensively use atomic operations, and as a result, performance guarantees provided by state-of-the-art schedulers for programs with fork-join primitives do not apply. In this work, we show how to systematically transform standard cache-oblivious recursive divide-and-conquer algorithms into recursive wavefront algorithms to achieve optimal parallel cache complexity and high parallelism under state-of-the-art schedulers for fork join programs. Unlike COW algorithms these new algorithms do not use atomic operations. Instead, they use closed-form formulas to compute at what time each recursive function must be launched in order to achieve high parallelism without losing cache performance. The resulting implementations are arguably much simpler than implementations of known COW algorithms.

关键词： recursive wavefront cache-oblivious parallel divide-and-conquer dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A Multicore Path to Connectomics-on-Demand 17

A Multicore Path to Connectomics-on-Demand

引用

22nd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Matveev, Alexander Meirovitch, Yaron Saribekyan, Hayk Jakubiuk, Wiktor Kaler, Tim Odor, Gergely Budden, David Zlateski, Aleksandar Shavit, Nir MIT 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781450344937

The current design trend in large scale machine learning is to use distributed clusters of CPUs and GPUs with MapReduce-style programming. Some have been led to believe that this type of horizontal scaling can reduce or even eliminate the need for traditional algorithm development, careful parallelization, and performance engineering. This paper is a case study showing the contrary: that the benefits of algorithms, parallelization, and performance engineering, can sometimes be so vast that it is possible to solve "cluster-scale" problems on a single commodity multicore machine. Connectomics is an emerging area of neurobiology that uses cutting edge machine learning and image processing to extract brain connectivity graphs from electron microscopy images. It has long been assumed that the processing of connectomics data will require mass storage, farms of CPU/GPUs, and will take months (if not years) of processing time. We present a high-throughput connectomics-on-demand system that runs on a multicore machine with less than 100 cores and extracts connectomes at the terabyte per hour pace of modern electron microscopes.

关键词： Multicore programming Machine Learning Big-Data Connectomics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共7页 << < 1 2 3 4 5 6 7 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：