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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

510 篇 会议
49 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

464 篇 工学
- 413 篇 软件工程
- 359 篇 计算机科学与技术...
- 21 篇 电子科学与技术（可...
- 21 篇 控制科学与工程
- 9 篇 信息与通信工程
- 5 篇 机械工程
- 4 篇 电气工程
- 4 篇 生物工程
- 3 篇 动力工程及工程热...
- 3 篇 生物医学工程（可授...
- 2 篇 力学（可授工学、理...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 农业工程
- 1 篇 冶金工程
87 篇 理学
- 78 篇 数学
- 12 篇 系统科学
- 7 篇 统计学（可授理学、...
- 4 篇 生物学
- 2 篇 物理学
- 2 篇 化学
- 1 篇 大气科学
- 1 篇 地质学
26 篇 管理学
- 19 篇 管理科学与工程(可...
- 14 篇 工商管理
- 7 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学
3 篇 法学
- 3 篇 社会学
2 篇 教育学
- 2 篇 教育学
2 篇 农学
- 2 篇 作物学

主题

74 篇 performance
72 篇 parallel process...
62 篇 parallel program...
44 篇 algorithms
42 篇 languages
35 篇 design
26 篇 parallel algorit...
25 篇 gpu
14 篇 computer program...
13 篇 parallel computi...
13 篇 parallel
12 篇 experimentation
12 篇 measurement
10 篇 mpi
10 篇 transactional me...
9 篇 graphics process...
9 篇 theory
9 篇 concurrency
8 篇 synchronization
7 篇 multithreading

机构

13 篇 carnegie mellon ...
7 篇 indiana univ blo...
4 篇 univ wisconsin d...
4 篇 univ chinese aca...
4 篇 univ illinois ur...
4 篇 swiss fed inst t...
4 篇 mit csail united...
4 篇 shanghai jiao to...
4 篇 mit comp sci & a...
4 篇 rice university
4 篇 univ rochester r...
4 篇 purdue univ w la...
3 篇 univ of tokyo
3 篇 tsinghua univ de...
3 篇 massachusetts in...
3 篇 ohio state univ ...
3 篇 carnegie mellon ...
3 篇 inria rocquencou...
3 篇 itmo univ st pet...
3 篇 tsinghua univ pe...

作者

9 篇 chen haibo
8 篇 hoefler torsten
8 篇 blelloch guy e.
8 篇 agrawal kunal
7 篇 garland michael
7 篇 leiserson charle...
6 篇 sun yihan
6 篇 zhai jidong
6 篇 shun julian
6 篇 mellor-crummey j...
5 篇 rainey mike
5 篇 miller barton p.
5 篇 krishnamoorthy s...
5 篇 tsigas philippas
5 篇 padua david
5 篇 nikolopoulos dim...
5 篇 lam monica s.
5 篇 valero mateo
5 篇 scott michael l.
4 篇 taura kenjiro

语言

534 篇 英文
26 篇 其他

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

共 560 条记录，以下是151-160 订阅

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

详细简洁

排序：

Dynamic adaptation to available resources for parallel computing in an autonomous network of workstations 01

Dynamic adaptation to available resources for parallel compu...

引用

8th acm sigplan symposium on the principles and practice of parallel Computing

作者： Rencuzogullari, U Dwarkadas, S Univ Rochester Dept Comp Sci Rochester NY 14627 USA

ISBN: (纸本)9781581133462

Networks of workstations (NOWs), which are generally composed of autonomous compute elements networked together, axe an attractive parallel computing platform since they offer high performance at low cost. The autonomous nature of the environment, however, often results in inefficient utilization due to load imbalances caused by three primary factors: 1) unequal load (compute or communication) assignment to equally-powerful compute nodes, 2) unequal resources at compute nodes, and 3) multiprogramming. These load imbalances result in idle waiting time on cooperating processes that need to synchronize or communicate data. Additional waiting time may result due to local scheduling decisions in a multiprogrammed environment. In this paper, we present a combined approach of compile-time analysis, run-time load distribution, and operating system scheduler cooperation for improved utilization of available resources in an autonomous NOW. The techniques we propose allow efficient resource utilization by taking into consideration all three causes of load imbalance in addition to locality of access in the process of load distribution. The resulting adaptive load distribution and cooperative scheduling system allows applications to take advantage of parallel resources when available by providing better performance than when the loaded resources axe not used at all.

关键词： unbalanced load Load distribution parallel PROCESSING (COMPUTERS) networks of workstations Workstations autonomous network

来源：评论

学校读者我要写书评

暂无评论

Extracting logical structure and identifying stragglers in parallel execution traces 14

Extracting logical structure and identifying stragglers in p...

