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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

52 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

47 篇 工学
- 43 篇 软件工程
- 30 篇 计算机科学与技术...
- 1 篇 机械工程
- 1 篇 电气工程
- 1 篇 信息与通信工程
5 篇 理学
- 3 篇 数学
- 1 篇 地质学
- 1 篇 系统科学
2 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 教育学
- 1 篇 教育学

主题

8 篇 gpu
7 篇 performance
5 篇 parallel algorit...
5 篇 parallel program...
4 篇 languages
4 篇 algorithms
4 篇 shared memory
4 篇 scheduling
3 篇 parallelism
3 篇 parallel
2 篇 graph algorithms
2 篇 garbage collecti...
2 篇 opencl
2 篇 loop paralleliza...
2 篇 machine learning
2 篇 parallel computi...
2 篇 parallel process...
2 篇 multi-core
1 篇 program debuggin...
1 篇 object computer

机构

5 篇 carnegie mellon ...
2 篇 indiana univ blo...
1 篇 contra costa col...
1 篇 inria
1 篇 rose hulman inst...
1 篇 fudan univ sch c...
1 篇 univ calif river...
1 篇 georgetown univ ...
1 篇 washington unive...
1 篇 lawrence livermo...
1 篇 univ calif san d...
1 篇 tsinghua univ de...
1 篇 software school ...
1 篇 qualcomm technol...
1 篇 carnegie mellon ...
1 篇 the ohio state u...
1 篇 univ chinese aca...
1 篇 univ politecn ca...
1 篇 univ innsbruck i...
1 篇 univ paris 11 cn...

作者

2 篇 chargueraud arth...
2 篇 hoefler torsten
2 篇 blelloch guy e.
2 篇 cui huimin
2 篇 rainey mike
2 篇 lumsdaine andrew
2 篇 shun julian
2 篇 acar umut a.
1 篇 laarman alfons
1 篇 shang honghui
1 篇 fahringer thomas
1 篇 tang hong
1 篇 kalvoda pavel
1 篇 kofler klaus
1 篇 friedley andrew
1 篇 wang lei
1 篇 shen kai
1 篇 warren david h. ...
1 篇 acar umut
1 篇 foster ian t.

语言

53 篇 英文

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

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

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

详细简洁

排序：

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

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

引用

23rd acm sigplan symposium on principles and practice of parallel programming, PPoPP 2018

ISBN: (纸本)9781450349826

The proceedings contain 50 papers. The topics discussed include: interval-based memory reclamation;harnessing epoch-based reclamation for efficient range queries;a persistent lock-free queue for non-volatile memory;hierarchical memory management for mutable state;bridging the gap between deep learning and sparse matrix format selection;optimizing N-dimensional, winograd-based convolution for manycore CPUs;vSensor: leveraging fixed-workload snippets of programs for performance variance detection;featherlight on-the-fly false-sharing detection;communication-avoiding parallel minimum cuts and connected components;and an effective fusion and tile size model for optimizing image processing pipelines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

POSTER: TensorMD: Molecular Dynamics Simulation with Ab Initio Accuracy of 50 Billion Atoms 30

POSTER: TensorMD: Molecular Dynamics Simulation with Ab Init...

引用

30th symposium on principles and practice of parallel programming

作者： Ouyang, Yucheng Liu, Yin Shang, Honghui Chen, Zhenchuan Shan, Jiahao Cui, Huimin Feng, Xiaobing Chen, Xin Gao, Xingyu Wang, Lifang Song, Haifeng Chen, Xin Lin, Rongfen Li, Fang Chinese Acad Sci Inst Comp Technol Beijing Peoples R China Inst Appl Phys & Computat Math Beijing Peoples R China Natl Res Ctr Parallel Comp Engn & Technol Beijing Peoples R China

ISBN: (纸本)9798400714436

