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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

515 篇 会议
49 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

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

语言

538 篇 英文
26 篇 其他

检索条件"任意字段=Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming"

共 564 条记录，以下是91-100 订阅

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

详细简洁

排序：

A Study of Tracing Overhead on a High-Performance Linux Cluster 07

A Study of Tracing Overhead on a High-Performance Linux Clus...

引用

acm sigplan symposium on principles and practice of parallel programming

作者： Mohror, Kathryn Karavanic, Karen L. Portland State Univ Dept Comp Sci Portland OR 97207 USA

ISBN: (纸本)9781595936028

Our goal in this work was to identify and quantify the overheads of tracing parallel applications. We investigate several different sources of overhead related to tracing: trace instrumentation, periodic writing of trace files to disk, differing trace buffer sizes, system changes, and increasing numbers of processors in the target application. We encountered overheads as large as 26.7% for writing the trace file to disk. We found that buffer sizes can make a difference in the overheads, and that differences in system software can also contribute to the level of the perturbation. Our results show that the overhead of instrumentation correlates strongly with the number of events, while the overhead of writing the trace buffer increases with increasing numbers of processors.

关键词： parallel performance measurement parallel performance tools tracing overhead measurement perturbation

来源：评论

学校读者我要写书评

暂无评论

parallel programming in modern web search engines 06

Parallel programming in modern web search engines

引用

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

作者： Stata, Raymie Yahoo Inc. Sunnyvale CA United States

ISBN: (纸本)1595931899

When a Search Engine responds to your query, thousands of machines from around the world have cooperated to produce your result. With a global reach of hundreds-of-millions of users, Search Engines are arguably the most commonly used massively-parallel computing systems on the planet. In this talk, we examine Web Search Engines as a case study of parallel programming in a practical context. We focus primarily on the practice of parallel programming, reviewing many ways in which parallel programming is used in a modern Search Engine. We also discuss briefly the principles of parallel programming, listing some of the principles that guide our use of parallelism and speculating a bit on how the mechanics of parallelism might better be automated in our context.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

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

Proceeding of the ACM SIGPLAN symposium on principles and pr...

引用

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

The proceedings contains 14 papers from the conference on the proceedings of the acm sigplan symposium on principles and practice of parallel programming, PPOPP. Topics discussed include: reference idempotency analysis: a framework for optimizing speculative execution;pointer and escape analysis for multithread programs;language support for motion-order matrices;efficient load balancing for wide-area divide-and-conquer applications;scalable queue-based spin locks with timeout;contention ellimination by replication of sequential sections in distributed shared memory programs;and accurate data redistribution cost estimation in software distributes shared memory systems.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

POSTER: Automatic Synthesis of parallel Unix Commands and Pipelines with KUMQUAT 27

POSTER: Automatic Synthesis of Parallel Unix Commands and Pi...

引用

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

作者： Shen, Jiasi Rinard, Martin Vasilakis, Nikos MIT Cambridge MA USA

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

来源：评论

学校读者我要写书评

暂无评论

Implicit parallelism with Ordered Transactions 07

Implicit Parallelism with Ordered Transactions

引用

acm sigplan symposium on principles and practice of parallel programming

作者： von Praun, Christoph Ceze, Luis Cascaval, Calin IBM Research Yorktown Heights NY University of Illinois at Urbana-Champaign Urbana-Champaign IL

ISBN: (纸本)9781595936028

Implicit parallelism with Ordered Transactions (IPOT) is all extension of sequential or explicitly parallel programming models to support speculative parallelization. The key idea is to specify opportunities for parallelization in a sequential program using annotations similar to transactions. Unlike explicit parallelism, IPOT annotations do not require the absence of data dependence, since the parallelization relies oil runtime support for speculative execution. IPOT as a parallel programming model is determinate, i.e., program semantics are independent of the thread scheduling. For optimization, non-determinism can be introduced selectively. We describe the programming model of IPOT and an online tool that recommends boundaries of ordered transactions by observing a sequential execution. On three example HPC workloads we demonstrate that Our method is effective in identifying opportunities for fine-grain parallelization. Using the automated task recommendation tool, we were able to perform the parallelization of each program within a few hours.