引用

2014 19th acm sigplan symposium on principles and practice of parallel programming, PPoPP 2014

作者： Isaacs, Katherine E. Gamblin, Todd Bhatele, Abhinav Bremer, Peer-Timo Schulz, Martin Hamann, Bernd Department of Computer Science University of California Davis United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)9781450326568

We introduce a new approach to automatically extract an idealized logical structure from a parallel execution trace. We use this structure to define intuitive metrics such as the lateness of a process involved in a parallel execution. By analyzing and illustrating traces in terms of logical steps, we leverage a developer's understanding of the happened-before relations in a parallel program. This technique can uncover dependency chains, elucidate communication patterns, and highlight sources and propagation of delays, all of which may be obscured in a traditional trace visualization.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Provably and Practically Efficient Granularity Control 19

Provably and Practically Efficient Granularity Control

引用

24th acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Acar, Umut A. Aksenov, Vitaly Chargueraud, Arthur Rainey, Mike Carnegie Mellon Univ Pittsburgh PA 15213 USA INRIA Paris France ITMO Univ St Petersburg Russia Univ Strasbourg ICube CNRS Strasbourg France Indiana Univ Bloomington IN 47405 USA

ISBN: (纸本)9781450362252

Over the past decade, many programming languages and systems for parallel-computing have been developed, e.g., Fork/Join and Habanero Java, parallel Haskell, parallel ML, and X10. Although these systems raise the level of abstraction for writing parallel codes, performance continues to require labor-intensive optimizations for coarsening the granularity of parallel executions. In this paper, we present provably and practically efficient techniques for controlling granularity within the run-time system of the language. Our starting point is "oracle-guided scheduling", a result from the functional-programming community that shows that granularity can be controlled by an "oracle" that can predict the execution time of parallel codes. We give an algorithm for implementing such an oracle and prove that it has the desired theoretical properties under the nested-parallel programming model. We implement the oracle in C++ by extending Cilk and evaluate its practical performance. The results show that our techniques can essentially eliminate hand tuning while closely matching the performance of hand tuned codes.

关键词： parallel programming languages granularity control

来源：评论

学校读者我要写书评

暂无评论

Adding Approximate Counters 16

Adding Approximate Counters

引用

21st acm sigplan symposium on principles and practice of parallel programming (PPoPP)

作者： Steele, Guy L., Jr. Tristan, Jean-Baptiste Oracle Labs Burlington MA 01803 USA

ISBN: (纸本)9781450340922

We describe a general framework for adding the values of two approximate counters to produce a new approximate counter value whose expected estimated value is equal to the sum of the expected estimated values of the given approximate counters. (To the best of our knowledge, this is the first published description of any algorithm for adding two approximate counters.) We then work out implementation details for five different kinds of approximate counter and provide optimized pseudocode. For three of them, we present proofs that the variance of a counter value produced by adding two counter values in this way is bounded, and in fact is no worse, or not much worse, than the variance of the value of a single counter to which the same total number of increment operations have been applied. Addition of approximate counters is useful in massively parallel divide-and-conquer algorithms that use a distributed representation for large arrays of counters. We describe two machine-learning algorithms for topic modeling that use millions of integer counters, and confirm that replacing the integer counters with approximate counters is effective, speeding up a GPU-based implementation by over 65% and a CPU-based by nearly 50%, as well as reducing memory requirements, without degrading their statistical effectiveness.

关键词： approximate counters distributed computing divide and conquer multithreading parallel computing statistical counters

来源：评论

学校读者我要写书评

暂无评论

An Overview of Medusa: Simplified Graph Processing on GPUs 12

An Overview of Medusa: Simplified Graph Processing on GPUs

引用

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

作者： Zhong, Jianlong He, Bingsheng Nanyang Technol Univ Singapore 639798 Singapore

ISBN: (纸本)9781450311601

Graphs are the de facto data structures for many applications, and efficient graph processing is a must for the application performance. GPUs have an order of magnitude higher computational power and memory bandwidth compared to CPUs and have been adopted to accelerate several common graph algorithms. However, it is difficult to write correct and efficient GPU programs and even more difficult for graph processing due to the irregularities of graph structures. To address those difficulties, we propose a programming framework named Medusa to simplify graph processing on GPUs. Medusa offers a small set of APIs, based on which developers can define their application logics by writing sequential code without awareness of GPU architectures. The Medusa runtime system automatically executes the developer defined APIs in parallel on the GPU, with a series of graph-centric optimizations. This poster gives an overview of Medusa, and presents some preliminary results.

关键词： Algorithms Performance GPGPU GPU programming Graph Processing Runtime Framework

来源：评论