Molecular dynamics simulation emerges as an important area that HPC+AI helps to investigate the physical properties, with machine-learning interatomic potentials (MLIPs) being used. General-purpose machine-learning (ML) tools have been leveraged in MLIPs, but they are not perfectly matched with each other, since many optimization opportunities in MLIPs have been missed by ML tools. This inefficiency arises from the fact that HPC+AI applications work with far more computational complexity compared with pure AI scenarios. This paper has developed an MLIP, named TensorMD, independently from any ML tool. TensorMD has been evaluated on two supercomputers and scaled to 51.8 billion atoms, i.e., similar to 3x compared with state-of-the-art.

关键词： Machine Learning Interatomic Potentials ManyCore Processor GPU Molecular Dynamics

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

3rd acm sigplan symposium on principles and practice of parallel programming, PPOPP 1991

ISBN: (纸本)0897913906

The proceedings contain 21 papers. The topics discussed include: optimal schedules for parallel prefix computation with bounded resources;parallel-program transformation using a metalanguage;mapping concurrent programs to VLIW Processors;a unified framework for systematic loop transformations;scanning polyhedra with DO loops;removal of redundant dependence in DOACROSS constant dependence;exploitation of APL data parallelism on a shared-memory MIMD machine;Andorra-I: a parallel prolog system that transparently exploits both and- and or-parallelism;and scalable reader- writer synchronization for shared-memory multiprocessors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

POSTER: Revealing parallel Scans and Reductions in Sequential Loops through Function Reconstruction 23

POSTER: Revealing Parallel Scans and Reductions in Sequentia...

引用

23rd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Jiang, Peng Agrawal, Gagan Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9781450349826

Many sequential loops are actually scans or reductions and can be parallelized across iterations despite the loop-carried dependences. In this work, we consider the parallelization of such scan/reduction loops, and propose a practical runtime approach called sampling-and-reconstruction to extract the hidden scan/reduction patterns in these loops.

关键词： Loop parallelization

来源：评论

学校读者我要写书评

暂无评论

POSTER: Reducing the Burden of parallel Loop Schedulers for Many-Core Processors 23

POSTER: Reducing the Burden of Parallel Loop Schedulers for ...

引用

23rd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Arif, Mahwish Vandierendonck, Hans Queens Univ Belfast Belfast Antrim North Ireland

ISBN: (纸本)9781450349826

This work proposes a low-overhead half-barrier pattern to schedule fine-grain parallel loops and considers its integration in the Intel OpenMP and Cilkplus schedulers. Experimental evaluation demonstrates that the scheduling overhead of our techniques is 43% lower than Intel OpenMP and 12.1 x lower than Cilk. We observe 22% speedup on 48 threads, with a peak of 2.8 x speedup.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

POSTER: A Predictable Synchronisation Algorithm 23

POSTER: A Predictable Synchronisation Algorithm

引用

23rd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Reif, Stefan Schroeder-Preikschat, Wolfgang Friedrich Alexander Univ Erlangen Nurnberg Erlangen Germany

ISBN: (纸本)9781450349826

Interaction with physical objects often imposes latency requirements to multi-core embedded systems. One consequence is the need for synchronisation algorithms that provide predictable latency, in addition to high throughput. We present a synchronisation algorithm that needs at most 7 atomic memory operations per asynchronous critical section. The performance is competitive, at least, to locks.

关键词： Concurrent Data Structures parallel Algorithms Synchronization Predictability

来源：评论

学校读者我要写书评

暂无评论

A Scalable Queue for Work Distribution on GPUs 18

A Scalable Queue for Work Distribution on GPUs

引用

23rd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Kerbl, Bernhard Mueller, Joerg Kenzel, Michael Schmalstieg, Dieter Steinberger, Markus Graz Univ Technol Graz Austria

ISBN: (纸本)9781450349826

Harnessing the power of massively parallel devices like the graphics processing unit (GPU) is difficult for algorithms that show dynamic or inhomogeneous workloads. To achieve high performance, such advanced algorithms require scalable, concurrent queues to collect and distribute work. We present a new concurrent work queue, the Broker Queue, a highly efficient, linearizable queue for fine-granular work distribution on the GPU. We evaluate its usability and benefits in contrast to existing queuing algorithms. Our queue is up to one order of magnitude faster than non-blocking queues, and outperforms simpler queue designs that are unfit for fine-granular work distribution.

