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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

416 篇 会议
20 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

306 篇 工学
- 299 篇 计算机科学与技术...
- 192 篇 软件工程
- 31 篇 电气工程
- 27 篇 信息与通信工程
- 20 篇 控制科学与工程
- 9 篇 电子科学与技术（可...
- 4 篇 农业工程
- 4 篇 生物医学工程（可授...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 环境科学与工程（可...
172 篇 理学
- 165 篇 数学
- 25 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 1 篇 化学
16 篇 管理学
- 13 篇 管理科学与工程(可...
- 11 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

92 篇 parallel algorit...
81 篇 parallel process...
14 篇 parallel program...
13 篇 computer program...
10 篇 computer archite...
10 篇 scheduling
8 篇 computer systems...
8 篇 pram
7 篇 parallel process...
6 篇 parallel archite...
5 篇 graph algorithms
5 篇 multithreading
4 篇 performance
4 篇 approximation al...
4 篇 computational ge...
4 篇 bandwidth
4 篇 processor schedu...
4 篇 pipeline process...
4 篇 transactional me...
4 篇 concurrency

机构

11 篇 carnegie mellon ...
4 篇 univ maryland de...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 carnegie mellon ...
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 篇 dipartimento di ...
2 篇 dept. of compute...
2 篇 at and t bell la...
2 篇 sandia national ...
2 篇 ibm t.j. watson ...
2 篇 computer science...
2 篇 univ of californ...
2 篇 department of ma...

作者

12 篇 blelloch guy e.
12 篇 gibbons phillip ...
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 muthukrishnan s.
5 篇 goodrich michael...
5 篇 matias yossi
4 篇 uzi vishkin
4 篇 ramachandran vij...
4 篇 tangwongsan kana...
4 篇 vitter jeffrey s...
4 篇 simhadri harsha ...
4 篇 gu yan
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 tarjan robert e.
3 篇 cormen thomas h.
3 篇 dhulipala laxman
3 篇 deng xiaotie
3 篇 monien burkhard

语言

422 篇 英文
14 篇 其他

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

共 436 条记录，以下是301-310 订阅

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

详细简洁

排序：

Comparison of parallel algorithms for connected components

Comparison of parallel algorithms for connected components

引用

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

作者： Greiner, John

来源：评论

学校读者我要写书评

暂无评论

Linear-work parallel algorithm for finding minimum spanning trees

Linear-work parallel algorithm for finding minimum spanning ...

引用

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

作者： Cole, Richard Klein, Philip N. Tarjan, Robert E.

来源：评论

学校读者我要写书评

暂无评论

parallel Sorting by Overpartitioning 94

Parallel Sorting by Overpartitioning

引用

6th annual acm symposium on parallel algorithms and architectures, SPAA 1994

作者： Li, Hui Sevcik, Kenneth C. Department of Computer Science University of Toronto Canada

ISBN: (纸本)0897916719

A new approach to parallel sorting called parallel Sorting by OverPartitioning (PSOP) is presented. The approach limits the communication cost by moving each element between processors at most once, and leads to good load balancing with high probability. The PSOP framework can be applied to both comparison and non-comparison sorts. Implementations on the KSR1 and Hector shared memory multiprocessors show that PSOP achieves nearly linear speedup and outperforms alternative approaches. An analytical model for PSOP has been developed that predicts the performance within 10% accuracy. © 1994 acm.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

A comparison of parallel algorithms for connected components 94

A comparison of parallel algorithms for connected components

引用

6th annual acm symposium on parallel algorithms and architectures, SPAA 1994

作者： Greiner, John Carnegie Mellon University United States

ISBN: (纸本)0897916719

This paper presents a comparison of the pragmatic aspects of some parallel algorithms for finding connected components, together with optimizations on these algorithms. The algorithms being compared are two similar algorithms by Shiloach-Vishkin [22] and Awerbuch-Shiloach [2], a randomized contraction algorithm based on algorithms by Reif [21] and Phillips [20], and a hybrid algorithm [11]. Improvements are given for the first two to improve performance significantly, although without improving their asymptotic complexity. The hybrid combines features of the others and is generally the fastest of those tested. Timings were made using NESL [4] code as executed on a Connection Machine 2 and Cray Y-MP/C90. © 1994 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient compilation of high-level data parallel algorithms 94

Efficient compilation of high-level data parallel algorithms

引用

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

作者： Suciu, Dan Tannen, Val Univ. of Pennsylvania Philadelpia

ISBN: (纸本)9780897916714

We present a high-level parallel calculus for nested sequences, NSC, offered as a possible theoretical “core” of an entire class of collection-oriented parallel languages. NSC is based on while-loops as opposed to general recursion. A formal, machine independent definition of the parallel time complexity and the work complexity of programs in NSC is given. Our main results are: (1) We give a translation method for a particular form of recursion, called map-recursion, into NSC, that preserves the time complexity and adds an arbitrarily small overhead to the work complexity, and (2) We give a compilation method for NSC into a very simple vector parallel machine, which preserves the time complexity and again adds an arbitrarily small overhead to the work complexity.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Modeling communication in parallel algorithms. A fruitful interaction between theory and systems? 94

Modeling communication in parallel algorithms. A fruitful in...

引用

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

作者： Pal, Singh, Jaswinder Rothberg, Edward Gupta, Anoop Computer Systems Laboratory Stanford University Stanford CA Intel Supercomputer Systems 14924 NW Greenbrier Pkwy C06-09 Beaverton OR

ISBN: (纸本)9780897916714

Recently, several theoretical models of parallel architectures have been proposed to replace the PRAM as the model that is presented to an algorithm designer. A primary focus of the new models is to include the cost of interprocessor communication, which is increasingly important in modern parallel architectures. We argue that modeling the communication costs in the architecture or system is only one part of the problem. The other, and usually much more difficult, part is modeling the communication properties of the algorithm itself, which provides necessary inputs into the architectural model to determine overall complexity. In this context, we make three main points in this paper: (i) It is incomplete to describe communication without regard to its relationship with replication. We propose a description of the communication-replication relationship in terms of the working set hierarchy of an algorithm. (ii) Both inherent communication and the communication-replication relationship can be very difficult to model in irregular, dynamic computations that are crucial in many real-world applications. We present some examples that demonstrate this difficulty. (iii) We believe that substantial leverage can be obtained in this effort from the computer systems community, which can provide a hierarchy of simulation and profiling tools—from abstract to detailed—tailored to the needs of the algorithm designers. We propose an initial set of simulation tools, and we discuss possible future refinements to this set.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

SCHEDULING MALLEABLE AND NONMALLEABLE parallel TASKS

SCHEDULING MALLEABLE AND NONMALLEABLE PARALLEL TASKS

引用

5th annual acm-SIAM symposium on Discrete algorithms

作者： LUDWIG, W TIWARI, P UNIV WISCONSIN DEPT COMP SCIMADISONWI 53706

ISBN: (纸本)0898713293

A malleable parallel task is one that can be executed on any number of processors, with its execution time being a function of the number of processors allotted to it. A nonmalleable parallel task is one that requires a specific number of processors. Given n independent parallel tasks and m identical processors, we consider the problem of scheduling these tasks to minimize makespan. We show that any algorithm for scheduling nonmalleable tasks can be extended to an algorithm for scheduling malleable tasks. The approximation factor of the new algorithm is identical to that of the original algorithm. Meanwhile, only an O(mn) term is added to the running time. Thus we get the best known approximation factor of a polynomial-time algorithm for scheduling malleable parallel tasks, and the fastest running time in which that factor can be achieved. These results can be extended to specific parallel architectures, where not only the number of processors allotted to a task, but also their configuration is a factor. Furthermore, we provide an algorithm for scheduling malleable tasks on a linear array of processors. In this case the addresses of the processors assigned to each task must be contiguous. Our algorithm has an approximation factor of 2, under a natural assumption on the task execution times. In contrast, the best known approximation factor for nonmalleable tasks in this case is 2.5. To the best of our knowledge, this is the only case where the best known approximation factor for malleable tasks is strictly less than that for nonmalleable tasks.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

List ranking and list scan on the Cray C-90 94

List ranking and list scan on the Cray C-90

引用

6th annual acm symposium on parallel algorithms and architectures, SPAA 1994

作者： Reid-Miller, Margaret School of Computer Science Carnegie Mellon University PittsburghPA15213-3891 United States

ISBN: (纸本)0897916719

List ranking and list scan are two primitive operations used in many parallel algorithms that use list, trees, and graph data structures. But vectorizing and parallelizing list ranking is a challenge because it is highly communication intensive and dynamic. In addition, the serial algorithm is very simple and has very small constants. In order to compete, a parallel algorithm must also be simple and have small constants. A parallel algorithm due to Wyllie is such an algorithm, but it is not work efficient-its performance degrades for longer and longer linked lists. In contrast, work efficient PRAM algorithms developed to date have very large constants. We introduce a new fully vectorized and parallelized algorithm that both is work efficient and has small constants. It does not achieve O(log n) running time, but we contend that work efficiency and small constants is more important, given that vector and multiprocessor machines are used for problems that are much larger than the number of processors and, therefore, the O(log n) time is never achieved in practice. In particular, to the best of our knowledge, our implementation of list ranking and list scan on the Cray C-90 is the fastest implementation to date. In addition, it is the first implementation of which we are aware that outperforms fast workstations. The success of our algorithm is due to its relatively large grain size and simplicity of the inner loops, and the success of the implementation is due to pipelining reads and writes through vectorization to hide latency, minimizing load balancing by deriving equations for predicting and optimizing performance, and avoiding conditional tests except when load balancing. © 1994 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Studying overheads in massively parallel Min/Max-tree evaluation (extended abstract) 94

Studying overheads in massively parallel Min/Max-tree evalua...

引用

6th annual acm symposium on parallel algorithms and architectures, SPAA 1994

作者： Feldmann, Rainer Mysliwietz, Peter Monien, Burkhard Department of Mathematics and Computer Science University of Paderborn Germany

ISBN: (纸本)0897916719

In this paper we study the overheads arising in our algorithm for distributed evaluation of Min/Max trees. The overheads are classified into search overhead, performance loss, and decrease of work load. Several mechanisms are investigated to cope with these overheads in order to achieve a high performance. We study a combination of local, medium range, and global load distribution strategies that does not only show a good behavior in terms of work load, but also has a positive influence on the search overhead. The efficient use of a virtual shared memory, that is distributed among the processors, shows also a big contribution to the overall performance of the system. A carefully restricted application of parallelism using an improved version of the Young Brothers Wait Concept (YBWC) leads to a perfect behavior for minimal Min/Max trees and to a quite low search overhead, if well ordered trees are searched. Well ordered trees constitute the most important case in practice, since a couple of move ordering mechanisms are known that achieve a nearly optimal move ordering in many applications. The resulting combination of the methods shows an efficiency better than any previous approach. Experiments carried out using 256 DeBruijn-connected Transputers result in a speedup of 142 even applying restricted timing constraints. With a system consisting of 1024 grid connected Transputers we obtain a speedup of 344. Moreover the algorithm shows a very good scalability, especially using interconnection networks with logarithmic diameter. The experiments have been carried out using a Min/Max search program that incorporates all important state-of-the- art search techniques (Zugzwang, current vice world champion in computer chess) and therefore makes sure, that no artificial or simplifying assumptions on the structure of the problem are made. © 1994 acm.

关键词： Transputers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 27 28 29 30 31 32 33 34 35 36 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：