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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

352 篇 会议
18 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

259 篇 工学
- 256 篇 计算机科学与技术...
- 173 篇 软件工程
- 25 篇 电气工程
- 25 篇 信息与通信工程
- 19 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 4 篇 农业工程
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 生物医学工程（可授...
- 2 篇 安全科学与工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
154 篇 理学
- 151 篇 数学
- 25 篇 统计学（可授理学、...
- 3 篇 生物学
- 3 篇 系统科学
- 1 篇 化学
15 篇 管理学
- 12 篇 管理科学与工程(可...
- 9 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

82 篇 parallel algorit...
71 篇 parallel process...
12 篇 parallel program...
11 篇 computer program...
9 篇 scheduling
8 篇 computer archite...
7 篇 pram
6 篇 computer systems...
5 篇 graph algorithms
4 篇 performance
4 篇 parallel archite...
4 篇 sorting
4 篇 multithreading
4 篇 transactional me...
4 篇 work stealing
3 篇 parallel process...
3 篇 parallelism
3 篇 approximation al...
3 篇 cilk
3 篇 chip multiproces...

机构

10 篇 carnegie mellon ...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 department of co...
3 篇 university of ma...
3 篇 mit 77 massachus...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ of toronto ...
2 篇 dept. of compute...
2 篇 at and t bell la...
2 篇 sandia national ...
2 篇 computer science...
2 篇 univ of californ...
2 篇 department of ma...
2 篇 digital systems ...
2 篇 t.j. watson rese...
2 篇 max planck inst ...
2 篇 bell laboratorie...

作者

12 篇 gibbons phillip ...
11 篇 blelloch guy e.
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 matias yossi
4 篇 uzi vishkin
4 篇 cormen thomas h.
4 篇 ramachandran vij...
4 篇 vitter jeffrey s...
4 篇 muthukrishnan s.
4 篇 goodrich michael...
4 篇 meyer auf der he...
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 deng xiaotie
3 篇 tangwongsan kana...
3 篇 monien burkhard
3 篇 sohn andrew
3 篇 leighton tom
3 篇 simhadri harsha ...

语言

357 篇 英文
13 篇 其他

检索条件"任意字段=Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures"

共 370 条记录，以下是181-190 订阅

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

详细简洁

排序：

Approximation algorithms for structured communication problems 97

Approximation algorithms for structured communication proble...

引用

proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA

作者： Barth, Dominique Fraigniaud, Pierre Universite de Paris Sud - CNRS Orsay France

ISBN: (纸本)9780897918909

Given a network of processors, a structured communication problem consists to route a communication pattern known in advance. Structured communication problems appear frequently in parallel computing. Hence, communication libraries (e.g, PVM or MPI) generally include a specific access to procedures solving the most common problems of this type. A standard communication model assumes that information proceeds by a sequence of calls between neighboring nodes of the network, and that each node is allowed to call at most one neighbor at a time. In this context, most of the decision problems corresponding to the usual structured communication problems have been shown to be NP-complete. Therefore, several approximation algorithms have been proposed to solve specific problems. Each of these algorithms is dedicated to a particular problem. In this paper, we present a high level method which can be used to derive approximation algorithms for many different structured communication problems on arbitrary networks. This method is shown to be quite efficient. For instance, in the case of broadcasting (one-to-all) and gossiping (all-to-all), it allows to obtain algorithms which approach, and even sometime achieve, the performances of the best known algorithms which were designed using specific techniques defined in purpose for each problem. Moreover, in the case of scattering (personalized one-to-all) and multi-scattering (personalized all-to-all), our method allows to obtain optimal results. Our method is based on the simulation on arbitrary networks of movements of data induced by communication algorithms derived for specific architectures and/or specific communication models. This simulation uses sophisticated embedding and scheduling techniques.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

annual acm symposium on parallelism in algorithms and architectures

Annual ACM Symposium on Parallelism in Algorithms and Archit...

引用

27th acm symposium on parallelism in algorithms and architectures, SPAA 2015

ISBN: (纸本)9781450335881

The proceedings contain 42 papers. The topics discussed include: sorting with asymmetric read and write costs;myths and misconceptions about threads;new streaming algorithms for parameterized maximal matching & beyond;efficient approximation algorithms for computing k disjoint restricted shortest paths;fast and better distributed MapReduce algorithms for k-center clustering;fair adaptive parallelism for concurrent transactional memory applications;towards a universal approach for the finite departure problem in overlay networks;a compiler-runtime application binary interface for pipe-while loops;the Cilkprof scalability profiler;efficiently detecting races in Cilk programs that use reducer hyperobjects;ThreadScan: automatic and scalable memory reclamation;temporal fairness of round robin: competitive analysis for Lk-norms of flow time;and space and time efficient parallel graph decomposition, clustering, and diameter approximation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Serial-parallel Reciprocity in Dynamic Multithreaded Languages 10

Brief Announcement: Serial-Parallel Reciprocity in Dynamic M...

引用

22nd acm symposium on parallelism in algorithms and architectures

作者： Agrawal, Kunal Lee, I-Ting Angelina Sukha, Jim Washington Univ St Louis MO 63130 USA

ISBN: (纸本)9781450300797

In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting SP-reciprocity, the property of allowing arbitrary calling between parallel and serial code, including legacy serial binaries. Many known dynamically multithreaded platforms either fail to support SP-reciprocity or sacrifice on the provable time and space bounds that an efficient work-stealing scheduler could otherwise guarantee We describe PR-Cilk, a design of a runtime system that supports SP-reciprocity in Cilk and provides provable bounds on time and space In order to maintain the space bound, PR-Cilk uses subtree-restricted work stealing. We show that with subtree-restricted work stealing. PR-Cilk provides the same guarantee on stack space usage as ordinary Cilk. The completion time guaranteed by PR-Cilk is slightly worse than ordinary Cilk Nevertheless, if the number of times a C function calls a Cilk function is small, or if each Cilk function called by a C function is sufficiently parallel. PR-Cilk still guarantees linear speedup.

关键词： Cilk dynamic multithreading Intel Threading Building Blocks scheduling work stealing serial-parallel reciprocity

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for Approximate Shortest Paths 24

Massively Parallel Algorithms for Approximate Shortest Paths

引用

36th acm symposium on parallelism in algorithms and architectures (SPAA)

作者： Dory, Michal Matar, Shaked Univ Haifa Haifa Israel Ben Gurion Univ Negev Beer Sheva Israel

ISBN: (纸本)9798400704161

We present fast algorithms for approximate shortest paths in the massively parallel computation (MPC) model. We provide randomized algorithms that take poly(log log n) rounds in the near-linear memory MPC model. Our results are for unweighted undirected graphs with.. vertices and m edges. Our first contribution is a (1 + epsilon)-approximation algorithm for Single-Source Shortest Paths (SSSP) that takes poly(log log n) rounds in the near-linear MPC model, where the memory per machine is (O) over tilde (n) and the total memory is (O) over tilde (mn(rho)), where rho is a small constant. Our second contribution is a distance oracle that allows to approximate the distance between any pair of vertices. The distance oracle is constructed in poly(log log n) rounds and allows to query a (1+epsilon) (2k-1)-approximate distance between any pair of vertices u and v in O(1) additional rounds. The algorithm is for the near-linear memory MPC model with total memory of size (O) over tilde ((m+n(1+rho))n(1/k)), where rho is a small constant. While our algorithms are for the near-linear MPC model, in fact they only use one machine with (O) over tilde (n) memory, where the rest of machines can have sublinear memory of size (O) over tilde (n(gamma)) for a small constant gamma < 1. All previous algorithms for approximate shortest paths in the near-linear MPC model either required Omega(log n) rounds or had an Omega(log n) approximation. Our approach is based on fast construction of near-additive emulators, limited-scale hopsets and limited-scale distance sketches that are tailored for the MPC model. While our end-results are for the near-linear MPC model, many of the tools we construct such as hopsets and emulators are constructed in the more restricted sublinear MPC model.

关键词： Approximate Shortest Paths Massively parallel Computation Hopsets Emulators Distance Oracles

来源：评论

学校读者我要写书评

暂无评论

High-probability parallel transitive closure algorithms 90

High-probability parallel transitive closure algorithms

引用

SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures

作者： Ullman, Jeffrey D. Yannakakis, Mihalis Stanford Univ Stanford KY United States

ISBN: (纸本)0897913701

The authors address the apparently difficult problem of doing parallel transitive closure when the (directed) graph is sparse and/or, only single-source information is desired. O(e) work is their target for the single-source problem. When the graph is sparse, then the all-pairs transitive closure problem can be solved by performing a depth-first search from each node, taking O(ne) time;that is their target for the all-pairs problem. The authors do not reach either target, except for the all-pairs case when e is fairly large. However, they make significant progress, in the sense that they have the first algorithms that simultaneously use time much less than linear and use work that is less than M(n).

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Fully dynamic search trees for an extension of the BSP model 96

Fully dynamic search trees for an extension of the BSP model

引用

proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures

作者： Baumker, Armin Dittrich, Wolfgang Univ of Paderborn Paderborn Germany

ISBN: (纸本)9780897918091

We present parallel algorithms that maintain a 2-3 tree under insertions and deletions. The algorithms are designed for an extension of Valiant's BSP model, BSP*, that and reduction of the overhead involved in communication. The BSP*-model is introduced by Baumker et al. in [2]. Our analysis of the data structure goes beyond standard asymptotic analysis: We use Valiant's notion of c-optimality. Intuitively c-optimal algorithms tend to speedup p/c with growing input size (p denotes the number of processors), where the communication time is asymptotically smaller than the computation time. Our first approach allows 1-optimal searching and amortized c-optimal insertion and deletion for a small constant c. The second one allows 2-optimal searching, and c-optimal deletion and insertion for a small constant c. Both results hold with probability 1-o(1) for wide ranges of BSP*-parameters, where the ranges become larger with growing input sizes. The first approach allows much larger ranges. Further, both approaches are memory efficient, their total amount of memory used is proportional to the size m of the set being stored. Our results improve previous results by supporting a fully dynamic search tree rather than a static one, and by significantly reducing the communication time. Further our algorithms use blockwise communication.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Segment router: A novel router design for parallel computers 94

Segment router: A novel router design for parallel computers

引用

proceedings of the 6th annual acm symposium on parallel algorithms and architectures

作者： Konstantinidou, S. IBM T.J. Watson Research Center Yorktown Heights NY

ISBN: (纸本)9780897916714

In this paper we present the Segment router, a novel router design for the interconnection networks of massively parallel computers. The design decisions of the Segment router are motivated by the need to improve the network performance when the traffic consists of messages with widely different *** key novelty of the Segment router is that it provides different queueing policies for the two classes of messages it services. Short messages are stored in a centralized, dynamically allocated queue that guarantees storage availability for the whole packet of the short message. Long messages on the other hand are stored in small FIFO buffers associated with the input channels of the router. Thus when a long message becomes blocked, it is stored in segments in the FIFO buffers of a number of routing elements in the network. Furthermore, the physical channels of the Segment router are fairly multiplexed between the two supported classes of messages without the potential for *** simulations we compare the performance of our technique to the performance of multipacket messages and networks implementing lanes. The results clearly demonstrate the performance advantages of our technique.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

Efficient wiring of reconfigurable parallel processors 93

Efficient wiring of reconfigurable parallel processors

引用

5th annual acm symposium on parallel algorithms and architectures, SPAA 1993

作者： Greenberg, David S. Sandia National Laboratories Mail Stop 1423 P.O. Box 5800 AlbuquerqueNM87185-5800 United States

ISBN: (纸本)0897915992

Chips (or chip sets) which include one or more CPUs, some local memory, and rudimentary communications and routing hardware are becoming common (eg. transputers, SRCs HNet, the nodes of most MIMD machines). These chips provide the possibility of tailoring the topology of a machine to a particular problem. Rather than asking the standard question of how to best coerce one's algorithm to fit an existing topology, one can ask what would be the best topology for the algorithm. This paper defines the efficiency of a topology for an algorithm and gives upper and lower bounds on the best efficiency achievable (as a function of the number of different communication patterns used by the algorithm). This approach is then applied to algorithms which use stencil patterned communications. The result is the definition of topologies which are significantly more efficient than the naive topology. © 1993 acm.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Anticipatory instruction scheduling 96

Anticipatory instruction scheduling

引用

proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures

作者： Sarkar, Vivek Simons, Barbara Application Development Technology Inst San Jose CA United States

ISBN: (纸本)9780897918091

Modern processors have many levels of parallelism arising from multiple functional units and pipeline stages. In this paper, we consider the interplay between instruction scheduling performed by a compiler and instruction lookahead performed by hardware. Anticipatory instruction scheduling is the process of rearranging instructions within each basic block so as to minimize the overall completion time of a set of basic blocks in the presence of hardware instruction lookahead, while preserving safety by not moving any instructions beyond basic block boundaries. Anticipatory instruction scheduling delivers many of the benefits of global instruction scheduling by accounting for instruction overlap across basic block boundaries arising from hardware lookahead, without compromising safety (as in some speculative scheduling techniques) or serviceability of the compiled program. We present the first probably optimal algorithm for a special case of anticipatory instruction scheduling for a trace of basic blocks on a machine with arbitrary size lookahead windows. We extend this result for the version of the problem in which a trace of basic blocks is contained within a loop. In addition, we discuss how to modify these special-case optimal algorithms to obtain heuristics for the more general (but NP-hard) problems that occur in practice.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Implementing and Evaluating Nested parallel Transactions in Software Transactional Memory 10

Implementing and Evaluating Nested Parallel Transactions in ...

引用

22nd acm symposium on parallelism in algorithms and architectures

作者： Baek, Woongki Bronson, Nathan Kozyrakis, Christos Olukotun, Kunle Stanford Univ Comp Syst Lab Stanford CA 94305 USA

ISBN: (纸本)9781450300797

Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications To date, most TM systems have been designed to efficiently support single-level parallelism To achieve widespread use and maximize performance gains. TM must support nested parallelism available in many applications and supported by several programming models. We present NesTM, a software TM (STM) system that supports closed-nested parallel transactions NesTM is based on a high-performance. blocking STM that uses eager version management and word-granularity conflict detection Its algorithm targets the state and runtime overheads of nested parallel transactions We also describe several subtle correctness issues in supporting nested parallel transactions in NesTM and discuss their performance impact Through our evaluation, we quantitatively analyze the performance of NesTM using STAMP applications and microbenchmarks based on concurrent data structures. First, we show that the performance overhead of NesTM is reasonable when single-level parallelism is used. Second. we quantify the incremental overhead of NesTM when the parallelism is exploited in deeper nesting levels and draw conclusions that can be useful in designing a nesting-aware TM runtime environment. Finally, we demonstrate a use-case where nested parallelism improves the performance of a transactional microbenchmark

关键词： Transactional Memory Nested parallelism parallel Programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：