关键词： GPU queuing concurrent parallel scheduling

来源：评论

学校读者我要写书评

暂无评论

POSTER: Graph partitioning applied to DAG scheduling to reduce NUMA effects 23

POSTER: Graph partitioning applied to DAG scheduling to redu...

引用

23rd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Sanchez Barrera, Isaac Casas, Marc Moreto, Miguel Ayguade, Eduard Labarta, Jesus Valero, Mateo Univ Politecn Cataluna Barcelona Supercomp Ctr Barcelona Spain

ISBN: (纸本)9781450349826

The complexity of shared memory systems is becoming more relevant as the number of memory domains increases, with different access latencies and bandwidth rates depending on the proximity between the cores and the devices containing the data. In this context, techniques to manage and mitigate non-uniform memory access (NUMA) effects consist in migrating threads, memory pages or both and are typically applied by the system software. We propose techniques at the runtime system level to reduce NUMA effects on parallel applications. We leverage runtime system metadata in terms of a task dependency graph. Our approach, based on graph partitioning methods, is able to provide parallel performance improvements of 1.12x on average with respect to the state-of-the-art.

关键词： shared memory scheduling task-based programming model NUMA graph partitioning

来源：评论

学校读者我要写书评

暂无评论

Communication-Avoiding parallel Minimum Cuts and Connected Components 18

Communication-Avoiding Parallel Minimum Cuts and Connected C...

引用

23rd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Gianinazzi, Lukas Kalvoda, Pavel De Palma, Alessandro Besta, Maciej Hoefler, Torsten Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland Google Inc Mountain View CA USA

ISBN: (纸本)9781450349826

We present novel scalable parallel algorithms for finding global minimum cuts and connected components, which are important and fundamental problems in graph processing. To take advantage of future massively parallel architectures, our algorithms are communication-avoiding: they reduce the costs of communication across the network and the cache hierarchy. The fundamental technique underlying our work is the randomized sparsification of a graph: removing a fraction of graph edges, deriving a solution for such a sparsified graph, and using the result to obtain a solution for the original input. We design and implement sparsification with O(1) synchronization steps. Our global minimum cut algorithm decreases communication costs and computation compared to the state-of-the-art, while our connected components algorithm incurs few cache misses and synchronization steps. We validate our approach by evaluating MPI implementations of the algorithms on a petascale supercomputer. We also provide an approximate variant of the minimum cut algorithm and show that it approximates the exact solutions well while using a fraction of cores in a fraction of time.

关键词： parallel Computing Minimum cuts Randomized Algorithms Graph Algorithms

来源：评论

学校读者我要写书评

暂无评论

PAM: parallel Augmented Maps 18

PAM: Parallel Augmented Maps

引用

23rd acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Sun, Yihan Ferizovic, Daniel Belloch, Guy E. Carnegie Mellon Univ Pittsburgh PA 15213 USA Karlsruhe Inst Technol Karlsruhe Germany

ISBN: (纸本)9781450349826

Ordered (key-value) maps are an important and widely-used data type for large-scale data processing frameworks. Beyond simple search, insertion and deletion, more advanced operations such as range extraction, filtering, and bulk updates form a critical part of these frameworks. We describe an interface for ordered maps that is augmented to support fast range queries and sums, and introduce a parallel and concurrent library called PAM (parallel Augmented Maps) that implements the interface. The interface includes a wide variety of functions on augmented maps ranging from basic insertion and deletion to more interesting functions such as union, intersection, filtering, extracting ranges, splitting, and range-sums. We describe algorithms for these functions that are efficient both in theory and practice. As examples of the use of the interface and the performance of PAM we apply the library to four applications: simple range sums, interval trees, 2D range trees, and ranked word index searching. The interface greatly simplifies the implementation of these data structures over direct implementations. Sequentially the code achieves performance that matches or exceeds existing libraries designed specially for a single application, and in parallel our implementation gets speedups ranging from 40 to 90 on 72 cores with 2-way hyperthreading.

关键词： Data handling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：