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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

355 篇 会议
18 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

253 篇 工学
- 250 篇 计算机科学与技术...
- 165 篇 软件工程
- 25 篇 电气工程
- 23 篇 信息与通信工程
- 17 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 4 篇 农业工程
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 生物医学工程（可授...
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
148 篇 理学
- 145 篇 数学
- 23 篇 统计学（可授理学、...
- 3 篇 生物学
- 3 篇 系统科学
- 1 篇 化学
13 篇 管理学
- 10 篇 管理科学与工程(可...
- 9 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

83 篇 parallel algorit...
68 篇 parallel process...
12 篇 parallel program...
11 篇 computer program...
10 篇 scheduling
7 篇 computer archite...
7 篇 pram
6 篇 computer systems...
5 篇 graph algorithms
5 篇 work stealing
4 篇 performance
4 篇 parallel process...
4 篇 parallel archite...
4 篇 multithreading
4 篇 transactional me...
3 篇 parallelism
3 篇 approximation al...
3 篇 cilk
3 篇 sorting
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 篇 ramachandran vij...
4 篇 vitter jeffrey s...
4 篇 muthukrishnan s.
4 篇 goodrich michael...
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 cormen thomas h.
3 篇 deng xiaotie
3 篇 tangwongsan kana...
3 篇 sohn andrew
3 篇 leighton tom
3 篇 simhadri harsha ...
3 篇 miller gary l.
3 篇 gu yan

语言

360 篇 英文
13 篇 其他

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

共 373 条记录，以下是291-300 订阅

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

详细简洁

排序：

Bounds on the efficiency of message-passing protocols for parallel computers 93

Bounds on the efficiency of message-passing protocols for pa...

引用

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

作者： Cypher, Robert Konstantinidou, Smaragda IBM Almaden Research Center San Jose CA

ISBN: (纸本)0897915992

This paper considers the problem of creating message-passing protocols for parallel computers. It is assumed that the processors are connected by a network that provides guaranteed delivery of every message, provided that each message delivered by the network is removed by the receiving processor unconditionally and in finite time. Two models of message-passing are considered, namely a selective model in which the receiver specifies the source of the message, and a nonselective model in which the receiver accepts messages from all sources. We consider only space-efficient protocols in which each processor has storage for a constant number of messages and message headers. We present three main results. First, we give a protocol for the selective model that performs a constant amount of communication per send or receive posted by the application. Second, we prove that no such efficient protocol exists for the nonselective model. Third, we present a protocol for the nonselective model that performs a logarithmic amount of communication per send or receive posted by the application. © 1993 acm.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Fast parallel matching in expander graphs 93

Fast parallel matching in expander graphs

引用

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

作者： Kelson, Pierre Univ. of British Columbia Vancouver B.C. Canada

Let iT be a bipartite graph with bipartition (A, B) where \A\-n and every subset X of A with at most a n elements has at least b\X\ neighbors (o 1). We consider the problem of computing a matching from a given subset... 详细信息

ISBN: (纸本)0897915992

Let iT be a bipartite graph with bipartition (A, B) where \A\-n and every subset X of A with at most a n elements has at least b\X\ neighbors (o < 1,6 > 1). We consider the problem of computing a matching from a given subset X A of size at most a n into B. By Hall's theorem such a matching does indeed exist. We propose two algorithms for this problem. The first algorithm is in NC for b > d' for a constant e > 0;here d denotes the maximum degree of a vertex in A. The second algorithm uses randomization and computes a matching for X provided b = Q(diogd). It terminates in 0(log n) steps for constant d and in polylog(n) time for d = O(polylog(n)) (with high probability). This algorithm is a local algorithm in the sense that the vertices in the graph establish the matching themselves in an online fashion. Both algorithms have applications to local and global routing in communication networks. In particular our results improve a construction of a self-routing nonblocking network by Arora, Leighton, and Maggs. © 1993 acm.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An overview of cray research computers including the Y-MP/C90 and the new MPP T3D 93

An overview of cray research computers including the Y-MP/C9...

引用

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

作者： Oed, Wilfried Walker, Martin Cray Research GmbH Riesstrasse 25 München SO8000 Germany Cray Research Inc. 655 Lone Oak Drive EaganMN55121 United States

ISBN: (纸本)0897915992

The primary purpose of Cray Research computer systems is the timely solution of complex problems in science and engineering. A few examples illustrate that the CRAY C90 is currently the world's most powerful tool for computational science. To complement the vector-parallel architecture of the CRAY Y-MP/C90, Cray Research is developing a massively parallel processor, the CRAY T3D. The salient characteristics of this machine will be described. © 1993 acm.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Issues and directions in scalable parallel computing 93

Issues and directions in scalable parallel computing

引用

proceedings of the 12th annual acm symposium on Principles of Distributed Computing

作者： Snir, Marc T.J. Watson Research Cent Yorktown Heights NY United States

ISBN: (纸本)0897916131

The design and use of scalable parallel computers is discussed. Much of the knowledge gained in the study of distributd systems is relevant, although it needs to be used in new manners. The author argues that the challenge is to achieve maximum reuse of existing technologies, microprocessor architectures, I/O systems, programming languages, operating systems, application codes, without compromising too much parallel performance and scalability. Such skillful compromises are essential to the success of the parallel processing industry, and pose even more intellectual challenges than the 'start from scratch' approach.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Implementing the multiprefix operation on parallel and vector computers 93

Implementing the multiprefix operation on parallel and vecto...

引用

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

作者： Sheffler, Thomas J. Carnegie Mellon University Pittsburgh 15213 PA United States

ISBN: (纸本)0897915992

For a sequence of n values, each with an associated integer label, the multiprefix operation calculates a partial sum for each value summing all preceding values with the same label, and for each label, a reduction value summing all values with that label. The multiprefix operation has been proposed as a parallel primitive because of its power for expressing many data parallel algorithms succinctly. However, most approaches to implementing this operation have been based on special hardware, limiting its usefulness. This paper presents an algorithm for the multiprefix operation on n elements that runs in S-0(y/n) parallel steps on a p = y/n processor CRCW-ARBITRARY PRAM. Because this algorithm performs only W = 0(n) work, it is work efficient. While approaches based on sorting could be implemented in asymptotically fewer parallel steps, the work efficiency of this algorithm, and its low overhead make it attractive for use in real applications. A fully vectorized version of this algorithm has been designed for the CRAY Y-MP and provides good performance for a number of important algorithms. Performance data collected from integer sorting and sparse matrix-vector multiplication benchmarks based on the multiprefix operation achieve speeds that are often better than currently employed algorithms for that machine. © 1993 acm.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel two dimensional pattern matching 93

Optimal parallel two dimensional pattern matching

引用

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

作者： Amir, Amihood Benson, Gary Farach, Martin Georgia Tech United States Department of Mathematics University of Southern California DRB 155 1024 W 36th PI Los AngelesCA90089-1113 United States DIMACS United States College of Computing Georgia Institute of Technology AtlantaGA30332-0280 United States

ISBN: (纸本)0897915992

We present a parallel algorithm for two dimensional matching. This algorithm is optimal in two ways. First, the total number of operations on the text is linear. Second, the algorithm takes time O(logm) on a CREW PRAM, thus matching the lower bound for string matching on a PRAM without concurrent writes. On a CRCW, the algorithm runs in time O(loglogro). Finding such an algorithm was a problem posed in 1985 and has been open since. © 1993 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs 93

Optimal parallel construction of Hamiltonian cycles and span...

引用

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

作者： MacKenzie, Philip D. Stout, Quentin F. Advanced Computer Architecture Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0897915992

We give tight bounds on the parallel complexity of some problems involving random graphs. Specifically, we show that a Hamiltonian cycle, a breadth first spanning tree, and a maximal matching can all be constructed in (logn) expected time using n/lognprocessors on the CRCW PRAM. This is a substantial improvement over the best previous algorithms, which required ((log log n)2) time and nlog2n processors. We then introduce a technique which allows us to prove that constructing an edge cover of a random graph from its adjacency matrix requires (logn) expected time on a CRCW PRAM with O(n) processors. Constructing an edge cover is implicit in constructing a spanning tree, a Hamiltonian cycle, and a maximal matching, so this lower bound holds for all these problems, showing that our algorithms are optimal. This new lower bound technique is one of the very few lower bound techniques known which apply to randomized CRCW PRAM algorithms, and it provides the first nontrivial parallel lower bounds for these problems. © 1993 acm.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel algorithm for the single function coarsest partition problem 93

An efficient parallel algorithm for the single function coar...

引用

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

作者： JáJá, Joseph F. Ryu, Kwan Woo Department of Electrical Engineering Institute for Systems Research Korea Republic of Department of Computer Engineering Kyungpook National University Daegu Korea Republic of Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States

ISBN: (纸本)0897915992

We describe an efficient parallel algorithm to solve the single function coarsest partition problem. The algorithm runs in O(logn) time using 0(n log log n) operations on the Arbitrary CRCW PRAM. The previous best known algorithm runs in 0(log2 n) time using 0(n log2 n) operations on the CREW PRAM. Another algorithm developed independently of ours runs in O(logn) time using 0(n log n) operations on the Arbitrary CRCW PRAM. Our solution is based on efficient algorithms for solving several subproblems that are of independent interest. In particular, we present efficient parallel algorithms to find a minimal starting point of a circular string with respect to lexicographic ordering and to sort lexicographically a list of strings of different lengths. © 1993 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Experience in massively parallel discrete event simulation 93

Experience in massively parallel discrete event simulation

引用

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

作者： Greenberg, Albert G. Lubachevsky, Boris D. Wang, Li-Chung AT and T Bell Laboratories United States University of Texas Austin United States

ISBN: (纸本)0897915992

Discrete event simulation of complex systems is one of the most important problems in scientific and industrial computing. It is not uncommon for a single simulation run to take hours on a high speed workstation. Massively parallel computers provide opportunities for simulating complex systems significantly faster. At the heart of the computational difficulties in parallel simulation are (i) random, data-dependent events that couple subsystems, and (ii) asymmetries wherein some subsystems receive a disproportionate number of events, leading to severe load imbalances. In this paper, we discuss a parallel simulation of a complex system-a large asymmetric circuit-switched network, with state-dependent control-and methods we have apphed to overcome both types of difficulties just mentioned. In a worst case sense, we show that the problem is hard: In particular, simulation of a network with just three nodes is P-complete. However, we show that a general purpose synchronous relaxation method uncovers the parallelism inherent in practical, realistic cases. In addition, we show that special purpose (specific to circuit-switched simulations) parallel methods allow us to profitably assign more processors to subsystems receiving more events, and thereby handle load imbalances. Promising performance results are reported for a 16384 processor MasPar MP-1 implementation, on a realistic 114 node network simulation scenario. © 1993 acm.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共38页 << < 26 27 28 29 30 31 32 33 34 35 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：