关键词： parallel programming program parallelization implicit parallelism thread-level speculation transactional memory ordered transactions

来源：评论

学校读者我要写书评

暂无评论

parallel and Distributed Bounded Model Checking of Multi-threaded Programs 20

Parallel and Distributed Bounded Model Checking of Multi-thr...

引用

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

作者： Inverso, Omar Trubiani, Catia Gran Sasso Sci Inst Laquila Italy

ISBN: (纸本)9781450368186

We introduce a structure-aware parallel technique for context-bounded analysis of concurrent programs. The key intuition consists in decomposing the set of concurrent traces into symbolic subsets that are separately explored by multiple instances of the same decision procedure running in parallel. The decision procedures work on different partitions of the search space without cooperating, whence distribution follows effortlessly. Our experiments on a selection of complex multi-threaded programs show significant analysis speedups and scalability, and greater performance gains than with general-purpose parallel solvers.

关键词： Concurrency Multithreading Sequentialization Software Verification parallel Analysis Bounded Model Checking SAT

来源：评论

学校读者我要写书评

暂无评论

Merge-based Sparse Matrix-Vector Multiplication (SpMV) using the CSR Storage Format 16

Merge-based Sparse Matrix-Vector Multiplication (SpMV) using...

引用

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

作者： Merrill, Duane Garland, Michael NVIDIA Corp Santa Clara CA 95050 USA

ISBN: (纸本)9781450340922

We present a perfectly balanced, "merge-based" parallel method for computing sparse matrix-vector products (SpMV). Our algorithm operates directly upon the Compressed Sparse Row (CSR) sparse matrix format, a predominant in-memory representation for general-purpose sparse linear algebra computations. Our CsrMV performs an equitable multi-partitioning of the input dataset, ensuring that no single thread can be overwhelmed by assignment to (a) arbitrarily-long rows or (b) an arbitrarily-large number of zerolength rows. This parallel decomposition requires neither offline preprocessing nor specialized/ancillary data formats. We evaluate our method on both CPU and GPU microarchitecture across an enormous corpus of diverse real world matrix datasets. We show that traditional CsrMV methods are inconsistent performers subject to order-of-magnitude slowdowns, whereas the performance response of our method is substantially impervious to row-length heterogeneity.

关键词： SpMV segmented reduction sparse matrix sparse graph parallel decomposition merge merge-path GPU

来源：评论

学校读者我要写书评

暂无评论

Building parallel programming language constructs in the AbleC extensible C compiler framework A PPoPP Tutorial 19

Building parallel programming language constructs in the Abl...

引用

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

作者： Carlson, Travis Van Wyk, Eric Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

ISBN: (纸本)9781450362252

In this tutorial participants learn how to build their own parallel programming language features by developing them as language extensions in the ableC [4] extensible C compiler framework. By implementing new parallel programming abstractions as language extensions one can build on an existing host language and thus avoid re-implementing common language features such as the type checking and code generation of arithmetic expressions and control flow statements. Using ableC, one can build expressive language features that fit seamlessly into the C11 host language.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

ARMI: An adaptive, platform independent communication library 03

ARMI: An adaptive, platform independent communication librar...

引用

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

作者： Saunders, S Rauchwerger, L Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA

ISBN: (纸本)9781581135886

ARMI is a communication library that provides a framework for expressing fine-grain parallelism and mapping it to a particular machine using shared-memory and message passing library calls. The library is an advanced implementation of the RMI protocol and handles low-level details such as scheduling incoming communication and aggregating outgoing communication to coarsen parallelism when necessary. These details can be tuned for different platforms to allow user codes to achieve the highest performance possible without manual modification. ARMI is used by STAPL, our generic parallel library, to provide a portable, user transparent communication layer, We present the basic design as well as the mechanisms used in the current Pthreads/OpenMP, MPI implementations and/or a combination thereof. Performance comparisons between ARMI and explicit use of Pthreads or MPI are given on a variety of machines, including an HP V2200, SGI Origin 3800, IBM Regatta-HPC and IBM RS6000 SP cluster.

关键词： languages RMI MPI pthreads OpenMP RPC run-time system communication library parallel programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：