学校读者我要写书评

暂无评论

Initial study of multi-endpoint runtime for MPI+OpenMP hybrid programming model on multi-core systems 14

Initial study of multi-endpoint runtime for MPI+OpenMP hybri...

引用

2014 19th acm sigplan symposium on principles and practice of parallel programming, PPoPP 2014

作者： Luo, Miao Lu, Xiaoyi Hamidouche, Khaled Kandalla, Krishna Panda, Dhabaleswar K. Dept. of Computer Science and Engineering Ohio State University United States

ISBN: (纸本)9781450326568

State-of-the-art MPI libraries rely on locks to guarantee thread-safety. This discourages application developers from using multiple threads to perform MPI operations. In this paper, we propose a high performance, lock-free multiendpoint MPI runtime, which can achieve up to 40% improvement for point-to-point operation and one representative collective operation with minimum or no modifications to the existing applications.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

An OpenACC-based unified programming model for multi-accelerator systems 2015

An OpenACC-based unified programming model for multi-acceler...

引用

20th acm sigplan symposium on principles and practice of parallel programming, PPoPP 2015

作者： Kim, Jungwon Lee, Seyong Vetter, Jeffrey S. Oak Ridge National Laboratory United States Georgia Institute of Technology United States

ISBN: (纸本)9781450332057

This paper proposes a novel SPMD programming model of OpenACC. Our model integrates the different granularities of parallelism from vector-level parallelism to node-level parallelism into a single, unified model based on OpenACC. It allows programmers to write programs for multiple accelerators using a uniform programming model whether they are in shared or distributed memory systems. We implement a prototype of our model and evaluate its performance with a GPU-based supercomputer using three benchmark applications.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Race frontier. Reproducing data races in parallel-program debugging 91

Race frontier. Reproducing data races in parallel-program de...

引用

Proceedings of the Third acm sigplan symposium on principles and practice of parallel programming - PPOPP

作者： Choi, Jong-Deok Min, Sang-Lyul

来源：评论

学校读者我要写书评

暂无评论

Data Transformations Enabling Loop Vectorization on Multithreaded Data parallel Architectures

Data Transformations Enabling Loop Vectorization on Multithr...

引用

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

作者： Jang, Byunghyun Mistry, Perhaad Schaa, Dana Dominguez, Rodrigo Kaeli, David Northeastern Univ Dept ECE Boston MA 02115 USA

ISBN: (纸本)9781605587080

Loop vectorization, a key feature exploited to obtain high performance on Single Instruction Multiple Data (SIMD) vector architectures, is significantly hindered by irregular memory access patterns in the data stream. This paper describes data transformations that allow us to vectorize loops targeting massively multithreaded data parallel architectures. We present a mathematical model that captures loop-based memory access patterns and computes the most appropriate data transformations in order to enable vectorization. Our experimental results show that the proposed data transformations can significantly increase the number of loops that can be vectorized and enhance the data-level parallelism of applications. Our results also show that the overhead associated with our data transformations can be easily amortized as the size of the input data set increases. For the set of high performance benchmark kernels studied, we achieve consistent and significant performance improvements (up to 11.4X) by applying vectorization using our data transformation approach.

关键词： Loop Vectorization Data Transformation GPGPU

来源：评论

学校读者我要写书评

暂无评论

Effective Communication and Computation Overlap with Hybrid MPI/SMPSs

Effective Communication and Computation Overlap with Hybrid ...

引用

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

作者： Marjanovic, Vladimir Labarta, Jesus Ayguade, Eduard Valero, Mateo Barcelona Supercomp Ctr BSC CNS Dept Comp Sci Barcelona Spain Tech Univ Catalunya UPC Comp Architecture Dept Barcelona Spain

ISBN: (纸本)9781605587080

Communication overhead is one of the dominant factors affecting performance in high-performance computing systems. To reduce the negative impact of communication, programmers overlap communication and computation by using asynchronous communication primitives. This increases code complexity, requiring more development effort and making less readable programs. This paper presents the hybrid use of MPI and SMPSs (SMP superscalar, a task-based shared-memory programming model) that allows the programmer to easily introduce the asynchrony necessary to overlap communication and computation. We demonstrate the hybrid use of MPI/SMPSs with the high-performance LINPACK benchmark (HPL), and compare it to the pure MPI implementation, which uses the look-ahead technique to overlap communication and computation. The hybrid MPI/SMPSs version significantly improves the performance of the pure MPI version, getting close to the asymptotic performance at medium problem sizes and still getting significant benefits at small/large problem sizes.

关键词： Algorithms Performance Languages parallel programming model MPI hybrid MPI/SMPSs LINPACK

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共56页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：